id int64 0 1.17k | comefrom stringlengths 21 84 | code stringlengths 50 1.89k | masked stringlengths 63 2.47k |
|---|---|---|---|
400 | <awangdev>Interleaving String_4.java | public boolean isInterleave(String s1, String s2, String s3) {
if (s3 == null || (s1 == null && s2 == null) || s1.length() + s2.length() != s3.length()) {
return false;
}
int i = 0;
int j = 0;
String base = "";
for (int k = 0; k < s1.length()*s2.length() - 1; k... | public boolean var_0 ( String var_2 , String var_3 , String var_4 ) {
if ( var_4 == null || ( var_2 == null && var_3 == null ) || var_2 . length ( ) + var_3 . length ( ) != var_4 . length ( ) ) {
return false ;
}
int var_8 = 0 ;
int var_9 = 0 ;
String var_11 = "" ;
for ( int var_12 = 0 ;
var_12 < var_... |
401 | <awangdev>76. Minimum Window Substring_3.java | private boolean valid(int[] source, int[] target) {
for (int i = 0; i < 256; i++) {
if (source[i] < target[i]) return false;
}
return true;
} | private boolean var_0 ( int [ ] var_1 , int [ ] var_2 ) {
for ( int var_4 = 0 ;
var_4 < 256 ;
var_4 ++ ) {
if ( var_1 [ var_4 ] < var_2 [ var_4 ] ) return false ;
}
return true ;
}
|
402 | <awangdev>Kth Largest Element in an Array_2.java | private void swap(int[] nums, int x, int y) {
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
403 | <awangdev>151. Reverse Words in a String_3.java | private String output(char[] arr) {
StringBuffer sb = new StringBuffer();
int count = 0;
for (char c : arr) {
count += c == ' ' ? 1 : 0;
if (count != 0 & c != ' ') count = 0;
if (count <= 1) sb.append(c);
}
return sb.toString().trim();
} | private String var_0 ( char [ ] var_1 ) {
StringBuffer var_3 = new StringBuffer ( ) ;
int var_5 = 0 ;
for ( char var_6 : var_1 ) {
var_5 += var_6 == ' ' ? 1 : 0 ;
if ( var_5 != 0 & var_6 != ' ' ) var_5 = 0 ;
if ( var_5 <= 1 ) var_3 . append ( var_6 ) ;
}
return var_3 . toString ( ) . trim ( ) ;
}
|
404 | <awangdev>875. Koko Eating Bananas_1.java | private int calc(int[] piles, double k) {
int count = 0;
for (int i : piles) {
count += Math.ceil(i / k);
}
return count;
} | private int sample_funcname ( int [ ] var_0 , double var_1 ) {
int var_3 = 0 ;
for ( int var_4 : var_0 ) {
var_3 += Math . ceil ( var_4 / var_1 ) ;
}
return var_3 ;
}
|
405 | <awangdev>Bricks Falling When Hit_3.java | private boolean validate(int[][] grid, int x, int y) {
return x >= 0 && x < grid.length && y >= 0 && y < grid[0].length && grid[x][y] == 1;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 >= 0 && var_2 < var_1 . length && var_3 >= 0 && var_3 < var_1 [ 0 ] . length && var_1 [ var_2 ] [ var_3 ] == 1 ;
}
|
406 | <awangdev>Backpack III_4.java | public int backPackIII(int[] A, int[] V, int m) {
if (A == null || V == null || A.length != V.length) {
return 0;
}
int n = A.length;
int[][] dp = new int[n + 1][m + 1];
for (int j = 0; j <= m; j++) {
dp[0][j] = -1;
}
dp[0][0] = 0;
... | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
if ( var_0 == null || var_1 == null || var_0 . length != var_1 . length ) {
return 0 ;
}
int var_6 = var_0 . length ;
int [ ] [ ] var_8 = new int [ var_6 + 1 ] [ var_2 + 1 ] ;
for ( int var_9 = 0 ;
var_9 <= var_2 ;
var_9 ++ ) {... |
407 | <awangdev>K Edit Distance_1.java | private boolean validate(String word, String target, int k) {
if (word.equals(target)) {
return true;
}
if (Math.abs(word.length() - target.length()) > k) {
return false;
}
int m = word.length();
int n = target.length();
... | private boolean var_0 ( String var_2 , String var_3 , int var_4 ) {
if ( var_2 . equals ( var_3 ) ) {
return true ;
}
if ( Math . abs ( var_2 . length ( ) - var_3 . length ( ) ) > var_4 ) {
return false ;
}
int var_9 = var_2 . length ( ) ;
int var_10 = var_3 . length ( ) ;
int [ ] [ ] var_13 = new... |
408 | <awangdev>105. Construct Binary Tree from Preorder and Inorder Traversal_1.java | private Map<Integer, Integer> buildMap(int[] inorder) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < inorder.length; i++) map.put(inorder[i], i);
return map;
} | private Map < Integer , Integer > var_1 ( int [ ] var_2 ) {
Map < Integer , Integer > var_5 = new HashMap < > ( ) ;
for ( int var_7 = 0 ;
var_7 < var_2 . length ;
var_7 ++ ) var_5 . put ( var_2 [ var_7 ] , var_7 ) ;
return var_5 ;
}
|
409 | <awangdev>Encode and Decode Strings_1.java | public String encode(List<String> strs) {
if (strs.size() == 0) {
return "";
}
StringBuffer sb = new StringBuffer();
for (int i = 0; i < strs.size(); i++) {
sb.append(strs.get(i).length() + "#" + strs.get(i));
}
return sb.toString();
} | public String var_0 ( List < String > var_3 ) {
if ( var_3 . size ( ) == 0 ) {
return "" ;
}
StringBuffer var_8 = new StringBuffer ( ) ;
for ( int var_9 = 0 ;
var_9 < var_3 . size ( ) ;
var_9 ++ ) {
var_8 . append ( var_3 . get ( var_9 ) . length ( ) + "#" + var_3 . get ( var_9 ) ) ;
}
return va... |
410 | <awangdev>Unique Binary Search Tree_2.java | public int numTrees(int n) {
if (n <= 1) {
return 1;
}
int[] count = new int[n + 1];
count[0] = 1;
count[1] = 1;
for (int i = 2; i < n + 1; i++) {
for (int j = 0; j < i; j++) {
count[i] += count[j] * count[i - j - 1];
}
... | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
int [ ] var_2 = new int [ var_0 + 1 ] ;
var_2 [ 0 ] = 1 ;
var_2 [ 1 ] = 1 ;
for ( int var_5 = 2 ;
var_5 < var_0 + 1 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 < var_5 ;
var_6 ++ ) {
var_2 [ var_5 ] += var_2... |
411 | <awangdev>[lint]. Unique Characters_1.java | public boolean isUnique(String str) {
if (str == null || str.length() == 0) return true;
char[] arr = str.toCharArray();
Arrays.sort(arr);
for (int i = 1; i < arr.length; i++) {
if (arr[i] == arr[i - 1]) return false;
}
return true;
} | public boolean var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . length ( ) == 0 ) return true ;
char [ ] var_7 = var_2 . toCharArray ( ) ;
Arrays . sort ( var_7 ) ;
for ( int var_11 = 1 ;
var_11 < var_7 . length ;
var_11 ++ ) {
if ( var_7 [ var_11 ] == var_7 [ var_11 - 1 ] ) return false ;
}
r... |
412 | <awangdev>Walls and Gates_5.java | private boolean validateCoordinate(int[][] rooms, int x, int y) {
return x < 0 || x >= rooms.length || y < 0 || y >= rooms[0].length || rooms[x][y] == -1 || rooms[x][y] == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 < 0 || var_2 >= var_1 . length || var_3 < 0 || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] == - 1 || var_1 [ var_2 ] [ var_3 ] == 0 ;
}
|
413 | <awangdev>724. Find Pivot Index_1.java | public int pivotIndex(int[] nums) {
if (nums == null || nums.length == 0) return -1;
int n = nums.length;
for (int i = 1; i < n; i++) nums[i] += nums[i - 1];
if (nums[n-1] - nums[0] == 0) return 0;
for (int i = 1; i < n; i++) {
if (nums[i - 1] == nums[n - 1]... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return - 1 ;
int var_5 = var_0 . length ;
for ( int var_6 = 1 ;
var_6 < var_5 ;
var_6 ++ ) var_0 [ var_6 ] += var_0 [ var_6 - 1 ] ;
if ( var_0 [ var_5 - 1 ] - var_0 [ 0 ] == 0 ) return 0 ;
for ( int var_6 = 1 ;
va... |
414 | <awangdev>Basic Calculator_1.java | private int getWeight(int base, char c) {
if (c == '(') return base + 10;
if (c == ')') return base - 10;
if (c == '+' || c == '-') return base + 1;
if (c == '*' || c == '/') return base + 2;
return Integer.MAX_VALUE;
} | private int sample_funcname ( int var_0 , char var_1 ) {
if ( var_1 == '(' ) return var_0 + 10 ;
if ( var_1 == ')' ) return var_0 - 10 ;
if ( var_1 == '+' || var_1 == '-' ) return var_0 + 1 ;
if ( var_1 == '*' || var_1 == '/' ) return var_0 + 2 ;
return Integer . MAX_VALUE ;
}
|
415 | <awangdev>727. Minimum Window Subsequence_1.java | private int backtrack(char[] ss, char[] tt, int index) {
for (int i = tt.length - 1; i >= 0; i--) {
while(ss[index--] != tt[i]);
}
return index + 1;
} | private int sample_funcname ( char [ ] var_0 , char [ ] var_1 , int var_2 ) {
for ( int var_5 = var_1 . length - 1 ;
var_5 >= 0 ;
var_5 -- ) {
while ( var_0 [ var_2 -- ] != var_1 [ var_5 ] ) ;
}
return var_2 + 1 ;
}
|
416 | <awangdev>139. Word Break_2.java | private boolean dfs(Set<String> dict, Set<String> set, String s) {
if (dict.contains(s)) return true;
StringBuffer sb = new StringBuffer();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
sb.append(c);
if (dict.contains(sb.toString())) {
... | private boolean sample_funcname ( Set < String > dict , Set < String > set , String s ) {
if ( dict . contains ( s ) ) return true ;
StringBuffer sb = new StringBuffer ( ) ;
for ( int i = 0 ;
i < s . length ( ) ;
i ++ ) {
char c = s . charAt ( i ) ;
sb . append ( c ) ;
if ( dict . contains ( sb . ... |
417 | <awangdev>57. Insert Interval_3.java | private int[][] convert(List<int[]> list) {
int[][] rst = new int[list.size()][2];
for (int i = 0; i < list.size(); i++) {
rst[i][0] = list.get(i)[0];
rst[i][1] = list.get(i)[1];
}
return rst;
} | private int [ ] [ ] sample_funcname ( List < int [ ] > var_1 ) {
int [ ] [ ] var_4 = new int [ var_1 . size ( ) ] [ 2 ] ;
for ( int var_6 = 0 ;
var_6 < var_1 . size ( ) ;
var_6 ++ ) {
var_4 [ var_6 ] [ 0 ] = var_1 . get ( var_6 ) [ 0 ] ;
var_4 [ var_6 ] [ 1 ] = var_1 . get ( var_6 ) [ 1 ] ;
}
return... |
418 | <awangdev>Add Digits_1.java | public int addDigits(int num) {
if (num < 10) {
return num;
}
while (num > 9) {
int temp = 0;
while (num != 0) {
temp += num % 10;
num = num / 10;
}
num = temp;
}
return num;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 < 10 ) {
return var_0 ;
}
while ( var_0 > 9 ) {
int var_4 = 0 ;
while ( var_0 != 0 ) {
var_4 += var_0 % 10 ;
var_0 = var_0 / 10 ;
}
var_0 = var_4 ;
}
return var_0 ;
}
|
419 | <awangdev>896. Monotonic Array_1.java | private boolean validate(int a, int b, boolean incline) {
if (incline) return a <= b;
return a >= b;
} | private boolean var_0 ( int var_1 , int var_2 , boolean var_4 ) {
if ( var_4 ) return var_1 <= var_2 ;
return var_1 >= var_2 ;
}
|
420 | <awangdev>739. Daily Temperatures_2.java | public int[] dailyTemperatures(int[] T) {
int n = T.length;
int[] rst = new int[n];
Integer[] tempIndex = new Integer[101];
for (int i = n - 1; i >= 0; i--) {
int num = T[i], warmerIndex = Integer.MAX_VALUE;;
for (int t = num + 1; t <= 100; ... | public int [ ] sample_funcname ( int [ ] var_0 ) {
int var_2 = var_0 . length ;
int [ ] var_3 = new int [ var_2 ] ;
Integer [ ] var_6 = new Integer [ 101 ] ;
for ( int var_8 = var_2 - 1 ;
var_8 >= 0 ;
var_8 -- ) {
int var_10 = var_0 [ var_8 ] , var_12 = Integer . MAX_VALUE ;
;
for ( int var_13 =... |
421 | <awangdev>1021. Remove Outermost Parentheses_1.java | private boolean isPair(char a, char b) {
return a == '(' && b ==')';
} | private boolean var_0 ( char var_1 , char var_2 ) {
return var_1 == '(' && var_2 == ')' ;
}
|
422 | <awangdev>Contains Duplicate III_1.java | public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
if (nums == null || nums.length == 0 || k <= 0 || t < 0) {
return false;
}
TreeSet<Long> treeSet = new TreeSet<>();
for (int i = 0; i < nums.length; i++) {
Long target = treeSet.ceiling((long... | public boolean var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
if ( var_1 == null || var_1 . length == 0 || var_2 <= 0 || var_3 < 0 ) {
return false ;
}
TreeSet < Long > var_9 = new TreeSet < > ( ) ;
for ( int var_10 = 0 ;
var_10 < var_1 . length ;
var_10 ++ ) {
Long var_12 = var_9 . ceiling ( ( l... |
423 | <awangdev>239. Sliding Window Maximum_3.java | private void inQueue(Deque<Integer> deque, int num) {
while (!deque.isEmpty() && deque.peekLast() < num) {
deque.pollLast();
}
deque.offerLast(num);
} | private void var_0 ( Deque < Integer > var_3 , int var_4 ) {
while ( ! var_3 . isEmpty ( ) && var_3 . peekLast ( ) < var_4 ) {
var_3 . pollLast ( ) ;
}
var_3 . offerLast ( var_4 ) ;
}
|
424 | <awangdev>Search Insert Position_1.java | public int searchInsert(int[] A, int target) {
if (A == null || A.length == 0) {
return 0;
}
int start = 0;
int end = A.length - 1;
int mid = start + (end - start)/2;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] ... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_5 = 0 ;
int var_7 = var_0 . length - 1 ;
int var_9 = var_5 + ( var_7 - var_5 ) / 2 ;
while ( var_5 + 1 < var_7 ) {
var_9 = var_5 + ( var_7 - var_5 ) / 2 ;
if ( var_0 [ va... |
425 | <awangdev>788. Rotated Digits_1.java | private int[] freq(int num) {
int[] count = new int[10];
while (num != 0) {
count[num%10]++;
num /= 10;
}
return count;
} | private int [ ] sample_funcname ( int var_0 ) {
int [ ] var_2 = new int [ 10 ] ;
while ( var_0 != 0 ) {
var_2 [ var_0 % 10 ] ++ ;
var_0 /= 10 ;
}
return var_2 ;
}
|
426 | <awangdev>Reverse Words in a String II_2.java | public void reverseWords(char[] s) {
if (s == null || s.length == 0) {
return;
}
int len = s.length;
for (int i = 0; i < len / 2; i++) {
char temp = s[i];
s[i] = s[len - 1 - i];
s[len - 1 - i] = temp;
}
int start = 0;
... | public void var_0 ( char [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return ;
}
int var_5 = var_1 . length ;
for ( int var_6 = 0 ;
var_6 < var_5 / 2 ;
var_6 ++ ) {
char var_8 = var_1 [ var_6 ] ;
var_1 [ var_6 ] = var_1 [ var_5 - 1 - var_6 ] ;
var_1 [ var_5 - 1 - var_6 ] = var... |
427 | <awangdev>Largest Number_1.java | public String largestNumber(int[] num) {
if (num == null || num.length == 0) {
return "";
}
String[] strs = new String[num.length];
for (int i = 0; i < num.length; i++) {
strs[i] = num[i] + "";
}
Arrays.sort(strs, new Comparator<String>() {
... | public String var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return "" ;
}
String [ ] var_7 = new String [ var_1 . length ] ;
for ( int var_8 = 0 ;
var_8 < var_1 . length ;
var_8 ++ ) {
var_7 [ var_8 ] = var_1 [ var_8 ] + "" ;
}
Arrays . sort ( var_7 , new Comparator < S... |
428 | <awangdev>Majority Number III_1.java | public int majorityNumber(ArrayList<Integer> nums, int k) {
if (nums == null || nums.size() == 0) {
return -1;
}
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
for (Integer num : nums) {
if (map.containsKey(num)) {
map.put(num, ma... | public int sample_funcname ( ArrayList < Integer > var_2 , int var_3 ) {
if ( var_2 == null || var_2 . size ( ) == 0 ) {
return - 1 ;
}
HashMap < Integer , Integer > var_9 = new HashMap < Integer , Integer > ( ) ;
for ( Integer var_10 : var_2 ) {
if ( var_9 . containsKey ( var_10 ) ) {
var_9 . put... |
429 | <awangdev>Number Of Corner Rectangles_1.java | private boolean validate(int[][] grid) {
return grid == null || grid.length == 0 || grid[0] == null || grid[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
|
430 | <awangdev>Subarray Sum Closest_1.java | public int compare(int[] a, int[] b) {
return Integer.compare(a[0], b[0]);
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
return Integer . compare ( var_0 [ 0 ] , var_1 [ 0 ] ) ;
}
|
431 | <awangdev>Distinct Subsequences_1.java | public int numDistinct(String s, String t) {
if (s == null || t == null || t.length() > s.length()) {
return 0;
} else if (s.equals(t)) {
return 1;
}
int m = s.length();
int n = t.length();
int[][] dp = new int[m + 1][n + 1];
for (... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null || var_2 . length ( ) > var_1 . length ( ) ) {
return 0 ;
}
else if ( var_1 . equals ( var_2 ) ) {
return 1 ;
}
int var_8 = var_1 . length ( ) ;
int var_9 = var_2 . length ( ) ;
int [ ] [ ] var_10 = ne... |
432 | <awangdev>140. Word Break II_1.java | private String output(List<String> list) {
StringBuffer sb = new StringBuffer();
for (String s : list) sb.append(s).append(" ");
return sb.toString().trim();
} | private String var_0 ( List < String > var_3 ) {
StringBuffer var_5 = new StringBuffer ( ) ;
for ( String var_6 : var_3 ) var_5 . append ( var_6 ) . append ( " " ) ;
return var_5 . toString ( ) . trim ( ) ;
}
|
433 | <awangdev>689. Maximum Sum of 3 Non-Overlapping Subarrays_1.java | private int[] calcLeft(int[] nums, int[] presum, int k) {
int n = nums.length;
int[] left = new int[n];
for (int i = k, total = presum[k] - presum[0]; i < n; i++) {
int sum = presum[i + 1] - presum[i + 1 - k];
if (sum > total) {
left[i] = i + 1 - k;
... | private int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
int var_4 = var_0 . length ;
int [ ] var_5 = new int [ var_4 ] ;
for ( int var_6 = var_2 , var_8 = var_1 [ var_2 ] - var_1 [ 0 ] ;
var_6 < var_4 ;
var_6 ++ ) {
int var_10 = var_1 [ var_6 + 1 ] - var_1 [ var_6 + 1 - var_2 ] ;
... |
434 | <awangdev>Counting Bits_2.java | public int[] countBits(int num) {
if (num < 0) {
return null;
}
int[] dp = new int[num + 1];
dp[0] = 0;
for (int i = 1; i <= num; i++) {
int prevNum = i >> 1;
dp[i] = dp[prevNum] + (i & 1);
}
return dp;
} | public int [ ] sample_funcname ( int var_0 ) {
if ( var_0 < 0 ) {
return null ;
}
int [ ] var_4 = new int [ var_0 + 1 ] ;
var_4 [ 0 ] = 0 ;
for ( int var_5 = 1 ;
var_5 <= var_0 ;
var_5 ++ ) {
int var_6 = var_5 >> 1 ;
var_4 [ var_5 ] = var_4 [ var_6 ] + ( var_5 & 1 ) ;
}
return var_4 ;
}
|
435 | <awangdev>301. Remove Invalid Parentheses_1.java | private void dfs(List<String> rst, String s, int i, int j, char open, char close) {
for (int count = 0; i < s.length(); i++) {
count += s.charAt(i) == open ? 1 : 0;
count -= s.charAt(i) == close ? 1 : 0;
if (count < 0) {
int init = j;
for (; j... | private void sample_funcname ( List < String > rst , String s , int i , int j , char open , char close ) {
for ( int count = 0 ;
i < s . length ( ) ;
i ++ ) {
count += s . charAt ( i ) == open ? 1 : 0 ;
count -= s . charAt ( i ) == close ? 1 : 0 ;
if ( count < 0 ) {
int init = j ;
for ( ;
... |
436 | <awangdev>43. Multiply Strings_4.java | private int toInt(String s, int x) {
return s.charAt(x) - '0';
} | private int sample_funcname ( String var_1 , int var_2 ) {
return var_1 . charAt ( var_2 ) - '0' ;
}
|
437 | <awangdev>Coins in a Line_1.java | public boolean firstWillWin(int n) {
if (n <= 0) {
return false;
}
boolean[] dp = new boolean[n + 1];
dp[0] = false;
dp[1] = true;
for (int i = 2; i <= n; i++) {
dp[i] = !dp[i - 2] || !dp[i - 1];
}
return dp[n];
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
boolean [ ] var_5 = new boolean [ var_1 + 1 ] ;
var_5 [ 0 ] = false ;
var_5 [ 1 ] = true ;
for ( int var_7 = 2 ;
var_7 <= var_1 ;
var_7 ++ ) {
var_5 [ var_7 ] = ! var_5 [ var_7 - 2 ] || ! var_5 [ var_7 - 1 ] ;
}
return... |
438 | <awangdev>785. Is Graph Bipartite_2.java | public boolean isBipartite(int[][] graph) {
int n = graph.length;
Boolean[] states = new Boolean[n];
for (int i = 0; i < n; i++) {
if (states[i] != null) continue;
Queue<Integer> queue = new LinkedList<Integer>();
queue.offer(i);
states[i] = tr... | public boolean var_0 ( int [ ] [ ] var_1 ) {
int var_3 = var_1 . length ;
Boolean [ ] var_5 = new Boolean [ var_3 ] ;
for ( int var_7 = 0 ;
var_7 < var_3 ;
var_7 ++ ) {
if ( var_5 [ var_7 ] != null ) continue ;
Queue < Integer > var_12 = new LinkedList < Integer > ( ) ;
var_12 . offer ( var_7 ) ;
... |
439 | <awangdev>Trapping Rain Water II_3.java | public int trapRainWater(int[][] heightMap) {
if (heightMap == null || heightMap.length == 0 || heightMap[0] == null || heightMap[0].length == 0) {
return 0;
}
int m = heightMap.length;
int n = heightMap[0].length;
int[][] maxLeft = new int[m][n];
int[][] maxR... | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int var_5 = var_0 [ 0 ] . length ;
int [ ] [ ] var_6 = new int [ var_4 ] [ var_5 ] ;
int [ ] [ ] var_7 = new int ... |
440 | <awangdev>Permutation Index_1.java | public long permutationIndex(int[] A) {
if (A == null || A.length == 0) {
return 0;
}
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
int n = A.length;
long rst = 0;
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = i + 1; j < n; j++) {
... | public long sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
HashMap < Integer , Integer > var_6 = new HashMap < Integer , Integer > ( ) ;
int var_7 = var_0 . length ;
long var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_7 ;
var_9 ++ ) {
int var_10 = 0... |
441 | <awangdev>1108. Defanging an IP Address_1.java | public String defangIPaddr(String address) {
StringBuffer sb = new StringBuffer();
for (char c : address.toCharArray()) {
if (c == '.') {
sb.append("[.]");
} else {
sb.append(c);
}
}
return sb.toString();
} | public String var_0 ( String var_2 ) {
StringBuffer var_4 = new StringBuffer ( ) ;
for ( char var_6 : var_2 . toCharArray ( ) ) {
if ( var_6 == '.' ) {
var_4 . append ( "[.]" ) ;
}
else {
var_4 . append ( var_6 ) ;
}
}
return var_4 . toString ( ) ;
}
|
442 | <awangdev>Trapping Rain Water II_2.java | private boolean isInvalid(int[][] heightMap) {
return heightMap == null || heightMap.length == 0 || heightMap[0] == null || heightMap[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
|
443 | <awangdev>63. Unique Paths II_1.java | public int uniquePathsWithObstacles(int[][] obstacleGrid) {
if (obstacleGrid == null || obstacleGrid.length == 0) return 0;
int m = obstacleGrid.length, n = obstacleGrid[0].length;
int[][] dp = new int[m][n];
for (int i = 0, j = 0; j < n; j++) {
if (obstacleGrid[i][j... | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length , var_5 = var_0 [ 0 ] . length ;
int [ ] [ ] var_6 = new int [ var_4 ] [ var_5 ] ;
for ( int var_7 = 0 , var_8 = 0 ;
var_8 < var_5 ;
var_8 ++ ) {
if ( var_0 [ var_7 ] [ va... |
444 | <awangdev>322. Coin Change_1.java | public int coinChange(int[] coins, int amount) {
int[] dp = new int[amount + 1];
dp[0] = 0;
for (int i = 1; i <= amount; i++) {
dp[i] = Integer.MAX_VALUE;
for (int coin : coins) {
if (coin > i || dp[i - coin] == Integer.MAX_VALUE) continue;
... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
int [ ] var_3 = new int [ var_1 + 1 ] ;
var_3 [ 0 ] = 0 ;
for ( int var_5 = 1 ;
var_5 <= var_1 ;
var_5 ++ ) {
var_3 [ var_5 ] = Integer . MAX_VALUE ;
for ( int var_8 : var_0 ) {
if ( var_8 > var_5 || var_3 [ var_5 - var_8 ] == Integer . ... |
445 | <awangdev>Word Ladder II_2.java | public ArrayList<String> expand(String str, Set<String> dict) {
ArrayList<String> list = new ArrayList<String>();
for (int i = 0; i < str.length(); i++) {
for (int j = 0; j < 26; j++) {
if (str.charAt(i) != (char)('a' + j)) {
String newStr = str.substring(... | public ArrayList < String > var_1 ( String var_2 , Set < String > var_4 ) {
ArrayList < String > var_6 = new ArrayList < String > ( ) ;
for ( int var_8 = 0 ;
var_8 < var_2 . length ( ) ;
var_8 ++ ) {
for ( int var_10 = 0 ;
var_10 < 26 ;
var_10 ++ ) {
if ( var_2 . charAt ( var_8 ) != ( char ) (... |
446 | <awangdev>245. Shortest Word Distance III_2.java | public int shortestWordDistance(String[] words, String word1, String word2) {
Map<String, List<Integer>> map = new HashMap<>();
for (int i = 0; i < words.length; i++) {
map.putIfAbsent(words[i], new ArrayList<>());
map.get(words[i]).add(i);
}
List<Integer... | public int sample_funcname ( String [ ] var_1 , String var_2 , String var_3 ) {
Map < String , List < Integer >> var_8 = new HashMap < > ( ) ;
for ( int var_10 = 0 ;
var_10 < var_1 . length ;
var_10 ++ ) {
var_8 . putIfAbsent ( var_1 [ var_10 ] , new ArrayList < > ( ) ) ;
var_8 . get ( var_1 [ var_10 ] ... |
447 | <awangdev>43. Multiply Strings_5.java | public String multiply(String num1, String num2) {
if (num1 == null || num2 == null) {
return "";
} else if (num1.length() == 0 || num2.length() == 0) {
return num1.length() == 0 ? num2 : num1;
} else if (num1.equals("0") || num2.equals("0")) {
return "0";
... | public String var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null ) {
return "" ;
}
else if ( var_2 . length ( ) == 0 || var_3 . length ( ) == 0 ) {
return var_2 . length ( ) == 0 ? var_3 : var_2 ;
}
else if ( var_2 . equals ( "0" ) || var_3 . equals ( "0" ) ) {
return "0" ... |
448 | <awangdev>373. Find K Pairs with Smallest Sums_2.java | private PriorityQueue<List<Integer>> initQueue(int k) {
return new PriorityQueue<>(k, new Comparator<List<Integer>>() {
public int compare(List<Integer> a, List<Integer> b) {
return b.get(0) + b.get(1) - a.get(0) - a.get(1);
}
});
} | private PriorityQueue < List < Integer >> var_2 ( int var_3 ) {
return new PriorityQueue < > ( var_3 , new Comparator < List < Integer >> ( ) {
public int compare ( List < Integer > var_7 , List < Integer > var_8 ) {
return var_8 . get ( 0 ) + var_8 . get ( 1 ) - var_7 . get ( 0 ) - var_7 . get ( 1 ) ;
... |
449 | <awangdev>34. Find First and Last Position of Element in Sorted Array_2.java | private int binarySearch(int[] nums, int target, boolean isLeft) {
int n = nums.length, start = 0, end = n - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2, val = nums[mid];
if (val == target) {
if (isLeft && mid - 1 >= 0 && nums[mid - 1] == tar... | private int sample_funcname ( int [ ] var_0 , int var_1 , boolean var_3 ) {
int var_5 = var_0 . length , var_7 = 0 , var_9 = var_5 - 1 ;
while ( var_7 + 1 < var_9 ) {
int var_11 = var_7 + ( var_9 - var_7 ) / 2 , var_12 = var_0 [ var_11 ] ;
if ( var_12 == var_1 ) {
if ( var_3 && var_11 - 1 >= 0 && var_... |
450 | <awangdev>49. Group Anagrams_1.java | private String getKey(String s) {
int[] count = new int[26];
for (char c : s.toCharArray()) count[c - 'a']++;
StringBuilder sb = new StringBuilder();
for (int i = 0; i < 26; i++) sb.append(count[i]);
return sb.toString();
} | private String var_0 ( String var_2 ) {
int [ ] var_4 = new int [ 26 ] ;
for ( char var_6 : var_2 . toCharArray ( ) ) var_4 [ var_6 - 'a' ] ++ ;
StringBuilder var_9 = new StringBuilder ( ) ;
for ( int var_11 = 0 ;
var_11 < 26 ;
var_11 ++ ) var_9 . append ( var_4 [ var_11 ] ) ;
return var_9 . toString ( ) ... |
451 | <awangdev>516. Longest Palindromic Subsequence_2.java | public int longestPalindromeSubseq(String s) {
char[] ss = s.toCharArray();
int n = s.length();
int[][] dp = new int[n][n];
for (int i = 0; i < n; i++) dp[i][i] = 1;
for (int i = 0; i < n - 1; i++) dp[i][i + 1] = ss[i] == ss[i + 1] ? 2 : 1;
for ... | public int sample_funcname ( String var_1 ) {
char [ ] var_3 = var_1 . toCharArray ( ) ;
int var_5 = var_1 . length ( ) ;
int [ ] [ ] var_6 = new int [ var_5 ] [ var_5 ] ;
for ( int var_8 = 0 ;
var_8 < var_5 ;
var_8 ++ ) var_6 [ var_8 ] [ var_8 ] = 1 ;
for ( int var_8 = 0 ;
var_8 < var_5 - 1 ;
var_8 +... |
452 | <awangdev>239. Sliding Window Maximum_2.java | private void outQueue(Deque<Integer> deque, int num) {
if (deque.peekFirst() == num) deque.pollFirst();
} | private void var_0 ( Deque < Integer > var_3 , int var_4 ) {
if ( var_3 . peekFirst ( ) == var_4 ) var_3 . pollFirst ( ) ;
}
|
453 | <awangdev>414. Third Maximum Number_1.java | public int thirdMax(int[] nums) {
PriorityQueue<Integer> pq = new PriorityQueue<>();
for (int num : nums) {
if (!pq.contains(num)) {
pq.offer(num);
if (pq.size() > 3) pq.poll();
}
}
if (pq.size() < 3) {
while (pq.size() ... | public int sample_funcname ( int [ ] var_0 ) {
PriorityQueue < Integer > var_3 = new PriorityQueue < > ( ) ;
for ( int var_4 : var_0 ) {
if ( ! var_3 . contains ( var_4 ) ) {
var_3 . offer ( var_4 ) ;
if ( var_3 . size ( ) > 3 ) var_3 . poll ( ) ;
}
}
if ( var_3 . size ( ) < 3 ) {
while ... |
454 | <awangdev>Total Occurrence of Target_1.java | public int totalOccurrence(int[] A, int target) {
if (A == null || A.length == 0) {
return 0;
}
int start = 0;
int end = A.length - 1;
int mid = start + (end - start)/2;
int first = 0;
int last = 0;
while (start + 1 < end){
mid = start + (end - start)/2;
if (A[m... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_5 = 0 ;
int var_7 = var_0 . length - 1 ;
int var_9 = var_5 + ( var_7 - var_5 ) / 2 ;
int var_10 = 0 ;
int var_11 = 0 ;
while ( var_5 + 1 < var_7 ) {
var_9 = var_5 + ( var... |
455 | <awangdev>Binary Gap_1.java | public int binaryGap(int N) {
if (N <= 0) return 0;
int max = 0, start = -1, end = 0;
while (N > 0) {
if ((N & 1) == 1) {
if (start == -1) start = end;
else {
max = Math.max(max, end - start);
start = end;
... | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 0 ) return 0 ;
int max = 0 , var_4 = - 1 , var_5 = 0 ;
while ( var_0 > 0 ) {
if ( ( var_0 & 1 ) == 1 ) {
if ( var_4 == - 1 ) var_4 = var_5 ;
else {
max = Math . max ( max , var_5 - var_4 ) ;
var_4 = var_5 ;
}
}
... |
456 | <awangdev>Space Replacement_1.java | public int replaceBlank(char[] string, int length) {
if (string == null || string.length == 0) {
return 0;
}
int count = 0;
for (char c : string) {
if (c == ' ') {
count += 2;
}
}
int lastIndex = length + count - 1;
for (int i = length - 1; i >= 0; i--) {
... | public int sample_funcname ( char [ ] var_0 , int length ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = 0 ;
for ( char var_5 : var_0 ) {
if ( var_5 == ' ' ) {
var_4 += 2 ;
}
}
int var_9 = length + var_4 - 1 ;
for ( int var_10 = length - 1 ;
var_10 >= 0 ;
v... |
457 | <awangdev>274.H-Index_4.java | public int hIndex(int[] citations) {
if (citations == null || citations.length == 0) {
return 0;
}
int n = citations.length;
Arrays.sort(citations);
for (int i = 0; i < n; i++) {
int h = n - i;
if (citations[i] >= h) {
return h... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
Arrays . sort ( var_0 ) ;
for ( int var_7 = 0 ;
var_7 < var_4 ;
var_7 ++ ) {
int var_8 = var_4 - var_7 ;
if ( var_0 [ var_7 ] >= var_8 ) {
return var_8 ;... |
458 | <awangdev>8. String to Integer (atoi)_1.java | private boolean isDigit(char c) {
return c >= '0' && c <= '9';
} | private boolean var_0 ( char var_1 ) {
return var_1 >= '0' && var_1 <= '9' ;
}
|
459 | <awangdev>Best Time to Buy and Sell Stock III_1.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int profit = 0;
int n = prices.length;
int[][] dp = new int[n][5];
dp[0][0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j < 5; j++... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = 0 ;
int var_5 = var_0 . length ;
int [ ] [ ] var_7 = new int [ var_5 ] [ 5 ] ;
var_7 [ 0 ] [ 0 ] = 0 ;
for ( int var_9 = 1 ;
var_9 < var_5 ;
var_9 ++ ) {
for ( int var_10 = 1 ;... |
460 | <awangdev>Walls and Gates_4.java | private boolean validate(int[][] rooms) {
return rooms == null || rooms.length == 0 || rooms[0] == null || rooms[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
|
461 | <awangdev>57. Insert Interval_2.java | private int[][] convert(List<int[]> list) {
int[][] rst = new int[list.size()][2];
for (int i = 0; i < list.size(); i++) {
rst[i][0] = list.get(i)[0];
rst[i][1] = list.get(i)[1];
}
return rst;
} | private int [ ] [ ] sample_funcname ( List < int [ ] > var_1 ) {
int [ ] [ ] var_4 = new int [ var_1 . size ( ) ] [ 2 ] ;
for ( int var_6 = 0 ;
var_6 < var_1 . size ( ) ;
var_6 ++ ) {
var_4 [ var_6 ] [ 0 ] = var_1 . get ( var_6 ) [ 0 ] ;
var_4 [ var_6 ] [ 1 ] = var_1 . get ( var_6 ) [ 1 ] ;
}
return... |
462 | <awangdev>Palindrome Permutation II_1.java | public void permutateUnique(List<String> rst, String str, boolean[] visited, String s) {
if (str.length() == s.length()) {
rst.add(str);
return;
}
for (int i = 0; i < s.length(); i++) {
if (visited[i] || (i > 0 && !visited[i - 1] && s.charAt(i - 1) == s.charAt... | public void sample_funcname ( List < String > rst , String str , boolean [ ] visited , String s ) {
if ( str . length ( ) == s . length ( ) ) {
rst . add ( str ) ;
return ;
}
for ( int i = 0 ;
i < s . length ( ) ;
i ++ ) {
if ( visited [ i ] || ( i > 0 && ! visited [ i - 1 ] && s . charAt ( i - 1 ... |
463 | <awangdev>207. Course Schedule_1.java | private boolean validateInput(int numCourses, int[][] prerequisites) {
return numCourses == 0 || prerequisites == null || prerequisites.length == 0
|| prerequisites[0] == null || prerequisites[0].length == 0;
} | private boolean var_0 ( int var_1 , int [ ] [ ] var_2 ) {
return var_1 == 0 || var_2 == null || var_2 . length == 0 || var_2 [ 0 ] == null || var_2 [ 0 ] . length == 0 ;
}
|
464 | <awangdev>Reshape the Matrix_1.java | public int[][] matrixReshape(int[][] nums, int r, int c) {
int totalElements = nums.length * nums[0].length;
if (totalElements != r * c || totalElements % r != 0) {
return nums;
}
final int[][] result = new int[r][c];
int newR = 0;
int newC = 0;
for (i... | public int [ ] [ ] sample_funcname ( int [ ] [ ] var_0 , int var_1 , int var_2 ) {
int var_5 = var_0 . length * var_0 [ 0 ] . length ;
if ( var_5 != var_1 * var_2 || var_5 % var_1 != 0 ) {
return var_0 ;
}
final int [ ] [ ] var_6 = new int [ var_1 ] [ var_2 ] ;
int var_7 = 0 ;
int var_8 = 0 ;
for ( in... |
465 | <awangdev>159. Longest Substring with At Most Two Distinct Characters_2.java | public int lengthOfLongestSubstringTwoDistinct(String s) {
if (s == null || s.length() == 0) return 0;
int n = s.length();
Map<Character, Integer> lastOccurMap = new HashMap<>();
int left = 0, right = 0, max = 0;
while (right < n) {
if (lastOccurMap.size() <= 2) {
... | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) return 0 ;
int var_5 = var_1 . length ( ) ;
Map < Character , Integer > var_10 = new HashMap < > ( ) ;
int var_11 = 0 , var_12 = 0 , max = 0 ;
while ( var_12 < var_5 ) {
if ( var_10 . size ( ) <= 2 ) {
var_... |
466 | <awangdev>Permutation Sequence_1.java | public String getPermutation(int n, int k) {
if (n <= 0 || k <= 0) {
return "";
}
StringBuffer sb = new StringBuffer();
boolean[] visited = new boolean[n];
int factorio = 1;
for (int i = 1; i < n; i++) {
factorio *= i;
}
k = k - 1;
... | public String var_0 ( int var_1 , int var_2 ) {
if ( var_1 <= 0 || var_2 <= 0 ) {
return "" ;
}
StringBuffer var_6 = new StringBuffer ( ) ;
boolean [ ] var_8 = new boolean [ var_1 ] ;
int var_10 = 1 ;
for ( int var_11 = 1 ;
var_11 < var_1 ;
var_11 ++ ) {
var_10 *= var_11 ;
}
var_2 = var_2 - ... |
467 | <awangdev>Bricks Falling When Hit_2.java | private int flip(int[][] grid, Set<String> visited) {
int count = 0;
for (String s : visited) {
String[] ss = s.split("@");
int i = Integer.parseInt(ss[0]), j = Integer.parseInt(ss[1]);
if (grid[i][j] > 0) {
grid[i][j] = 0;
count++;
... | private int sample_funcname ( int [ ] [ ] var_0 , Set < String > var_3 ) {
int var_5 = 0 ;
for ( String var_6 : var_3 ) {
String [ ] var_9 = var_6 . split ( "@" ) ;
int var_12 = Integer . parseInt ( var_9 [ 0 ] ) , var_14 = Integer . parseInt ( var_9 [ 1 ] ) ;
if ( var_0 [ var_12 ] [ var_14 ] > 0 ) {
... |
468 | <awangdev>743. Network Delay Time_2.java | private Map<Integer, List<int[]>> buildGraph(int[][] times) {
Map<Integer, List<int[]>> graph = new HashMap<>();
for (int[] record : times) {
graph.putIfAbsent(record[0], new ArrayList<>());
graph.get(record[0]).add(record);
}
return graph;
} | private Map < Integer , List < int [ ] >> var_2 ( int [ ] [ ] var_3 ) {
Map < Integer , List < int [ ] >> var_6 = new HashMap < > ( ) ;
for ( int [ ] var_7 : var_3 ) {
var_6 . putIfAbsent ( var_7 [ 0 ] , new ArrayList < > ( ) ) ;
var_6 . get ( var_7 [ 0 ] ) . add ( var_7 ) ;
}
return var_6 ;
}
|
469 | <awangdev>Backpack III_5.java | public int backPackIII(int[] A, int[] V, int m) {
if (A == null || V == null || A.length != V.length) {
return 0;
}
int n = A.length;
int[][] dp = new int[n + 1][m + 1];
for (int j = 0; j <= m; j++) {
dp[0][j] = -1;
}
dp[0][0] = 0;
... | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
if ( var_0 == null || var_1 == null || var_0 . length != var_1 . length ) {
return 0 ;
}
int var_6 = var_0 . length ;
int [ ] [ ] var_8 = new int [ var_6 + 1 ] [ var_2 + 1 ] ;
for ( int var_9 = 0 ;
var_9 <= var_2 ;
var_9 ++ ) {... |
470 | <awangdev>Cracking the Safe_1.java | public String crackSafe(int n, int k) {
Set<String> set = new HashSet<>();
StringBuffer sb = new StringBuffer();
for (int i = 0; i < n; i++) sb.append("0");
set.add(sb.toString());
for (int i = 0; i < Math.pow(k, n); i++) {
String tail = sb.substring... | public String var_0 ( int var_1 , int var_2 ) {
Set < String > var_6 = new HashSet < > ( ) ;
StringBuffer var_8 = new StringBuffer ( ) ;
for ( int var_10 = 0 ;
var_10 < var_1 ;
var_10 ++ ) var_8 . append ( "0" ) ;
var_6 . add ( var_8 . toString ( ) ) ;
for ( int var_10 = 0 ;
var_10 < Math . pow ( var_2 ... |
471 | <awangdev>Scramble String_2.java | public boolean isScramble(String s1, String s2) {
if (s1 == null || s2 == null || s1.length() != s2.length()) {
return false;
}
int n = s1.length();
boolean[][][] dp = new boolean[n][n][n + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; ... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null || var_2 . length ( ) != var_3 . length ( ) ) {
return false ;
}
int var_6 = var_2 . length ( ) ;
boolean [ ] [ ] [ ] var_9 = new boolean [ var_6 ] [ var_6 ] [ var_6 + 1 ] ;
for ( int var_11 = 0 ;
var_11 < var_6 ;... |
472 | <awangdev>76. Minimum Window Substring_2.java | public String minWindow(String s, String t) {
int end = 0, start = 0, head = 0, counter = t.length();
int minLength = Integer.MAX_VALUE, n = s.length();
String rst = "";
int[] map = new int[256];
for (char c : t.toCharArray()) map[c]++;
while (end < n) {
if... | public String var_0 ( String var_2 , String var_3 ) {
int var_5 = 0 , var_6 = 0 , var_7 = 0 , var_9 = var_3 . length ( ) ;
int var_12 = Integer . MAX_VALUE , var_13 = var_2 . length ( ) ;
String var_15 = "" ;
int [ ] var_17 = new int [ 256 ] ;
for ( char var_19 : var_3 . toCharArray ( ) ) var_17 [ var_19 ] ++... |
473 | <awangdev>Kth Largest Element in an Array_3.java | public void swap( ArrayList<Integer>nums, int x, int y){
int temp = nums.get(x);
nums.set(x, nums.get(y));
nums.set(y, temp);
} | public void var_0 ( ArrayList < Integer > var_3 , int var_4 , int var_5 ) {
int var_7 = var_3 . get ( var_4 ) ;
var_3 . set ( var_4 , var_3 . get ( var_5 ) ) ;
var_3 . set ( var_5 , var_7 ) ;
}
|
474 | <awangdev>Sort Colors II_1.java | private void swap(int[] nums, int x, int y){
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
475 | <awangdev>151. Reverse Words in a String_2.java | private void reverse(String[] strs) {
int i = 0, j = strs.length - 1;
while (i < j) {
String temp = strs[i];
strs[i++] = strs[j];
strs[j--] = temp;
}
} | private void var_0 ( String [ ] var_2 ) {
int var_4 = 0 , var_7 = var_2 . length - 1 ;
while ( var_4 < var_7 ) {
String var_8 = var_2 [ var_4 ] ;
var_2 [ var_4 ++ ] = var_2 [ var_7 ] ;
var_2 [ var_7 -- ] = var_8 ;
}
}
|
476 | <awangdev>210. Course Schedule II_1.java | public int[] findOrder(int numCourses, int[][] prerequisites) {
if (numCourses == 0 || prerequisites == null) {
return new int[numCourses];
}
List[] inDegreeEdges = new ArrayList[numCourses];
int[] dependencyCount = new int[numCourses];
for (int i = 0; i < n... | public int [ ] sample_funcname ( int var_0 , int [ ] [ ] var_1 ) {
if ( var_0 == 0 || var_1 == null ) {
return new int [ var_0 ] ;
}
List [ ] var_6 = new ArrayList [ var_0 ] ;
int [ ] var_7 = new int [ var_0 ] ;
for ( int var_8 = 0 ;
var_8 < var_0 ;
var_8 ++ ) var_6 [ var_8 ] = new ArrayList < > ( ) ;... |
477 | <awangdev>611. Valid Triangle Number_2.java | public int triangleNumber(int[] nums) {
Arrays.sort(nums);
int n = nums.length, count = 0;
for (int i = 0; i <= n - 3; i++) {
if (nums[i] == 0) continue;
int k = i + 2;
for (int j = i + 1; j <= n - 2; j++) {
while (k < n && nums[i]... | public int sample_funcname ( int [ ] var_0 ) {
Arrays . sort ( var_0 ) ;
int var_4 = var_0 . length , var_6 = 0 ;
for ( int var_7 = 0 ;
var_7 <= var_4 - 3 ;
var_7 ++ ) {
if ( var_0 [ var_7 ] == 0 ) continue ;
int var_10 = var_7 + 2 ;
for ( int var_12 = var_7 + 1 ;
var_12 <= var_4 - 2 ;
var... |
478 | <awangdev>217. Contains Duplicate_2.java | public boolean containsDuplicate(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
Arrays.sort(nums);
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] == nums[i + 1]) {
return true;
}
}
return ... | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
Arrays . sort ( var_1 ) ;
for ( int var_7 = 0 ;
var_7 < var_1 . length - 1 ;
var_7 ++ ) {
if ( var_1 [ var_7 ] == var_1 [ var_7 + 1 ] ) {
return true ;
}
}
return false ;
}
|
479 | <awangdev>246. Strobogrammatic Number_2.java | public boolean isStrobogrammatic(String num) {
if (num == null || num.length() == 0) return true;
if (num.length() == 1) return num.equals("0") || num.equals("1") || num.equals("8");
List<Character> candidate = new ArrayList<>(Arrays.asList('0', '1', '8', '6', '9'));
char[] charArray = n... | public boolean var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . length ( ) == 0 ) return true ;
if ( var_2 . length ( ) == 1 ) return var_2 . equals ( "0" ) || var_2 . equals ( "1" ) || var_2 . equals ( "8" ) ;
List < Character > var_21 = new ArrayList < > ( Arrays . asList ( '0' , '1' , '8' , '6' , '9' ) )... |
480 | <awangdev>Container With Most Water_1.java | public int maxArea(int[] heights) {
if (heights == null || heights.length == 0) {
return 0;
}
int left = 0;
int right = heights.length - 1;
int maxWater = Integer.MIN_VALUE;
while (left < right) {
int lowWall = heights[left] < heights[right] ? heights[left] : heights[right];... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = 0 ;
int var_6 = var_0 . length - 1 ;
int var_9 = Integer . MIN_VALUE ;
while ( var_4 < var_6 ) {
int var_10 = var_0 [ var_4 ] < var_0 [ var_6 ] ? var_0 [ var_4 ] : var_0 [ var_6 ] ;
... |
481 | <awangdev>Max Area of Island_1.java | private boolean validate(int[][] grid, int x, int y) {
return x >= 0 && x < grid.length && y >= 0 && y < grid[0].length && grid[x][y] == 1;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 >= 0 && var_2 < var_1 . length && var_3 >= 0 && var_3 < var_1 [ 0 ] . length && var_1 [ var_2 ] [ var_3 ] == 1 ;
}
|
482 | <awangdev>Sliding Puzzle_2.java | private boolean evaluate(int[] nums) {
for (int i = 0; i < nums.length; i++) {
if (i + 1 != nums[i]) {
if (i == 5 && nums[i] == 0) continue;
return false;
}
}
return true;
} | private boolean var_0 ( int [ ] var_1 ) {
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
if ( var_3 + 1 != var_1 [ var_3 ] ) {
if ( var_3 == 5 && var_1 [ var_3 ] == 0 ) continue ;
return false ;
}
}
return true ;
}
|
483 | <awangdev>58. Length of Last Word_2.java | public int lengthOfLastWord(String s) {
if (s == null || s.length() == 0) {
return 0;
}
String[] arr = s.split("\\ ");
String lastWord = arr[arr.length - 1];
return lastWord.length();
} | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
String [ ] var_7 = var_1 . split ( "\\ " ) ;
String var_9 = var_7 [ var_7 . length - 1 ] ;
return var_9 . length ( ) ;
}
|
484 | <awangdev>686. Repeated String Match_1.java | private boolean validate(String A, String B) {
boolean[] checkA = new boolean[256];
boolean[] checkB = new boolean[256];
for (char c : A.toCharArray()) {
checkA[c] = true;
}
for (char c : B.toCharArray()) {
checkB[c] = true;
}
for... | private boolean var_0 ( String var_2 , String var_3 ) {
boolean [ ] var_6 = new boolean [ 256 ] ;
boolean [ ] var_7 = new boolean [ 256 ] ;
for ( char var_9 : var_2 . toCharArray ( ) ) {
var_6 [ var_9 ] = true ;
}
for ( char var_9 : var_3 . toCharArray ( ) ) {
var_7 [ var_9 ] = true ;
}
for ( int ... |
485 | <awangdev>Perfect Squares_4.java | public int numSquares(int n) {
if (n <= 0) {
return 0;
}
int[] dp = new int[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
int maxSqrNum = (int)Math.floor(Math.sqrt(i));
int min = Integer.MAX_VALUE;
for (int j = 1; j <= maxSqrNum; j++) {
... | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 0 ) {
return 0 ;
}
int [ ] var_3 = new int [ var_0 + 1 ] ;
var_3 [ 0 ] = 0 ;
for ( int var_4 = 1 ;
var_4 <= var_0 ;
var_4 ++ ) {
int var_8 = ( int ) Math . floor ( Math . sqrt ( var_4 ) ) ;
int min = Integer . MAX_VALUE ;
for ( int v... |
486 | <awangdev>408. Valid Word Abbreviation_1.java | private boolean isInt(char c) {
return c >= '0' && c <= '9';
} | private boolean var_0 ( char var_1 ) {
return var_1 >= '0' && var_1 <= '9' ;
}
|
487 | <awangdev>Word Search II_2.java | public boolean search(char[][] board, String word, int i, int j, int start) {
if (start == word.length()) {
return true;
}
if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != word.charAt(start)) {
return false;
}
board[i][j] = '#';
boolea... | public boolean sample_funcname ( char [ ] [ ] board , String word , int i , int j , int start ) {
if ( start == word . length ( ) ) {
return true ;
}
if ( i < 0 || i >= board . length || j < 0 || j >= board [ 0 ] . length || board [ i ] [ j ] != word . charAt ( start ) ) {
return false ;
}
board [ i ]... |
488 | <awangdev>Backpack_3.java | public int backPack(int m, int[] A) {
if (A == null || A.length < 0) {
return 0;
}
int n = A.length;
boolean[][] dp = new boolean[n + 1][m + 1];
dp[0][0] = true;
for (int j = 1; j <= m; j++) {
dp[0][j] = false;
}
for (int i = 1; i <= n; i++) {
... | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length < 0 ) {
return 0 ;
}
int var_5 = var_1 . length ;
boolean [ ] [ ] var_8 = new boolean [ var_5 + 1 ] [ var_0 + 1 ] ;
var_8 [ 0 ] [ 0 ] = true ;
for ( int var_9 = 1 ;
var_9 <= var_0 ;
var_9 ++ ) {
var_8... |
489 | <awangdev>1041. Robot Bounded In Circle_1.java | public boolean judgeCircle(String moves) {
if (moves == null || moves.length() % 2 == 1) {
return false;
}
int trackX = 0;
int trackY = 0;
for (int i = 0; i < moves.length(); i++) {
if (moves.charAt(i) == 'U' || moves.charAt(i) == 'D') {
tr... | public boolean var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . length ( ) % 2 == 1 ) {
return false ;
}
int var_8 = 0 ;
int var_9 = 0 ;
for ( int var_10 = 0 ;
var_10 < var_2 . length ( ) ;
var_10 ++ ) {
if ( var_2 . charAt ( var_10 ) == 'U' || var_2 . charAt ( var_10 ) == 'D' ) {
var_... |
490 | <awangdev>Largest Rectangle in Histogram_1.java | public int largestRectangleArea(int[] heights) {
if (heights == null || heights.length == 0) {
return 0;
}
int n = heights.length;
int max = 0;
Stack<Integer> stack = new Stack<>();
for (int i = 0; i <= n; i++) {
int currHeight = i == n ? -1 : hei... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int max = 0 ;
Stack < Integer > var_8 = new Stack < > ( ) ;
for ( int var_9 = 0 ;
var_9 <= var_4 ;
var_9 ++ ) {
int var_11 = var_9 == var_4 ? - 1 : var_0 [ var_9... |
491 | <awangdev>399. Evaluate Division_1.java | private String getKey(String a, String b) {
return String.format("%s->%s", a, b);
} | private String var_0 ( String var_2 , String var_3 ) {
return String . format ( "%s->%s" , var_2 , var_3 ) ;
}
|
492 | <awangdev>64. Minimum Path Sum_3.java | public int minPathSum(int[][] grid) {
if (grid == null || grid.length == 0 || grid[0] == null || grid[0].length == 0) return 0;
int m = grid.length, n = grid[0].length;
int[][] dp = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
dp... | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) return 0 ;
int var_4 = var_0 . length , var_5 = var_0 [ 0 ] . length ;
int [ ] [ ] var_6 = new int [ var_4 ] [ var_5 ] ;
for ( int var_7 = 0 ;
var_7 < var_4 ;
va... |
493 | <awangdev>311. Sparse Matrix Multiplication_1.java | private boolean validate(int[][] A, int[][] B) {
if (A == null || B == null) return true;
if (A[0].length != B.length) return true;
return false;
} | private boolean var_0 ( int [ ] [ ] var_1 , int [ ] [ ] var_2 ) {
if ( var_1 == null || var_2 == null ) return true ;
if ( var_1 [ 0 ] . length != var_2 . length ) return true ;
return false ;
}
|
494 | <awangdev>327. Count of Range Sum_1.java | private int mergeSort(long[] preSum, int lower, int upper, int start, int end) {
if (start + 1 >= end) return 0;
int mid = (start + end) / 2, count = 0;
count += mergeSort(preSum, lower, upper, start, mid);
count += mergeSort(preSum, lower, upper, mid, end);
in... | private int sample_funcname ( long [ ] preSum , int lower , int upper , int start , int end ) {
if ( start + 1 >= end ) return 0 ;
int mid = ( start + end ) / 2 , count = 0 ;
count += mergeSort ( preSum , lower , upper , start , mid ) ;
count += mergeSort ( preSum , lower , upper , mid , end ) ;
int lo = mid ... |
495 | <awangdev>Find Peak Element_4.java | public int findPeak(int[] A) {
int start = 1;
int end = A.length - 2;
int mid;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (A[mid] > A[mid - 1] && A[mid] > A[mid + 1]) {
return mid;
} else if (A[mid] > A[start... | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = 1 ;
int var_5 = var_0 . length - 2 ;
int var_6 ;
while ( var_2 + 1 < var_5 ) {
var_6 = var_2 + ( var_5 - var_2 ) / 2 ;
if ( var_0 [ var_6 ] > var_0 [ var_6 - 1 ] && var_0 [ var_6 ] > var_0 [ var_6 + 1 ] ) {
return var_6 ;
}
else if... |
496 | <awangdev>567. Permutation in String_1.java | private Integer[] countFreq(String s) {
Integer[] freq = new Integer[256];
for (char c : s.toCharArray()) freq[c] = freq[c] == null ? 1 : freq[c] + 1;
return freq;
} | private Integer [ ] var_0 ( String var_2 ) {
Integer [ ] var_5 = new Integer [ 256 ] ;
for ( char var_7 : var_2 . toCharArray ( ) ) var_5 [ var_7 ] = var_5 [ var_7 ] == null ? 1 : var_5 [ var_7 ] + 1 ;
return var_5 ;
}
|
497 | <awangdev>Expression Evaluation_1.java | public int getWeight(int base, String s) {
if (s.equals("+") || s.equals("-")) {
return base + 1;
}
if (s.equals("*") || s.equals("/")) {
return base + 2;
}
return Integer.MAX_VALUE;
} | public int sample_funcname ( int var_0 , String var_2 ) {
if ( var_2 . equals ( "+" ) || var_2 . equals ( "-" ) ) {
return var_0 + 1 ;
}
if ( var_2 . equals ( "*" ) || var_2 . equals ( "/" ) ) {
return var_0 + 2 ;
}
return Integer . MAX_VALUE ;
}
|
498 | <awangdev>10. Regular Expression Matching_1.java | public boolean isMatch(String s, String p) {
if (s == null || p == null) return false;
int m = s.length(), n = p.length();
boolean[][] dp = new boolean[m + 1][n + 1];
char[] ss = s.toCharArray();
char[] pp = p.toCharArray();
for (int i = 0; i <= m; i++) {
... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null ) return false ;
int var_6 = var_2 . length ( ) , var_7 = var_3 . length ( ) ;
boolean [ ] [ ] var_10 = new boolean [ var_6 + 1 ] [ var_7 + 1 ] ;
char [ ] var_12 = var_2 . toCharArray ( ) ;
char [ ] var_13 = var_3 . toC... |
499 | <awangdev>91. Decode Ways_3.java | private boolean check(String s, int i) {
if (i + 1 >= s.length()) return false;
int twoDigit = (s.charAt(i) - '0') * 10 + (s.charAt(i + 1) - '0');
return twoDigit <= 26 && twoDigit >= 10;
} | private boolean var_0 ( String var_2 , int var_3 ) {
if ( var_3 + 1 >= var_2 . length ( ) ) return false ;
int var_9 = ( var_2 . charAt ( var_3 ) - '0' ) * 10 + ( var_2 . charAt ( var_3 + 1 ) - '0' ) ;
return var_9 <= 26 && var_9 >= 10 ;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.