id int64 0 1.17k | comefrom stringlengths 21 84 | code stringlengths 50 1.89k | masked stringlengths 63 2.47k |
|---|---|---|---|
300 | <awangdev>[lint]. Anagrams_1.java | public List<String> anagrams(String[] strs) {
List<String> rst = new ArrayList<>();
if (strs == null || strs == null) return rst;
Map<String, List<String>> map = new HashMap<>();
for (String word : strs){
int[] arr = new int[26];
for (char c : word.toCharArray()) arr[c ... | public List < String > var_1 ( String [ ] var_2 ) {
List < String > var_5 = new ArrayList < > ( ) ;
if ( var_2 == null || var_2 == null ) return var_5 ;
Map < String , List < String >> var_9 = new HashMap < > ( ) ;
for ( String var_10 : var_2 ) {
int [ ] var_12 = new int [ 26 ] ;
for ( char var_14 : var... |
301 | <awangdev>Find Minimum in Rotated Sorted Array_1.java | public int findMin(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int start = 0;
int end = n - 1;
while (start + 1 < end) {
int mid = (start + end) >> 1;
if (mid - 1 >= 0 && mid + 1 < n && nums[mi... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int var_5 = 0 ;
int var_7 = var_4 - 1 ;
while ( var_5 + 1 < var_7 ) {
int var_8 = ( var_5 + var_7 ) >> 1 ;
if ( var_8 - 1 >= 0 && var_8 + 1 < var_4 && var_0 [ va... |
302 | <awangdev>Orderly Queue_1.java | public String orderlyQueue(String S, int K) {
if (K > 1) {
char[] arr = S.toCharArray();
Arrays.sort(arr);
return new String(arr);
}
String res = S;
for (int i = 1; i < S.length(); i++) {
String tmp = S.substring(i) + S.substring(0, i);
... | public String var_0 ( String var_2 , int var_3 ) {
if ( var_3 > 1 ) {
char [ ] var_6 = var_2 . toCharArray ( ) ;
Arrays . sort ( var_6 ) ;
return new String ( var_6 ) ;
}
String var_9 = var_2 ;
for ( int var_10 = 1 ;
var_10 < var_2 . length ( ) ;
var_10 ++ ) {
String var_14 = var_2 . substri... |
303 | <awangdev>274.H-Index_2.java | public int hIndex(int[] citations) {
if (citations == null || citations.length == 0) {
return 0;
}
int n = citations.length;
Arrays.sort(citations);
int i = 0;
while (i < n && citations[i] < n - i) {
i++;
}
return n - i;
} | 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 ) ;
int var_7 = 0 ;
while ( var_7 < var_4 && var_0 [ var_7 ] < var_4 - var_7 ) {
var_7 ++ ;
}
return var_4 - var_7 ;
}
|
304 | <awangdev>Walls and Gates_2.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 ;
}
|
305 | <awangdev>Word Ladder_3.java | public int compare(String s1, String s2) {
int count = 0;
for (int i = 0; i < s1.length(); i++) {
count += s1.charAt(i) != s2.charAt(i) ? 1 : 0;
if (count > 1) {
return count;
}
}
return count;
} | public int sample_funcname ( String var_1 , String var_2 ) {
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_1 . length ( ) ;
var_5 ++ ) {
var_4 += var_1 . charAt ( var_5 ) != var_2 . charAt ( var_5 ) ? 1 : 0 ;
if ( var_4 > 1 ) {
return var_4 ;
}
}
return var_4 ;
}
|
306 | <awangdev>Ugly Number II_1.java | public int nthUglyNumber(int n) {
if (n <= 1) return n;
int[] dp = new int[n];
dp[0] = 1;
int index2 = 0, index3 = 0, index5 = 0;
int factor2 = 2, factor3 = 3, factor5 = 5;
for (int i = 1; i < n; i++){
int min = Math.min(Math.min(factor2, factor3), factor5);
... | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) return var_0 ;
int [ ] var_2 = new int [ var_0 ] ;
var_2 [ 0 ] = 1 ;
int var_4 = 0 , var_5 = 0 , var_6 = 0 ;
int var_8 = 2 , var_10 = 3 , var_12 = 5 ;
for ( int var_13 = 1 ;
var_13 < var_0 ;
var_13 ++ ) {
int min = Math . min ( Math . min ... |
307 | <awangdev>Search for a Range_2.java | public ArrayList<Integer> searchRange(ArrayList<Integer> A, int target) {
int start = 0;
int end = A.size() - 1;
int mid;
ArrayList<Integer> bound = new ArrayList<Integer>();
bound.add(-1);
bound.add(-1);
if ( A.size() == 0) {
return bound;
... | public ArrayList < Integer > var_1 ( ArrayList < Integer > var_3 , int var_4 ) {
int var_6 = 0 ;
int var_9 = var_3 . size ( ) - 1 ;
int var_10 ;
ArrayList < Integer > var_11 = new ArrayList < Integer > ( ) ;
var_11 . add ( - 1 ) ;
var_11 . add ( - 1 ) ;
if ( var_3 . size ( ) == 0 ) {
return var_11 ;
... |
308 | <awangdev>Backpack III_3.java | public int backPackIII(int[] A, int[] V, int m) {
if (A == null || A.length == 0 || V == null || V.length == 0 || m <= 0) {
return 0;
}
int n = A.length;
int[] dp = new int[m + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = A... | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 == null || var_1 . length == 0 || var_2 <= 0 ) {
return 0 ;
}
int var_6 = var_0 . length ;
int [ ] var_8 = new int [ var_2 + 1 ] ;
var_8 [ 0 ] = 0 ;
for ( int var_9 = 1 ;
var_9... |
309 | <awangdev>448. Find All Numbers Disappeared in an Array_1.java | private void swap(int[] nums, int a, int b) {
int temp = nums[a];
nums[a] = nums[b];
nums[b] = 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 ;
}
|
310 | <awangdev>151. Reverse Words in a String_4.java | private void reverse(char[] arr, int i, int j) {
while (i < j) {
char temp = arr[i];
arr[i++] = arr[j];
arr[j--] = temp;
}
} | private void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
while ( var_2 < var_3 ) {
char var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ++ ] = var_1 [ var_3 ] ;
var_1 [ var_3 -- ] = var_4 ;
}
}
|
311 | <awangdev>Sum of Two Integers_1.java | public int getSum(int a, int b) {
int sum = a ^ b;
int nextCarry = (a & b) << 1;
while (nextCarry != 0) {
int currentCarry = sum & nextCarry;
sum = sum ^ nextCarry;
nextCarry = currentCarry << 1;
}
return sum;
} | public int sample_funcname ( int var_0 , int var_1 ) {
int var_2 = var_0 ^ var_1 ;
int var_4 = ( var_0 & var_1 ) << 1 ;
while ( var_4 != 0 ) {
int var_6 = var_2 & var_4 ;
var_2 = var_2 ^ var_4 ;
var_4 = var_6 << 1 ;
}
return var_2 ;
}
|
312 | <awangdev>204. Count Primes_1.java | public int countPrimes(int n) {
if (n <= 1) {
return 0;
}
boolean[] primes = new boolean[n];
for (int i = 2; i < primes.length; i++) {
primes[i] = true;
}
for (int i = 2; i * i < n; i++) {
if (!primes[i]) {
continue;
}
for (int j = i * i; j < n; j += i) {
... | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 0 ;
}
boolean [ ] var_4 = new boolean [ var_0 ] ;
for ( int var_6 = 2 ;
var_6 < var_4 . length ;
var_6 ++ ) {
var_4 [ var_6 ] = true ;
}
for ( int var_6 = 2 ;
var_6 * var_6 < var_0 ;
var_6 ++ ) {
if ( ! var_4 [ var_6 ]... |
313 | <awangdev>Decode String_3.java | public String expressionExpand(String s) {
if (s == null || s.length() == 0) {
return "";
}
StringBuffer sb = new StringBuffer();
String substring = "";
int number = 0;
int paren = 0;
for (int i = 0; i < s.length(); i++) {
char c ... | public String sample_funcname ( String s ) {
if ( s == null || s . length ( ) == 0 ) {
return "" ;
}
StringBuffer sb = new StringBuffer ( ) ;
String substring = "" ;
int number = 0 ;
int paren = 0 ;
for ( int i = 0 ;
i < s . length ( ) ;
i ++ ) {
char c = s . charAt ( i ) ;
if ( c == '[' )... |
314 | <awangdev>Expression Tree Build_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 ;
}
|
315 | <awangdev>844. Backspace String Compare_2.java | private String build(String s) {
Stack<Character> stack = new Stack<>();
for (char c : s.toCharArray()) {
if (c != '#') stack.push(c);
else if (!stack.isEmpty()) stack.pop();
}
StringBuffer sb = new StringBuffer();
while (!stack.isEmpty()) sb.insert(0, st... | private String var_0 ( String var_2 ) {
Stack < Character > var_5 = new Stack < > ( ) ;
for ( char var_7 : var_2 . toCharArray ( ) ) {
if ( var_7 != '#' ) var_5 . push ( var_7 ) ;
else if ( ! var_5 . isEmpty ( ) ) var_5 . pop ( ) ;
}
StringBuffer var_13 = new StringBuffer ( ) ;
while ( ! var_5 . isEmp... |
316 | <awangdev>Interleaving String_3.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;
}
boolean[][] DP = new boolean[s1.length() + 1][s2.length() + 1];
DP[0][0] = true;
for (int i = 1; i... | 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 ;
}
boolean [ ] [ ] var_9 = new boolean [ var_2 . length ( ) + 1 ] [ var_3 . length ( ) + 1 ] ;
var... |
317 | <awangdev>Combination Sum III_1.java | private void dfs(List<List<Integer>> result, List<Integer> list,
int index, int k, int n) {
for (int i = index; i <= 9; i++) {
list.add(i);
if (n == i && list.size() == k) {
result.add(new ArrayList<>(list));
} else if (n > i){
... | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int index , int k , int n ) {
for ( int i = index ;
i <= 9 ;
i ++ ) {
list . add ( i ) ;
if ( n == i && list . size ( ) == k ) {
result . add ( new ArrayList < > ( list ) ) ;
}
else if ( n > i ) {
... |
318 | <awangdev>65. Valid Number_1.java | public boolean isNumber(String s) {
if (s == null) return false;
s = s.trim();
if (s.length() == 0) return false;
int i = 0;
char[] ss = s.toCharArray();
if (ss[i] == '+' || ss[i] == '-') i++;
boolean isNum = false, isDot = false, isExp = false;
for (; i <... | public boolean var_0 ( String var_2 ) {
if ( var_2 == null ) return false ;
var_2 = var_2 . trim ( ) ;
if ( var_2 . length ( ) == 0 ) return false ;
int var_7 = 0 ;
char [ ] var_9 = var_2 . toCharArray ( ) ;
if ( var_9 [ var_7 ] == '+' || var_9 [ var_7 ] == '-' ) var_7 ++ ;
boolean var_20 = false , var_17... |
319 | <awangdev>1007. Minimum Domino Rotations For Equal Row_3.java | private int count(int[] A, Integer candidate) {
int count = 0;
for (int num : A) count += (candidate == num) ? 1 : 0;
return count;
} | private int sample_funcname ( int [ ] var_0 , Integer var_2 ) {
int var_4 = 0 ;
for ( int var_5 : var_0 ) var_4 += ( var_2 == var_5 ) ? 1 : 0 ;
return var_4 ;
}
|
320 | <awangdev>Perfect Squares_2.java | public int numSquares(int n) {
if (n <= 1) {
return 1;
}
int[] dp = new int[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = Integer.MAX_VALUE;
for (int j = 1; j <= i && j * j <= i; j++) {
dp[i] = Math.min(dp[i], dp[i ... | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
int [ ] var_2 = new int [ var_0 + 1 ] ;
var_2 [ 0 ] = 0 ;
for ( int var_4 = 1 ;
var_4 <= var_0 ;
var_4 ++ ) {
var_2 [ var_4 ] = Integer . MAX_VALUE ;
for ( int var_7 = 1 ;
var_7 <= var_4 && var_7 * var_7 <= var_4 ;... |
321 | <awangdev>52. N-Queens II_2.java | private boolean validateBoard(List<Integer> list, int newColNum) {
int newRowNum = list.size();
for (int rowNum = 0; rowNum < list.size(); rowNum++) {
int colNum = list.get(rowNum);
if (colNum == newColNum || Math.abs(newColNum - colNum) == Math.abs(newRowNum - rowNum)) {
... | private boolean var_0 ( List < Integer > var_3 , int var_4 ) {
int var_6 = var_3 . size ( ) ;
for ( int var_8 = 0 ;
var_8 < var_3 . size ( ) ;
var_8 ++ ) {
int var_10 = var_3 . get ( var_8 ) ;
if ( var_10 == var_4 || Math . abs ( var_4 - var_10 ) == Math . abs ( var_6 - var_8 ) ) {
return false ;
... |
322 | <awangdev>88. Merge Sorted Array_1.java | public void merge(int[] A, int m, int[] B, int n) {
int index = m + n - 1;
while (m > 0 && n > 0) {
if (A[m - 1] > B[n - 1]) {
A[index--] = A[--m];
} else {
A[index--] = B[--n];
}
}
while (n > 0) {
A... | public void var_0 ( int [ ] var_1 , int var_2 , int [ ] var_3 , int var_4 ) {
int var_6 = var_2 + var_4 - 1 ;
while ( var_2 > 0 && var_4 > 0 ) {
if ( var_1 [ var_2 - 1 ] > var_3 [ var_4 - 1 ] ) {
var_1 [ var_6 -- ] = var_1 [ -- var_2 ] ;
}
else {
var_1 [ var_6 -- ] = var_3 [ -- var_4 ] ;
... |
323 | <awangdev>Coins in a Line II_1.java | public boolean firstWillWin(int[] values) {
if (values == null || values.length == 0) {
return false;
}
if (values.length <= 2) {
return true;
}
int n = values.length;
int[] dp = new int[n + 1];
int[] sum = new int[n + 1];
dp[n] =... | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
if ( var_1 . length <= 2 ) {
return true ;
}
int var_6 = var_1 . length ;
int [ ] var_8 = new int [ var_6 + 1 ] ;
int [ ] var_9 = new int [ var_6 + 1 ] ;
var_8 [ var_6 ] = 0 ;
var_8 [ var_6 ... |
324 | <awangdev>[tool]. MergeSort_2.java | private void printArray(int[] nums, String str) {
System.out.print(str);
if (nums == null || nums.length == 0) {
System.out.println();
return;
}
for (int num : nums) {
System.out.print(num + ", ");
}
System.out.println();
} | private void var_0 ( int [ ] var_1 , String var_3 ) {
System . out . print ( var_3 ) ;
if ( var_1 == null || var_1 . length == 0 ) {
System . out . println ( ) ;
return ;
}
for ( int var_11 : var_1 ) {
System . out . print ( var_11 + ", " ) ;
}
System . out . println ( ) ;
}
|
325 | <awangdev>Backpack_5.java | public int backPack(int m, int[] A) {
if (A == null || A.length == 0 || m <= 0) {
return 0;
}
boolean[][] dp = new boolean[A.length + 1][m + 1];
dp[0][0] = true;
for (int i = 1; i <= A.length; i++) {
for (int j = 0; j <= m; j++) {
if (j - ... | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 || var_0 <= 0 ) {
return 0 ;
}
boolean [ ] [ ] var_7 = new boolean [ var_1 . length + 1 ] [ var_0 + 1 ] ;
var_7 [ 0 ] [ 0 ] = true ;
for ( int var_8 = 1 ;
var_8 <= var_1 . length ;
var_8 ++ ) {
for... |
326 | <awangdev>Number of Connected Components in an Undirected Graph_1.java | private Map<Integer, List<Integer>> buildGraph(int n, int[][] edges) {
Map<Integer, List<Integer>> graph = new HashMap<>();
for (int i = 0; i < n; i++) {
if (!graph.containsKey(i)) {
graph.put(i, new ArrayList<>());
}
}
for (int[] edge: edges) {
... | private Map < Integer , List < Integer >> var_2 ( int var_3 , int [ ] [ ] var_4 ) {
Map < Integer , List < Integer >> var_7 = new HashMap < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_3 ;
var_9 ++ ) {
if ( ! var_7 . containsKey ( var_9 ) ) {
var_7 . put ( var_9 , new ArrayList < > ( ) ) ;
}
}
fo... |
327 | <awangdev>1053. Previous Permutation With One Swap_1.java | private void swap(int[] arr, int x, int y) {
int temp = arr[x];
arr[x] = arr[y];
arr[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 ;
}
|
328 | <awangdev>Triangles_2.java | public int minimumTotal(List<List<Integer>> triangle) {
if (triangle == null || triangle.size() == 0) {
return 0;
}
int n = triangle.size();
int[][] dp = new int[2][n];
for (int j = 0; j < n; j++) {
dp[(n - 1) % 2][j] = triangle.get(n - 1).get(j);
... | public int sample_funcname ( List < List < Integer >> var_2 ) {
if ( var_2 == null || var_2 . size ( ) == 0 ) {
return 0 ;
}
int var_6 = var_2 . size ( ) ;
int [ ] [ ] var_8 = new int [ 2 ] [ var_6 ] ;
for ( int var_9 = 0 ;
var_9 < var_6 ;
var_9 ++ ) {
var_8 [ ( var_6 - 1 ) % 2 ] [ var_9 ] = var_2... |
329 | <awangdev>QuickSort_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 ;
}
|
330 | <awangdev>796. Rotate String_1.java | public boolean rotateString(String A, String B) {
if (A == null || B == null || A.length() != B.length()) {
return false;
}
if (A.equals(B)) {
return true;
}
StringBuffer sb = new StringBuffer(A);
for (char c : A.toCharArray()) {
sb.del... | 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 ;
}
if ( var_2 . equals ( var_3 ) ) {
return true ;
}
StringBuffer var_8 = new StringBuffer ( var_2 ) ;
for ( char var_10 : var_2 . toCharArray ( ) ... |
331 | <awangdev>367. Valid Perfect Square_1.java | public boolean isPerfectSquare(int num) {
long start = 0, end = num;
while (start <= end) {
long mid = start + (end - start) / 2;
long sqrt = mid * mid;
if (sqrt == num) return true;
else if (sqrt < num) start = mid + 1;
else end = mid - 1;
... | public boolean var_0 ( int var_1 ) {
long var_3 = 0 , var_4 = var_1 ;
while ( var_3 <= var_4 ) {
long var_6 = var_3 + ( var_4 - var_3 ) / 2 ;
long var_7 = var_6 * var_6 ;
if ( var_7 == var_1 ) return true ;
else if ( var_7 < var_1 ) var_3 = var_6 + 1 ;
else var_4 = var_6 - 1 ;
}
return false... |
332 | <awangdev>Longest Valid Parentheses_1.java | private int addPriorLength(int priorIndex, int[] dp) {
return (priorIndex - 1 >= 0) ? dp[priorIndex - 1] : 0;
} | private int sample_funcname ( int var_0 , int [ ] var_1 ) {
return ( var_0 - 1 >= 0 ) ? var_1 [ var_0 - 1 ] : 0 ;
}
|
333 | <awangdev>Count and Say_1.java | public String countAndSay(int n) {
if (n <= 1) {
return n + "";
}
String curr = "1";
for (int i = 2; i <= n; i++) {
int count = 1;
char c = curr.charAt(0);
int size = curr.length();
StringBuffer sb = new StringBuffer();
... | public String var_0 ( int var_1 ) {
if ( var_1 <= 1 ) {
return var_1 + "" ;
}
String var_6 = "1" ;
for ( int var_8 = 2 ;
var_8 <= var_1 ;
var_8 ++ ) {
int var_9 = 1 ;
char var_12 = var_6 . charAt ( 0 ) ;
int var_14 = var_6 . length ( ) ;
StringBuffer var_16 = new StringBuffer ( ) ;
f... |
334 | <awangdev>265. Paint House II_1.java | public int minCostII(int[][] costs) {
if (costs == null || costs.length == 0) return 0;
if (costs.length == 1 && costs[0].length == 1) return costs[0][0];
int n = costs.length, k = costs[0].length;
int[][] dp = new int[n + 1][k];
for (int i = 1; i <= n; i++) {
... | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
if ( var_0 . length == 1 && var_0 [ 0 ] . length == 1 ) return var_0 [ 0 ] [ 0 ] ;
int var_5 = var_0 . length , var_6 = var_0 [ 0 ] . length ;
int [ ] [ ] var_7 = new int [ var_5 + 1 ] [ var_6 ] ;
for ( i... |
335 | <awangdev>64. Minimum Path Sum_5.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];
dp[0][0] = grid[0][0];
for (int i = 1; i < m; i++) dp[i][0]... | 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 ] ;
var_6 [ 0 ] [ 0 ] = var_0 [ 0 ] [ ... |
336 | <awangdev>771. Jewels and Stones_1.java | public int numJewelsInStones(String J, String S) {
if (J == null || J.length() == 0 || S == null || S.length() == 0) {
return 0;
}
int m = J.length();
Set<Character> set = new HashSet<>();
int count = 0;
for (char c : J.toCharArray()) {
set.add(c);... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null || var_1 . length ( ) == 0 || var_2 == null || var_2 . length ( ) == 0 ) {
return 0 ;
}
int var_6 = var_1 . length ( ) ;
Set < Character > var_10 = new HashSet < > ( ) ;
int var_11 = 0 ;
for ( char var_13 : var_1 . toCharArr... |
337 | <awangdev>674. Longest Continuous Increasing Subsequence_3.java | public int findLengthOfLCIS(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length;
int[] dp = new int[n];
dp[0] = 1;
int max = 1;
for (int i = 1; i < n; i++) {
dp[i] = 1;
if (nums[i] > nums[i - 1]) dp[i] = Math.max(dp[i]... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length ;
int [ ] var_5 = new int [ var_4 ] ;
var_5 [ 0 ] = 1 ;
int max = 1 ;
for ( int var_8 = 1 ;
var_8 < var_4 ;
var_8 ++ ) {
var_5 [ var_8 ] = 1 ;
if ( var_0 [ var_8 ] > v... |
338 | <awangdev>438. Find All Anagrams in a String_2.java | private boolean compare(int[] window, int[] countP) {
for (int i = 0; i < 26; i++) {
if (window[i] != countP[i]) return false;
}
return true;
} | private boolean var_0 ( int [ ] var_1 , int [ ] var_2 ) {
for ( int var_4 = 0 ;
var_4 < 26 ;
var_4 ++ ) {
if ( var_1 [ var_4 ] != var_2 [ var_4 ] ) return false ;
}
return true ;
}
|
339 | <awangdev>Nim Game_3.java | public boolean canWinNim(int n ) {
if (n <= 3) {
return true;
}
boolean[] dp = new boolean[4];
dp[0] = true;
dp[1] = dp[2] = dp[3] = true;
for (int i = 4; i <= n; i++) {
dp[i % 4] = !(dp[(i - 1) % 4] && dp[(i - 2) % 4] && dp[(i - 3) % 4]);
... | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 3 ) {
return true ;
}
boolean [ ] var_5 = new boolean [ 4 ] ;
var_5 [ 0 ] = true ;
var_5 [ 1 ] = var_5 [ 2 ] = var_5 [ 3 ] = true ;
for ( int var_8 = 4 ;
var_8 <= var_1 ;
var_8 ++ ) {
var_5 [ var_8 % 4 ] = ! ( var_5 [ ( var_8 - 1 ) % 4 ] && var_... |
340 | <awangdev>Single Number II_1.java | public int singleNumber(int[] A) {
if (A == null || A.length == 0) {
return -1;
}
int[] bits = new int[32];
int rst = 0;
for (int i = 0; i < 32; i++) {
for (int j = 0; j < A.length; j++){
bits[i] += A[j] >> i & 1;
bits[i] %=... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int [ ] var_6 = new int [ 32 ] ;
int var_7 = 0 ;
for ( int var_8 = 0 ;
var_8 < 32 ;
var_8 ++ ) {
for ( int var_9 = 0 ;
var_9 < var_0 . length ;
var_9 ++ ) {
var_6 [ var_8 ] += ... |
341 | <awangdev>Path Sum IV_1.java | private int dfs(Map<Integer, Integer> map, int key, int sum) {
sum += map.get(key);
int level = key / 10;
int position = key % 10;
int leftChildKey = (level + 1) * 10 + position * 2 - 1;
int rightChildKey = leftChildKey + 1;
if (!map.containsKey(leftChildKey) && !... | private int sample_funcname ( Map < Integer , Integer > map , int key , int sum ) {
sum += map . get ( key ) ;
int level = key / 10 ;
int position = key % 10 ;
int leftChildKey = ( level + 1 ) * 10 + position * 2 - 1 ;
int rightChildKey = leftChildKey + 1 ;
if ( ! map . containsKey ( leftChildKey ) && ! map... |
342 | <awangdev>[lint]. Heapify_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 ;
}
|
343 | <awangdev>893. Groups of Special-Equivalent Strings_1.java | public int numSpecialEquivGroups(String[] A) {
if (A == null || A.length == 0) {
return 0;
}
HashSet<String> set = new HashSet<>();
for (String s : A) {
int[] odd = new int[256];
int[] even = new int[256];
for (int i = 0; i < s.len... | public int sample_funcname ( String [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return 0 ;
}
HashSet < String > var_6 = new HashSet < > ( ) ;
for ( String var_7 : var_1 ) {
int [ ] var_9 = new int [ 256 ] ;
int [ ] var_10 = new int [ 256 ] ;
for ( int var_11 = 0 ;
var_11 < va... |
344 | <awangdev>122. Best Time to Buy and Sell Stock II_1.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int profit = 0;
for (int i = 1; i < prices.length; i++) {
if (prices[i] > prices[i - 1]) {
profit += prices[i] - prices[i - 1];
}
}
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = 0 ;
for ( int var_6 = 1 ;
var_6 < var_0 . length ;
var_6 ++ ) {
if ( var_0 [ var_6 ] > var_0 [ var_6 - 1 ] ) {
var_4 += var_0 [ var_6 ] - var_0 [ var_6 - 1 ] ;
}
}
retu... |
345 | <awangdev>Bus Routes_1.java | public int numBusesToDestination(int[][] routes, int S, int T) {
Set<Integer> visited = new HashSet<>();
Map<Integer, Set<Integer>> stopMap = new HashMap<>();
Queue<Integer> queue = new LinkedList<>();
for (int i = 0; i < routes.length; i++) {
for (int stop : routes[i]) {
... | public int sample_funcname ( int [ ] [ ] var_0 , int var_1 , int var_2 ) {
Set < Integer > var_6 = new HashSet < > ( ) ;
Map < Integer , Set < Integer >> var_9 = new HashMap < > ( ) ;
Queue < Integer > var_12 = new LinkedList < > ( ) ;
for ( int var_14 = 0 ;
var_14 < var_0 . length ;
var_14 ++ ) {
for (... |
346 | <awangdev>Contiguous Array_2.java | public int findMaxLength(int[] nums) {
if (nums == null || nums.length == 0) return 0;
Map<Integer, Integer> map = new HashMap<>();
map.put(0, -1);
int preSum = 0, max = 0;
for (int i = 0; i < nums.length; i++) {
preSum += nums[i];
int k = preSum - i - 1;... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
Map < Integer , Integer > var_7 = new HashMap < > ( ) ;
var_7 . put ( 0 , - 1 ) ;
int var_10 = 0 , max = 0 ;
for ( int var_12 = 0 ;
var_12 < var_0 . length ;
var_12 ++ ) {
var_10 += var_0 [ var_12 ] ;... |
347 | <awangdev>Swap Bits_1.java | public int swapOddEvenBits(int x) {
return ((x & 0xaaaaaaaa) >>> 1) + ((x & 0x55555555) << 1);
} | public int sample_funcname ( int var_0 ) {
return ( ( var_0 & 0xaaaaaaaa ) >>> 1 ) + ( ( var_0 & 0x55555555 ) << 1 ) ;
}
|
348 | <awangdev>Plus One_1.java | public int[] plusOne(int[] digits) {
if(digits.length==0) return digits;
digits[digits.length-1] += 1;
for(int i = digits.length-1; i>0; i--){
if(digits[i] == 10){
digits[i]=0;
digits[i-1]+=1;
}
else return digits;
}
... | public int [ ] sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return var_0 ;
var_0 [ var_0 . length - 1 ] += 1 ;
for ( int var_4 = var_0 . length - 1 ;
var_4 > 0 ;
var_4 -- ) {
if ( var_0 [ var_4 ] == 10 ) {
var_0 [ var_4 ] = 0 ;
var_0 [ var_4 - 1 ] += 1 ;
}
else return... |
349 | <awangdev>Frog Jump_1.java | private void move(Map<Integer, Set<Integer>> dp, int stone, int step) {
if (step > 0 && dp.containsKey(stone + step)) {
dp.get(stone + step).add(step);
}
} | private void var_0 ( Map < Integer , Set < Integer >> var_4 , int var_5 , int var_6 ) {
if ( var_6 > 0 && var_4 . containsKey ( var_5 + var_6 ) ) {
var_4 . get ( var_5 + var_6 ) . add ( var_6 ) ;
}
}
|
350 | <awangdev>254. Factor Combinations_1.java | public void dfs(List<List<Integer>> rst, List<Integer> list, int num, Integer lastFactor) {
if (lastFactor != null) {
list.add(num);
rst.add(new ArrayList<>(list));
list.remove(list.size() - 1);
}
int high = (int) Math.sqrt(num);
int low = lastFactor ... | public void sample_funcname ( List < List < Integer >> rst , List < Integer > list , int num , Integer lastFactor ) {
if ( lastFactor != null ) {
list . add ( num ) ;
rst . add ( new ArrayList < > ( list ) ) ;
list . remove ( list . size ( ) - 1 ) ;
}
int high = ( int ) Math . sqrt ( num ) ;
int low... |
351 | <awangdev>Longest Substring Without Repeating Characters_2.java | public int lengthOfLongestSubstring(String s) {
if (s == null || s.length() == 0) {
return 0;
}
HashMap<Character, Integer> map = new HashMap<>();
char[] arr = s.toCharArray();
int rst = Integer.MIN_VALUE;
for (int i = 0; i < arr.length; i++) {
cha... | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
HashMap < Character , Integer > var_8 = new HashMap < > ( ) ;
char [ ] var_10 = var_1 . toCharArray ( ) ;
int var_12 = Integer . MIN_VALUE ;
for ( int var_13 = 0 ;
var_13 < var_10 . length ;
... |
352 | <awangdev>293. Flip Game_1.java | public List<String> generatePossibleNextMoves(String s) {
List<String> rst = new ArrayList<>();
if (s == null || s.length() < 2) {
return rst;
}
StringBuffer sb = new StringBuffer(s);
for (int i = 0; i < s.length() - 1; i++) {
String str = s.substring(i, i... | public List < String > var_1 ( String var_2 ) {
List < String > var_5 = new ArrayList < > ( ) ;
if ( var_2 == null || var_2 . length ( ) < 2 ) {
return var_5 ;
}
StringBuffer var_10 = new StringBuffer ( var_2 ) ;
for ( int var_12 = 0 ;
var_12 < var_2 . length ( ) - 1 ;
var_12 ++ ) {
String var_15 ... |
353 | <awangdev>Binary Representation_2.java | public String parseDecimal(String n) {
if (n.length() == 0 || n.equals("0")) {
return "";
}
double num = Double.parseDouble("0." + n);
HashSet<Double> set = new HashSet<>();
StringBuffer sb = new StringBuffer();
while (num > 0) {
if (sb.length() > ... | public String var_0 ( String var_2 ) {
if ( var_2 . length ( ) == 0 || var_2 . equals ( "0" ) ) {
return "" ;
}
double var_11 = Double . parseDouble ( "0." + var_2 ) ;
HashSet < Double > var_13 = new HashSet < > ( ) ;
StringBuffer var_15 = new StringBuffer ( ) ;
while ( var_11 > 0 ) {
if ( var_15 . ... |
354 | <awangdev>36. Valid Sudoku_1.java | private boolean helper(char c, Set<Character> set) {
if (!set.contains(c)) set.add(c);
else if (c != '.') return false;
return true;
} | private boolean var_0 ( char var_1 , Set < Character > var_4 ) {
if ( ! var_4 . contains ( var_1 ) ) var_4 . add ( var_1 ) ;
else if ( var_1 != '.' ) return false ;
return true ;
}
|
355 | <awangdev>78. Subsets_4.java | private List<Integer> buildResult(List<Integer> indexRow, int[] nums) {
List<Integer> list = new ArrayList<>();
for (int index : indexRow) list.add(nums[index]);
return list;
} | private List < Integer > var_1 ( List < Integer > var_3 , int [ ] var_4 ) {
List < Integer > var_6 = new ArrayList < > ( ) ;
for ( int var_7 : var_3 ) var_6 . add ( var_4 [ var_7 ] ) ;
return var_6 ;
}
|
356 | <awangdev>Copy Books_3.java | public int copyBooks(int[] pages, int K) {
if (pages == null || pages.length == 0) {
return 0;
}
int n = pages.length;
if (K > n) {
K = n;
}
int[][] dp = new int[2][n + 1];
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_5 = var_0 . length ;
if ( var_1 > var_5 ) {
var_1 = var_5 ;
}
int [ ] [ ] var_8 = new int [ 2 ] [ var_5 + 1 ] ;
var_8 [ 0 ] [ 0 ] = 0 ;
for ( int var_9 = 1 ;
var_9 <= v... |
357 | <awangdev>House Robber II_4.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
} else if (nums.length == 1) {
return nums[0];
}
int n = nums.length;
int[][] dp = new int[2][2];
dp[0][0] = 0;
dp[1][0] = nums[1];
dp[0][1] = nums[0];
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
else if ( var_0 . length == 1 ) {
return var_0 [ 0 ] ;
}
int var_5 = var_0 . length ;
int [ ] [ ] var_7 = new int [ 2 ] [ 2 ] ;
var_7 [ 0 ] [ 0 ] = 0 ;
var_7 [ 1 ] [ 0 ] = var_0 [ 1 ] ;
va... |
358 | <awangdev>Best Time to Buy and Sell Stock IV_3.java | public int maxProfit(int k, int[] prices) {
if (prices == null || prices.length == 0 || k <= 0) {
return 0;
}
int profit = 0;
int n = prices.length;
int statusLength = 2 * k + 1;
if (k >= n/2) {
for (int i = 1; i < n; i++) {
if (prices[i] > pr... | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 || var_0 <= 0 ) {
return 0 ;
}
int var_5 = 0 ;
int var_6 = var_1 . length ;
int var_9 = 2 * var_0 + 1 ;
if ( var_0 >= var_6 / 2 ) {
for ( int var_10 = 1 ;
var_10 < var_6 ;
var_10 ++ ) {
... |
359 | <awangdev>383. Ransom Note_1.java | public boolean canConstruct(String ransomNote, String magazine) {
if (ransomNote == null) return true;
if (magazine == null || magazine.length() < ransomNote.length()) return false;
int[] count = new int[256];
for (char c : magazine.toCharArray()) {
count[c]++;
}
... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null ) return true ;
if ( var_3 == null || var_3 . length ( ) < var_2 . length ( ) ) return false ;
int [ ] var_7 = new int [ 256 ] ;
for ( char var_9 : var_3 . toCharArray ( ) ) {
var_7 [ var_9 ] ++ ;
}
for ( char var_9 : var_2 . toCh... |
360 | <awangdev>Maximum Subarray II_2.java | public int maxTwoSubArrays(List<Integer> nums) {
if (nums == null || nums.size() == 0) {
return 0;
}
int n = nums.size();
int[] dpLeft = new int[2];
int[] dpRight = new int[2];
dpLeft[0] = 0;
dpRight[n % 2] = 0;
int[] maxLeft = new int[n + 1];... | public int sample_funcname ( List < Integer > var_2 ) {
if ( var_2 == null || var_2 . size ( ) == 0 ) {
return 0 ;
}
int var_6 = var_2 . size ( ) ;
int [ ] var_8 = new int [ 2 ] ;
int [ ] var_9 = new int [ 2 ] ;
var_8 [ 0 ] = 0 ;
var_9 [ var_6 % 2 ] = 0 ;
int [ ] var_11 = new int [ var_6 + 1 ] ;
i... |
361 | <awangdev>198. House Robber_1.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length;
long[] dp = new long[n + 1];
dp[0] = 0;
dp[1] = nums[0];
for (int i = 2; i <= n; i++) {
dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i - 1]);
}
r... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length ;
long [ ] var_6 = new long [ var_4 + 1 ] ;
var_6 [ 0 ] = 0 ;
var_6 [ 1 ] = var_0 [ 0 ] ;
for ( int var_8 = 2 ;
var_8 <= var_4 ;
var_8 ++ ) {
var_6 [ var_8 ] = Math . max ... |
362 | <awangdev>1203. Sort Items by Groups Respecting Dependencies_4.java | private Map<Integer, List<Integer>> buildGroupGraph(int n, int[] group, List<List<Integer>> beforeItems) {
Map<Integer, List<Integer>> graph = new HashMap<>();
for (int i = 0; i < n; i++) {
int groupId = group[i];
for (int item : beforeItems.get(i)) {
if (groupId... | private Map < Integer , List < Integer >> var_2 ( int var_3 , int [ ] var_4 , List < List < Integer >> var_5 ) {
Map < Integer , List < Integer >> var_8 = new HashMap < > ( ) ;
for ( int var_10 = 0 ;
var_10 < var_3 ;
var_10 ++ ) {
int var_11 = var_4 [ var_10 ] ;
for ( int var_13 : var_5 . get ( var_10 )... |
363 | <awangdev>415. Add Strings_1.java | public String addStrings(String num1, String num2) {
StringBuffer sb = new StringBuffer();
int carry = 0;
int i = num1.length() - 1, j = num2.length() - 1;
for (; i >= 0 || j >= 0 || carry == 1; i--, j--) {
int x = i < 0 ? 0 : (num1.charAt(i) - '0');
int y... | public String var_0 ( String var_2 , String var_3 ) {
StringBuffer var_5 = new StringBuffer ( ) ;
int var_7 = 0 ;
int var_10 = var_2 . length ( ) - 1 , var_11 = var_3 . length ( ) - 1 ;
for ( ;
var_10 >= 0 || var_11 >= 0 || var_7 == 1 ;
var_10 -- , var_11 -- ) {
int var_14 = var_10 < 0 ? 0 : ( var_2 . c... |
364 | <awangdev>The Smallest Difference_1.java | public int smallestDifference(int[] A, int[] B) {
if (A == null || A.length == 0 || B == null || B.length == 0) {
return 0;
}
if (A.length > B.length) {
int[] temp = A;
A = B;
B = temp;
}
Arrays.sort(A);
Arrays.sort(B);
int diff = Integer.MAX_VALUE;
for ... | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 == null || var_1 . length == 0 ) {
return 0 ;
}
if ( var_0 . length > var_1 . length ) {
int [ ] var_5 = var_0 ;
var_0 = var_1 ;
var_1 = var_5 ;
}
Arrays . sort ( var_0 ) ;
Array... |
365 | <awangdev>221. Maximal Square_3.java | public int maximalSquare(char[][] matrix) {
if (matrix == null || matrix.length == 0 || matrix[0] == null || matrix[0].length == 0) {
return 0;
}
int m = matrix.length;
int n = matrix[0].length;
int[][] dp = new int[2][n];
int maxLen = 0;
int curr = 0;... | public int sample_funcname ( char [ ] [ ] 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_7 = new int [ 2 ] [ var_5 ] ;
int var_8 = 0 ;
int var_9 = 0... |
366 | <awangdev>13. Roman to Integer_4.java | private Map<Character, Integer> buildMap() {
Map<Character, Integer> map = new HashMap<>();
map.put('I', 1);
map.put('V', 5);
map.put('X', 10);
map.put('L', 50);
map.put('C', 100);
map.put('D', 500);
map.put('M', 1000);
return map;
} | private Map < Character , Integer > var_2 ( ) {
Map < Character , Integer > var_5 = new HashMap < > ( ) ;
var_5 . put ( 'I' , 1 ) ;
var_5 . put ( 'V' , 5 ) ;
var_5 . put ( 'X' , 10 ) ;
var_5 . put ( 'L' , 50 ) ;
var_5 . put ( 'C' , 100 ) ;
var_5 . put ( 'D' , 500 ) ;
var_5 . put ( 'M' , 1000 ) ;
retur... |
367 | <awangdev>51. N-Queens_1.java | private boolean validate(int[] columns, int row, int col) {
for (int newRow = 0; newRow < row; newRow++) {
int newCol = columns[newRow];
if (col == newCol || (Math.abs(row - newRow) == Math.abs(col - newCol))) {
return false;
}
}
return true;
... | private boolean var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
int var_6 = var_1 [ var_5 ] ;
if ( var_3 == var_6 || ( Math . abs ( var_2 - var_5 ) == Math . abs ( var_3 - var_6 ) ) ) {
return false ;
}
}
return true ;
}
|
368 | <awangdev>1216. Valid Palindrome III_1.java | private int findLpsLength(String s) {
int n = s.length();
int[][] dp = new int[n][n];
for (int i = n - 1; i >= 0; i--){
dp[i][i] = 1;
for (int j = i + 1; j < n; j++) {
if (s.charAt(i) == s.charAt(j)) dp[i][j] = dp[i + 1][j - 1] + 2;
else d... | private int sample_funcname ( String var_1 ) {
int var_3 = var_1 . length ( ) ;
int [ ] [ ] var_4 = new int [ var_3 ] [ var_3 ] ;
for ( int var_6 = var_3 - 1 ;
var_6 >= 0 ;
var_6 -- ) {
var_4 [ var_6 ] [ var_6 ] = 1 ;
for ( int var_8 = var_6 + 1 ;
var_8 < var_3 ;
var_8 ++ ) {
if ( var_1 ... |
369 | <awangdev>Evaluate Reverse Polish Notation_1.java | private boolean isOperator(String s) {
if (s.length() != 1) return false;
char c = s.charAt(0);
return c == '+' || c == '-' || c == '/' || c == '*';
} | private boolean var_0 ( String var_2 ) {
if ( var_2 . length ( ) != 1 ) return false ;
char var_7 = var_2 . charAt ( 0 ) ;
return var_7 == '+' || var_7 == '-' || var_7 == '/' || var_7 == '*' ;
}
|
370 | <awangdev>39. Combination Sum_1.java | private void dfs(List<List<Integer>> result, List<Integer> list,
int[] candidates, int index, int target) {
if (target == 0) {
result.add(new ArrayList<>(list));
return;
}
for (int i = index; i < candidates.length; i++) {
int value = cand... | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] candidates , int index , int target ) {
if ( target == 0 ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
for ( int i = index ;
i < candidates . length ;
i ++ ) {
int value = candidates [ i... |
371 | <awangdev>Backpack II_1.java | public int backPackII(int m, int[] A, int V[]) {
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 i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
dp[i][j]... | public int sample_funcname ( int var_0 , int [ ] var_1 , int var_2 [ ] ) {
if ( var_1 == null || var_2 == null || var_1 . length != var_2 . length ) {
return 0 ;
}
int var_6 = var_1 . length ;
int [ ] [ ] var_8 = new int [ var_6 + 1 ] [ var_0 + 1 ] ;
for ( int var_9 = 1 ;
var_9 <= var_6 ;
var_9 ++ ) {... |
372 | <awangdev>347. Top K Frequent Elements_1.java | private Map<Integer, Integer> buildFreqMap(int[] nums) {
Map<Integer, Integer> map = new HashMap<>();
for (int num : nums) map.put(num, map.getOrDefault(num, 0) + 1);
return map;
} | private Map < Integer , Integer > var_1 ( int [ ] var_2 ) {
Map < Integer , Integer > var_5 = new HashMap < > ( ) ;
for ( int var_6 : var_2 ) var_5 . put ( var_6 , var_5 . getOrDefault ( var_6 , 0 ) + 1 ) ;
return var_5 ;
}
|
373 | <awangdev>Missing Number_3.java | public int missingNumber(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int result = nums.length;
for (int i = 0; i < nums.length; i++) {
result = result ^ nums[i] ^ i;
}
return result;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
var_4 = var_4 ^ var_0 [ var_5 ] ^ var_5 ;
}
return var_4 ;
}
|
374 | <awangdev>152. Maximum Product Subarray_1.java | public int maxProduct(int[] nums) {
int n = nums.length;
int[] maxProduct = new int[n], minProduct = new int[n];
maxProduct[0] = nums[0];
minProduct[0] = nums[0];
int max = nums[0];
for (int i = 1; i < n; i++) {
int num = nums[i];
if (num > 0) {
... | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = var_0 . length ;
int [ ] var_3 = new int [ var_2 ] , var_4 = new int [ var_2 ] ;
var_3 [ 0 ] = var_0 [ 0 ] ;
var_4 [ 0 ] = var_0 [ 0 ] ;
int max = var_0 [ 0 ] ;
for ( int var_8 = 1 ;
var_8 < var_2 ;
var_8 ++ ) {
int var_9 = var_0 [ var_8 ] ;... |
375 | <awangdev>53. Maximum Subarray_6.java | public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length, max = Integer.MIN_VALUE;
int[] dp = new int[2];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i % 2] = nums[i - 1] + (dp[(i - 1) % 2] >= 0 ? dp[(i - 1) % 2] : 0);... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length , max = Integer . MIN_VALUE ;
int [ ] var_9 = new int [ 2 ] ;
var_9 [ 0 ] = 0 ;
for ( int var_11 = 1 ;
var_11 <= var_4 ;
var_11 ++ ) {
var_9 [ var_11 % 2 ] = var_0 [ var_11 ... |
376 | <awangdev>Longest Consecutive Sequence_2.java | public int longestConsecutive(int[] num) {
if (num == null || num.length == 0) {
return 0;
}
int maxL = 1;
HashMap<Integer, Boolean> history = new HashMap<Integer, Boolean>();
for (int i : num) {
history.put(i, false);
}
for (int i : num) {... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_5 = 1 ;
HashMap < Integer , Boolean > var_9 = new HashMap < Integer , Boolean > ( ) ;
for ( int var_10 : var_0 ) {
var_9 . put ( var_10 , false ) ;
}
for ( int var_10 : var_0 ) {
i... |
377 | <awangdev>1. Two Sum_2.java | public int[] twoSum(int[] numbers, int target) {
if (numbers == null || numbers.length == 0) {
return null;
}
int[] original = new int[numbers.length];
for (int i = 0; i < numbers.length; i++) {
original[i] = numbers[i];
}
Arrays.sort(numb... | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return null ;
}
int [ ] var_5 = new int [ var_0 . length ] ;
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
var_5 [ var_6 ] = var_0 [ var_6 ] ;
}
Arrays . sort ( var_0 ) ;
... |
378 | <awangdev>Paint Fence_2.java | public int numWays(int n, int k) {
if (n <= 1 || k <= 0) {
return n * k;
}
int[] dp = new int[3];
dp[0] = 0;
dp[1] = k;
dp[2] = k + k * (k - 1);
for (int i = 3; i <= n; i++) {
dp[i % 3] = (k - 1) * (dp[(i - 1) % 3] + dp[(i - 2) % 3... | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 <= 1 || var_1 <= 0 ) {
return var_0 * var_1 ;
}
int [ ] var_5 = new int [ 3 ] ;
var_5 [ 0 ] = 0 ;
var_5 [ 1 ] = var_1 ;
var_5 [ 2 ] = var_1 + var_1 * ( var_1 - 1 ) ;
for ( int var_7 = 3 ;
var_7 <= var_0 ;
var_7 ++ ) {
var_5 [ va... |
379 | <awangdev>K Empty Slots_1.java | public int kEmptySlots(int[] flowers, int k) {
if (flowers == null || flowers.length == 0 || k < 0) {
return - 1;
}
TreeSet<Integer> treeSet = new TreeSet<>();
for (int i = 0; i < flowers.length; i++) {
int num = flowers[i];
treeSet.add(num);
... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 < 0 ) {
return - 1 ;
}
TreeSet < Integer > var_8 = new TreeSet < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_0 . length ;
var_9 ++ ) {
int var_10 = var_0 [ var_9 ] ;
var_8 . add ( var_10 )... |
380 | <awangdev>Jump Game II_4.java | public int jump(int[] nums) {
if (nums == null || nums.length <= 1) {
return 0;
}
int index = 0;
int step = 0;
int range = 0;
int maxRange = 0;
while (index < nums.length) {
if (range >= nums.length - 1) {
break;
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) {
return 0 ;
}
int var_5 = 0 ;
int var_6 = 0 ;
int var_7 = 0 ;
int var_8 = 0 ;
while ( var_5 < var_0 . length ) {
if ( var_7 >= var_0 . length - 1 ) {
break ;
}
while ( var_5 <= var_7 ) {
... |
381 | <awangdev>259. 3Sum Smaller_2.java | public int threeSumSmaller(int[] nums, int target) {
if (nums == null || nums.length <= 2) {
return 0;
}
Arrays.sort(nums);
int rst = 0;
for (int i = 0; i < nums.length - 2; i++) {
int j = i + 1;
int k = nums.length - 1;
while (j < k) {
... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length <= 2 ) {
return 0 ;
}
Arrays . sort ( var_0 ) ;
int var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_0 . length - 2 ;
var_9 ++ ) {
int var_11 = var_9 + 1 ;
int var_12 = var_0 . length - 1 ;
while (... |
382 | <awangdev>91. Decode Ways_2.java | private boolean check(String s, int i) {
int twoDigit = (s.charAt(i - 1) - '0') * 10 + (s.charAt(i) - '0');
return twoDigit <= 26 && twoDigit >= 10;
} | private boolean var_0 ( String var_2 , int var_3 ) {
int var_8 = ( var_2 . charAt ( var_3 - 1 ) - '0' ) * 10 + ( var_2 . charAt ( var_3 ) - '0' ) ;
return var_8 <= 26 && var_8 >= 10 ;
}
|
383 | <awangdev>200. Number of Islands_2.java | private int countIsland(char[][] grid) {
int m = grid.length, n = grid[0].length;
int count = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
count += grid[i][j] == '1' ? 1 : 0;
}
}
return count;
} | private int sample_funcname ( char [ ] [ ] var_0 ) {
int var_2 = var_0 . length , var_4 = var_0 [ 0 ] . length ;
int var_5 = 0 ;
for ( int var_6 = 0 ;
var_6 < var_2 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 < var_4 ;
var_7 ++ ) {
var_5 += var_0 [ var_6 ] [ var_7 ] == '1' ? 1 : 0 ;
}
}... |
384 | <awangdev>40. Combination Sum II_4.java | private boolean validate(int[] candidates, int target) {
return candidates == null || candidates.length == 0 || target <= 0;
} | private boolean var_0 ( int [ ] var_1 , int var_2 ) {
return var_1 == null || var_1 . length == 0 || var_2 <= 0 ;
}
|
385 | <awangdev>621. Task Scheduler_1.java | public int leastInterval(char[] tasks, int n) {
if (tasks == null) return 0;
PriorityQueue<Integer> pq = new PriorityQueue<>(26, Collections.reverseOrder());
int[] counts = new int[26];
for (char c : tasks) counts[c - 'A']++;
for (int i = 0; i < counts.length; i++) {
... | public int sample_funcname ( char [ ] var_0 , int var_1 ) {
if ( var_0 == null ) return 0 ;
PriorityQueue < Integer > var_9 = new PriorityQueue < > ( 26 , Collections . reverseOrder ( ) ) ;
int [ ] var_10 = new int [ 26 ] ;
for ( char var_11 : var_0 ) var_10 [ var_11 - 'A' ] ++ ;
for ( int var_13 = 0 ;
var_... |
386 | <awangdev>64. Minimum Path Sum_2.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;
int n = grid[0].length;
int[][] dp = new int[2][n];
for (int i = 0; i < m; i++) {
for (int j =... | 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_7 = new int [ 2 ] [ var_5 ] ;
for ( int var_8 = 0 ;
var_8 < ... |
387 | <awangdev>350. Intersection of Two Arrays II_2.java | private int[] convertToArray(List<Integer> list) {
int[] rst = new int[list.size()];
for (int i = 0; i < list.size(); i++) {
rst[i] = list.get(i);
}
return rst;
} | private int [ ] sample_funcname ( List < Integer > var_2 ) {
int [ ] var_4 = new int [ var_2 . size ( ) ] ;
for ( int var_6 = 0 ;
var_6 < var_2 . size ( ) ;
var_6 ++ ) {
var_4 [ var_6 ] = var_2 . get ( var_6 ) ;
}
return var_4 ;
}
|
388 | <awangdev>Submatrix Sum_1.java | private boolean validateInput(int[][] nums) {
if (nums == null || nums.length == 0 || nums[0] == null || nums[0].length == 0) {
return true;
}
return false;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ) {
return true ;
}
return false ;
}
|
389 | <awangdev>361. Bomb Enemy_1.java | public int maxKilledEnemies(char[][] grid) {
if (grid == null || grid.length == 0 || grid[0].length == 0) {
return 0;
}
int m = grid.length;
int n = grid[0].length;
int[][] up = new int[m][n];
int[][] down = new int[m][n];
int[][] left = new int[m][n];... | public int sample_funcname ( char [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || 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 [ var_4 ] [ var_5 ] ;
... |
390 | <awangdev>Longest Common Substring_1.java | public int longestCommonSubstring(String A, String B) {
if (A == null || B == null || A.length() == 0 || B.length() == 0) {
return 0;
}
int m = A.length();
int n = B.length();
int[][] dp = new int[m + 1][n + 1];
int max = 0;
for (int i = 0; i <= m; i++) {
for(int j = 0; j ... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null || var_1 . length ( ) == 0 || var_2 . length ( ) == 0 ) {
return 0 ;
}
int var_6 = var_1 . length ( ) ;
int var_7 = var_2 . length ( ) ;
int [ ] [ ] var_9 = new int [ var_6 + 1 ] [ var_7 + 1 ] ;
int max = 0 ... |
391 | <awangdev>Backpack_2.java | public int backPack(int m, int[] A) {
if (A == null || A.length < 0) {
return 0;
}
int n = A.length;
int[][] dp = new int[2][m + 1];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
dp[i % 2][j] = dp[(i - 1) % 2][j];
if (j - A[i - 1... | 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 ;
int [ ] [ ] var_8 = new int [ 2 ] [ var_0 + 1 ] ;
for ( int var_9 = 1 ;
var_9 <= var_5 ;
var_9 ++ ) {
for ( int var_10 = 0 ;
var_10 <= var_0 ;
v... |
392 | <awangdev>71. Simplify Path_1.java | public String simplifyPath(String path) {
Stack<String> stack = new Stack<>();
String[] parts = path.split("/");
for (String s : parts) {
if (s.isEmpty() || s.equals(".")) continue;
if (s.equals("..")) {
if (!stack.isEmpty()) stack.pop();
c... | public String var_0 ( String var_2 ) {
Stack < String > var_4 = new Stack < > ( ) ;
String [ ] var_7 = var_2 . split ( "/" ) ;
for ( String var_8 : var_7 ) {
if ( var_8 . isEmpty ( ) || var_8 . equals ( "." ) ) continue ;
if ( var_8 . equals ( ".." ) ) {
if ( ! var_4 . isEmpty ( ) ) var_4 . pop ( ) ... |
393 | <awangdev>Stone Game_1.java | public int stoneGame(int[] A) {
if (A == null || A.length == 0) {
return 0;
}
int n = A.length;
int[][] f = new int[n][n];
for (int i = 0; i < n; i++) {
f[i][i] = 0;
}
int[][] sum = new int[n][n];
sum[0][... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int [ ] [ ] var_5 = new int [ var_4 ] [ var_4 ] ;
for ( int var_6 = 0 ;
var_6 < var_4 ;
var_6 ++ ) {
var_5 [ var_6 ] [ var_6 ] = 0 ;
}
int [ ] [ ] var_7 = new ... |
394 | <awangdev>Find Minimum in Rotated Sorted Array II_1.java | public int findMin(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int start = 0;
int end = n - 1;
while (start + 1 < end) {
int mid = (start + end) >> 1;
if (nums[mid] == nums[end]) {
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int var_5 = 0 ;
int var_7 = var_4 - 1 ;
while ( var_5 + 1 < var_7 ) {
int var_8 = ( var_5 + var_7 ) >> 1 ;
if ( var_0 [ var_8 ] == var_0 [ var_7 ] ) {
var_... |
395 | <awangdev>20. Valid Parentheses_1.java | private boolean validate(char a, char b) {
if (a == '(') return b == ')';
if (a == '{') return b == '}';
if (a == '[') return b == ']';
return false;
} | private boolean var_0 ( char var_1 , char var_2 ) {
if ( var_1 == '(' ) return var_2 == ')' ;
if ( var_1 == '{' ) return var_2 == '}' ;
if ( var_1 == '[' ) return var_2 == ']' ;
return false ;
}
|
396 | <awangdev>Expression Add Operators_1.java | private void backtrack(List<String> list) {
list.remove(list.size() - 1);
list.remove(list.size() - 1);
} | private void var_0 ( List < String > var_3 ) {
var_3 . remove ( var_3 . size ( ) - 1 ) ;
var_3 . remove ( var_3 . size ( ) - 1 ) ;
}
|
397 | <awangdev>252. Meeting Rooms_1.java | public boolean canAttendMeetings(int[][] intervals) {
if (intervals == null) return true;
Arrays.sort(intervals, Comparator.comparing(i -> i[0]));
for (int i = 0; i < intervals.length - 1; i++) {
if (intervals[i][1] > intervals[i + 1][0]) return false;
}
return true;... | public boolean var_0 ( int [ ] [ ] var_1 ) {
if ( var_1 == null ) return true ;
Arrays . sort ( var_1 , Comparator . comparing ( var_7 -> var_7 [ 0 ] ) ) ;
for ( int var_7 = 0 ;
var_7 < var_1 . length - 1 ;
var_7 ++ ) {
if ( var_1 [ var_7 ] [ 1 ] > var_1 [ var_7 + 1 ] [ 0 ] ) return false ;
}
return t... |
398 | <awangdev>Gray Code_2.java | public List<Integer> grayCode(int n) {
List<Integer> rst = new ArrayList<Integer>();
if (n < 0) {
return rst;
}
char[] bits = new char[n];
for (int i = 0; i < bits.length; i++) {
bits[i] = '0';
}
String str = new String(bits);
if (n == 0)... | public List < Integer > var_1 ( int var_2 ) {
List < Integer > var_5 = new ArrayList < Integer > ( ) ;
if ( var_2 < 0 ) {
return var_5 ;
}
char [ ] var_7 = new char [ var_2 ] ;
for ( int var_8 = 0 ;
var_8 < var_7 . length ;
var_8 ++ ) {
var_7 [ var_8 ] = '0' ;
}
String var_12 = new String ( va... |
399 | <awangdev>Sliding Puzzle_3.java | private String boardToString(int[] nums) {
StringBuffer sb = new StringBuffer();
for (int num : nums) {
sb.append(num + "#");
}
return sb.toString();
} | private String var_0 ( int [ ] var_1 ) {
StringBuffer var_3 = new StringBuffer ( ) ;
for ( int var_4 : var_1 ) {
var_3 . append ( var_4 + "#" ) ;
}
return var_3 . toString ( ) ;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.