id
int64 0
1.17k
| comefrom
stringlengths 21
84
| code
stringlengths 50
1.89k
| masked
stringlengths 63
2.42k
| unique_words_num
int64 0
6
| words
stringlengths 1
139
⌀ |
|---|---|---|---|---|---|
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 ;
}
}
| 0 | null |
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_3 = ( var_0 & var_1 ) << 1 ;
while ( var_3 != 0 ) {
int var_4 = var_2 & var_3 ;
var_2 = var_2 ^ var_3 ;
var_3 = var_4 << 1 ;
}
return var_2 ;
}
| 2 | 1<SEP>0 |
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) {
primes[j] = false;
}
}
int count = 0;
for (int i = 2; i < primes.length; i++) {
count += primes[i] ? 1 : 0;
}
return count;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 0 ;
}
boolean [ ] var_1 = new boolean [ var_0 ] ;
for ( int var_2 = 2 ;
var_2 < var_1 . length ;
var_2 ++ ) {
var_1 [ var_2 ] = true ;
}
for ( int var_2 = 2 ;
var_2 * var_2 < var_0 ;
var_2 ++ ) {
if ( ! var_1 [ var_2 ] ) {
continue ;
}
for ( int var_3 = var_2 * var_2 ;
var_3 < var_0 ;
var_3 += var_2 ) {
var_1 [ var_3 ] = false ;
}
}
int var_4 = 0 ;
for ( int var_2 = 2 ;
var_2 < var_1 . length ;
var_2 ++ ) {
var_4 += var_1 [ var_2 ] ? 1 : 0 ;
}
return var_4 ;
}
| 3 | 1<SEP>0<SEP>2 |
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 = s.charAt(i);
if (c == '[') {
if (paren > 0) {
substring += c;
}
paren++;
} else if (c == ']') {
paren--;
if (paren == 0) {
String innerString = expressionExpand(substring);
for (int num = 0; num < number; num++) {
sb.append(innerString);
}
number = 0;
substring = "";
} else {
substring += c;
}
} else if (Character.isDigit(c)) {
if (paren == 0) {
number = number * 10 + (c - '0');
} else {
substring += c;
}
} else {
if (paren == 0) {
sb.append(String.valueOf(c));
} else {
substring += c;
}
}
}
return sb.toString();
} | 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 == '[' ) {
if ( paren > 0 ) {
substring += c ;
}
paren ++ ;
}
else if ( c == ']' ) {
paren -- ;
if ( paren == 0 ) {
String innerString = expressionExpand ( substring ) ;
for ( int num = 0 ;
num < number ;
num ++ ) {
sb . append ( innerString ) ;
}
number = 0 ;
substring = "" ;
}
else {
substring += c ;
}
}
else if ( Character . isDigit ( c ) ) {
if ( paren == 0 ) {
number = number * 10 + ( c - '0' ) ;
}
else {
substring += c ;
}
}
else {
if ( paren == 0 ) {
sb . append ( String . valueOf ( c ) ) ;
}
else {
substring += c ;
}
}
}
return sb . toString ( ) ;
}
| 6 | <S_QUOTE>[<S_QUOTE><SEP><S_QUOTE>]<S_QUOTE><SEP>0<SEP>10<SEP><S_QUOTE>0<S_QUOTE><SEP><D_QUOTE><D_QUOTE> |
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_1 ) {
if ( var_1 . equals ( "+" ) || var_1 . equals ( "-" ) ) {
return var_0 + 1 ;
}
if ( var_1 . equals ( "*" ) || var_1 . equals ( "/" ) ) {
return var_0 + 2 ;
}
return Integer . MAX_VALUE ;
}
| 6 | <D_QUOTE>-<D_QUOTE><SEP>2<SEP><D_QUOTE>/<D_QUOTE><SEP>1<SEP><D_QUOTE>+<D_QUOTE><SEP><D_QUOTE>*<D_QUOTE> |
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, stack.pop());
return sb.toString();
} | private String var_0 ( String var_1 ) {
Stack < Character > var_2 = new Stack < > ( ) ;
for ( char var_3 : var_1 . toCharArray ( ) ) {
if ( var_3 != '#' ) var_2 . push ( var_3 ) ;
else if ( ! var_2 . isEmpty ( ) ) var_2 . pop ( ) ;
}
StringBuffer var_4 = new StringBuffer ( ) ;
while ( ! var_2 . isEmpty ( ) ) var_4 . insert ( 0 , var_2 . pop ( ) ) ;
return var_4 . toString ( ) ;
}
| 2 | <S_QUOTE>#<S_QUOTE><SEP>0 |
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 <= s1.length(); i++) {
if (s3.charAt(i - 1) == s1.charAt(i - 1) && DP[i - 1][0]) {
DP[i][0] = true;
}
}
for (int j = 1; j <= s2.length(); j++) {
if (s3.charAt(j - 1) == s2.charAt(j - 1) && DP[0][j - 1]) {
DP[0][j] = true;
}
}
for (int i = 1; i <= s1.length(); i++) {
for (int j = 1; j <= s2.length(); j++) {
if ((s3.charAt(i + j - 1) == s1.charAt(i - 1) && DP[i - 1][j])
|| (s3.charAt(i + j - 1) == s2.charAt(j - 1) && DP[i][j - 1])) {
DP[i][j] = true;
}
}
}
return DP[s1.length()][s2.length()];
} | public boolean var_0 ( String var_1 , String var_2 , String var_3 ) {
if ( var_3 == null || ( var_1 == null && var_2 == null ) || var_1 . length ( ) + var_2 . length ( ) != var_3 . length ( ) ) {
return false ;
}
boolean [ ] [ ] var_4 = new boolean [ var_1 . length ( ) + 1 ] [ var_2 . length ( ) + 1 ] ;
var_4 [ 0 ] [ 0 ] = true ;
for ( int var_5 = 1 ;
var_5 <= var_1 . length ( ) ;
var_5 ++ ) {
if ( var_3 . charAt ( var_5 - 1 ) == var_1 . charAt ( var_5 - 1 ) && var_4 [ var_5 - 1 ] [ 0 ] ) {
var_4 [ var_5 ] [ 0 ] = true ;
}
}
for ( int var_6 = 1 ;
var_6 <= var_2 . length ( ) ;
var_6 ++ ) {
if ( var_3 . charAt ( var_6 - 1 ) == var_2 . charAt ( var_6 - 1 ) && var_4 [ 0 ] [ var_6 - 1 ] ) {
var_4 [ 0 ] [ var_6 ] = true ;
}
}
for ( int var_5 = 1 ;
var_5 <= var_1 . length ( ) ;
var_5 ++ ) {
for ( int var_6 = 1 ;
var_6 <= var_2 . length ( ) ;
var_6 ++ ) {
if ( ( var_3 . charAt ( var_5 + var_6 - 1 ) == var_1 . charAt ( var_5 - 1 ) && var_4 [ var_5 - 1 ] [ var_6 ] ) || ( var_3 . charAt ( var_5 + var_6 - 1 ) == var_2 . charAt ( var_6 - 1 ) && var_4 [ var_5 ] [ var_6 - 1 ] ) ) {
var_4 [ var_5 ] [ var_6 ] = true ;
}
}
}
return var_4 [ var_1 . length ( ) ] [ var_2 . length ( ) ] ;
}
| 2 | 1<SEP>0 |
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){
dfs(result, list, i + 1, k, n - i);
}
list.remove(list.size() - 1);
}
} | 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 ) {
dfs ( result , list , i + 1 , k , n - i ) ;
}
list . remove ( list . size ( ) - 1 ) ;
}
}
| 2 | 1<SEP>9 |
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 < s.length(); i++) {
char c = ss[i];
if (Character.isDigit(c)) isNum = true;
else if (c == '.') {
if (isDot || isExp) return false;
isDot = true;
} else if (c == 'e') {
if (isExp || !isNum) return false;
isExp = true;
isNum = false;
} else if (c == '+' || c == '-') {
if (i >= 1 && s.charAt(i - 1) != 'e') return false;
} else return false;
}
return isNum;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 == null ) return false ;
var_1 = var_1 . trim ( ) ;
if ( var_1 . length ( ) == 0 ) return false ;
int var_2 = 0 ;
char [ ] var_3 = var_1 . toCharArray ( ) ;
if ( var_3 [ var_2 ] == '+' || var_3 [ var_2 ] == '-' ) var_2 ++ ;
boolean var_7 = false , var_5 = false , var_6 = false ;
for ( ;
var_2 < var_1 . length ( ) ;
var_2 ++ ) {
char var_4 = var_3 [ var_2 ] ;
if ( Character . isDigit ( var_4 ) ) var_7 = true ;
else if ( var_4 == '.' ) {
if ( var_5 || var_6 ) return false ;
var_5 = true ;
}
else if ( var_4 == 'e' ) {
if ( var_6 || ! var_7 ) return false ;
var_6 = true ;
var_7 = false ;
}
else if ( var_4 == '+' || var_4 == '-' ) {
if ( var_2 >= 1 && var_1 . charAt ( var_2 - 1 ) != 'e' ) return false ;
}
else return false ;
}
return var_7 ;
}
| 6 | <S_QUOTE>-<S_QUOTE><SEP>0<SEP>1<SEP><S_QUOTE>e<S_QUOTE><SEP><S_QUOTE>+<S_QUOTE><SEP><S_QUOTE>.<S_QUOTE> |
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_1 ) {
int var_2 = 0 ;
for ( int var_3 : var_0 ) var_2 += ( var_1 == var_3 ) ? 1 : 0 ;
return var_2 ;
}
| 2 | 0<SEP>1 |
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 - j * j] + 1);
}
}
return dp[n];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
int [ ] var_1 = new int [ var_0 + 1 ] ;
var_1 [ 0 ] = 0 ;
for ( int var_2 = 1 ;
var_2 <= var_0 ;
var_2 ++ ) {
var_1 [ var_2 ] = Integer . MAX_VALUE ;
for ( int var_3 = 1 ;
var_3 <= var_2 && var_3 * var_3 <= var_2 ;
var_3 ++ ) {
var_1 [ var_2 ] = Math . min ( var_1 [ var_2 ] , var_1 [ var_2 - var_3 * var_3 ] + 1 ) ;
}
}
return var_1 [ var_0 ] ;
}
| 2 | 1<SEP>0 |
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)) {
return false;
}
}
return true;
} | private boolean var_0 ( List < Integer > var_1 , int var_2 ) {
int var_3 = var_1 . size ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . size ( ) ;
var_4 ++ ) {
int var_5 = var_1 . get ( var_4 ) ;
if ( var_5 == var_2 || Math . abs ( var_2 - var_5 ) == Math . abs ( var_3 - var_4 ) ) {
return false ;
}
}
return true ;
}
| 1 | 0 |
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[index--] = B[--n];
}
} | public void var_0 ( int [ ] var_1 , int var_2 , int [ ] var_3 , int var_4 ) {
int var_5 = 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_5 -- ] = var_1 [ -- var_2 ] ;
}
else {
var_1 [ var_5 -- ] = var_3 [ -- var_4 ] ;
}
}
while ( var_4 > 0 ) {
var_1 [ var_5 -- ] = var_3 [ -- var_4 ] ;
}
}
| 2 | 1<SEP>0 |
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] = 0;
dp[n - 1] = values[n - 1];
dp[n - 2] = values[n - 1] + values[n - 2];
sum[n] = 0;
sum[n - 1] = values[n - 1];
for (int i = n - 2; i >= 0; i--) {
sum[i] = sum[i + 1] + values[i];
dp[i] = Math.max(sum[i] - dp[i + 1], sum[i] - dp[i + 2]);
}
return sum[0] - dp[0] < dp[0];
} | 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_2 = var_1 . length ;
int [ ] var_3 = new int [ var_2 + 1 ] ;
int [ ] var_4 = new int [ var_2 + 1 ] ;
var_3 [ var_2 ] = 0 ;
var_3 [ var_2 - 1 ] = var_1 [ var_2 - 1 ] ;
var_3 [ var_2 - 2 ] = var_1 [ var_2 - 1 ] + var_1 [ var_2 - 2 ] ;
var_4 [ var_2 ] = 0 ;
var_4 [ var_2 - 1 ] = var_1 [ var_2 - 1 ] ;
for ( int var_5 = var_2 - 2 ;
var_5 >= 0 ;
var_5 -- ) {
var_4 [ var_5 ] = var_4 [ var_5 + 1 ] + var_1 [ var_5 ] ;
var_3 [ var_5 ] = Math . max ( var_4 [ var_5 ] - var_3 [ var_5 + 1 ] , var_4 [ var_5 ] - var_3 [ var_5 + 2 ] ) ;
}
return var_4 [ 0 ] - var_3 [ 0 ] < var_3 [ 0 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
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_2 ) {
System . out . print ( var_2 ) ;
if ( var_1 == null || var_1 . length == 0 ) {
System . out . println ( ) ;
return ;
}
for ( int var_3 : var_1 ) {
System . out . print ( var_3 + ", " ) ;
}
System . out . println ( ) ;
}
| 2 | <D_QUOTE>, <D_QUOTE><SEP>0 |
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 - A[i - 1] >= 0) {
dp[i][j] = dp[i - 1][j] || dp[i - 1][j - A[i - 1]];
} else {
dp[i][j] = dp[i - 1][j];
}
}
}
for (int j = m; j >= 0; j--) {
if (dp[A.length][j]) {
return j;
}
}
return 0;
} | 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_2 = new boolean [ var_1 . length + 1 ] [ var_0 + 1 ] ;
var_2 [ 0 ] [ 0 ] = true ;
for ( int var_3 = 1 ;
var_3 <= var_1 . length ;
var_3 ++ ) {
for ( int var_4 = 0 ;
var_4 <= var_0 ;
var_4 ++ ) {
if ( var_4 - var_1 [ var_3 - 1 ] >= 0 ) {
var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 - 1 ] [ var_4 ] || var_2 [ var_3 - 1 ] [ var_4 - var_1 [ var_3 - 1 ] ] ;
}
else {
var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 - 1 ] [ var_4 ] ;
}
}
}
for ( int var_4 = var_0 ;
var_4 >= 0 ;
var_4 -- ) {
if ( var_2 [ var_1 . length ] [ var_4 ] ) {
return var_4 ;
}
}
return 0 ;
}
| 2 | 0<SEP>1 |
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) {
graph.get(edge[0]).add(edge[1]);
graph.get(edge[1]).add(edge[0]);
}
return graph;
} | private Map < Integer , List < Integer >> var_0 ( int var_1 , int [ ] [ ] var_2 ) {
Map < Integer , List < Integer >> var_3 = new HashMap < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
if ( ! var_3 . containsKey ( var_4 ) ) {
var_3 . put ( var_4 , new ArrayList < > ( ) ) ;
}
}
for ( int [ ] var_5 : var_2 ) {
var_3 . get ( var_5 [ 0 ] ) . add ( var_5 [ 1 ] ) ;
var_3 . get ( var_5 [ 1 ] ) . add ( var_5 [ 0 ] ) ;
}
return var_3 ;
}
| 2 | 0<SEP>1 |
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 ;
}
| 0 | null |
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);
}
for (int i = n - 2; i >= 0; i--) {
for (int j = 0; j <= i; j++) {
dp[i % 2][j] = Math.min(dp[(i + 1)%2][j], dp[(i + 1)%2][j + 1]) + triangle.get(i).get(j);
}
}
return dp[0][0];
} | public int sample_funcname ( List < List < Integer >> var_0 ) {
if ( var_0 == null || var_0 . size ( ) == 0 ) {
return 0 ;
}
int var_1 = var_0 . size ( ) ;
int [ ] [ ] var_2 = new int [ 2 ] [ var_1 ] ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) {
var_2 [ ( var_1 - 1 ) % 2 ] [ var_3 ] = var_0 . get ( var_1 - 1 ) . get ( var_3 ) ;
}
for ( int var_4 = var_1 - 2 ;
var_4 >= 0 ;
var_4 -- ) {
for ( int var_3 = 0 ;
var_3 <= var_4 ;
var_3 ++ ) {
var_2 [ var_4 % 2 ] [ var_3 ] = Math . min ( var_2 [ ( var_4 + 1 ) % 2 ] [ var_3 ] , var_2 [ ( var_4 + 1 ) % 2 ] [ var_3 + 1 ] ) + var_0 . get ( var_4 ) . get ( var_3 ) ;
}
}
return var_2 [ 0 ] [ 0 ] ;
}
| 3 | 0<SEP>1<SEP>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 ;
}
| 0 | null |
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.deleteCharAt(0);
sb.append(c);
if (sb.toString().equals(B)) {
return true;
}
}
return false;
} | public boolean var_0 ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null || var_1 . length ( ) != var_2 . length ( ) ) {
return false ;
}
if ( var_1 . equals ( var_2 ) ) {
return true ;
}
StringBuffer var_3 = new StringBuffer ( var_1 ) ;
for ( char var_4 : var_1 . toCharArray ( ) ) {
var_3 . deleteCharAt ( 0 ) ;
var_3 . append ( var_4 ) ;
if ( var_3 . toString ( ) . equals ( var_2 ) ) {
return true ;
}
}
return false ;
}
| 1 | 0 |
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;
}
return false;
} | public boolean var_0 ( int var_1 ) {
long var_2 = 0 , var_3 = var_1 ;
while ( var_2 <= var_3 ) {
long var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
long var_5 = var_4 * var_4 ;
if ( var_5 == var_1 ) return true ;
else if ( var_5 < var_1 ) var_2 = var_4 + 1 ;
else var_3 = var_4 - 1 ;
}
return false ;
}
| 3 | 0<SEP>1<SEP>2 |
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 ;
}
| 2 | 1<SEP>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();
for (int j = 1; j < size; j++) {
if (curr.charAt(j) == curr.charAt(j - 1)) {
count++;
} else {
sb.append(count + String.valueOf(c));
c = curr.charAt(j);
count = 1;
}
}
sb.append(count + String.valueOf(c));
curr = sb.toString();
}
return curr;
} | public String var_0 ( int var_1 ) {
if ( var_1 <= 1 ) {
return var_1 + "" ;
}
String var_2 = "1" ;
for ( int var_3 = 2 ;
var_3 <= var_1 ;
var_3 ++ ) {
int var_4 = 1 ;
char var_5 = var_2 . charAt ( 0 ) ;
int var_6 = var_2 . length ( ) ;
StringBuffer var_7 = new StringBuffer ( ) ;
for ( int var_8 = 1 ;
var_8 < var_6 ;
var_8 ++ ) {
if ( var_2 . charAt ( var_8 ) == var_2 . charAt ( var_8 - 1 ) ) {
var_4 ++ ;
}
else {
var_7 . append ( var_4 + String . valueOf ( var_5 ) ) ;
var_5 = var_2 . charAt ( var_8 ) ;
var_4 = 1 ;
}
}
var_7 . append ( var_4 + String . valueOf ( var_5 ) ) ;
var_2 = var_7 . toString ( ) ;
}
return var_2 ;
}
| 5 | 2<SEP>1<SEP>0<SEP><D_QUOTE>1<D_QUOTE><SEP><D_QUOTE><D_QUOTE> |
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++) {
for (int j = 0; j < k; j++) {
dp[i][j] = Integer.MAX_VALUE;
for (int m = 0; m < k; m++) {
if (j == m) continue;
dp[i][j] = Math.min(dp[i][j], dp[i - 1][m] + costs[i - 1][j]);
}
}
}
int min = Integer.MAX_VALUE;
for (int j = 0; j < k; j++) min = Math.min(min, dp[n][j]);
return min;
} | 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_1 = var_0 . length , var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 + 1 ] [ var_2 ] ;
for ( int var_4 = 1 ;
var_4 <= var_1 ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
var_3 [ var_4 ] [ var_5 ] = Integer . MAX_VALUE ;
for ( int var_6 = 0 ;
var_6 < var_2 ;
var_6 ++ ) {
if ( var_5 == var_6 ) continue ;
var_3 [ var_4 ] [ var_5 ] = Math . min ( var_3 [ var_4 ] [ var_5 ] , var_3 [ var_4 - 1 ] [ var_6 ] + var_0 [ var_4 - 1 ] [ var_5 ] ) ;
}
}
}
int min = Integer . MAX_VALUE ;
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) min = Math . min ( min , var_3 [ var_1 ] [ var_5 ] ) ;
return min ;
}
| 2 | 0<SEP>1 |
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] = dp[i - 1][0] + grid[i][0];
for (int j = 1; j < n; j++) dp[0][j] = dp[0][j - 1] + grid[0][j];
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
}
}
return dp[m - 1][n - 1];
} | 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_1 = var_0 . length , var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 ] [ var_2 ] ;
var_3 [ 0 ] [ 0 ] = var_0 [ 0 ] [ 0 ] ;
for ( int var_4 = 1 ;
var_4 < var_1 ;
var_4 ++ ) var_3 [ var_4 ] [ 0 ] = var_3 [ var_4 - 1 ] [ 0 ] + var_0 [ var_4 ] [ 0 ] ;
for ( int var_5 = 1 ;
var_5 < var_2 ;
var_5 ++ ) var_3 [ 0 ] [ var_5 ] = var_3 [ 0 ] [ var_5 - 1 ] + var_0 [ 0 ] [ var_5 ] ;
for ( int var_4 = 1 ;
var_4 < var_1 ;
var_4 ++ ) {
for ( int var_5 = 1 ;
var_5 < var_2 ;
var_5 ++ ) {
var_3 [ var_4 ] [ var_5 ] = Math . min ( var_3 [ var_4 - 1 ] [ var_5 ] , var_3 [ var_4 ] [ var_5 - 1 ] ) + var_0 [ var_4 ] [ var_5 ] ;
}
}
return var_3 [ var_1 - 1 ] [ var_2 - 1 ] ;
}
| 2 | 0<SEP>1 |
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);
}
for (char c : S.toCharArray()) {
count += set.contains(c) ? 1 : 0;
}
return count;
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_0 == null || var_0 . length ( ) == 0 || var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
int var_2 = var_0 . length ( ) ;
Set < Character > var_3 = new HashSet < > ( ) ;
int var_4 = 0 ;
for ( char var_5 : var_0 . toCharArray ( ) ) {
var_3 . add ( var_5 ) ;
}
for ( char var_5 : var_1 . toCharArray ( ) ) {
var_4 += var_3 . contains ( var_5 ) ? 1 : 0 ;
}
return var_4 ;
}
| 2 | 0<SEP>1 |
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], dp[i - 1] + 1);
max = Math.max(max, dp[i]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_1 = var_0 . length ;
int [ ] var_2 = new int [ var_1 ] ;
var_2 [ 0 ] = 1 ;
int max = 1 ;
for ( int var_3 = 1 ;
var_3 < var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] = 1 ;
if ( var_0 [ var_3 ] > var_0 [ var_3 - 1 ] ) var_2 [ var_3 ] = Math . max ( var_2 [ var_3 ] , var_2 [ var_3 - 1 ] + 1 ) ;
max = Math . max ( max , var_2 [ var_3 ] ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
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_3 = 0 ;
var_3 < 26 ;
var_3 ++ ) {
if ( var_1 [ var_3 ] != var_2 [ var_3 ] ) return false ;
}
return true ;
}
| 2 | 0<SEP>26 |
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]);
}
return dp[n % 4];
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 3 ) {
return true ;
}
boolean [ ] var_2 = new boolean [ 4 ] ;
var_2 [ 0 ] = true ;
var_2 [ 1 ] = var_2 [ 2 ] = var_2 [ 3 ] = true ;
for ( int var_3 = 4 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 % 4 ] = ! ( var_2 [ ( var_3 - 1 ) % 4 ] && var_2 [ ( var_3 - 2 ) % 4 ] && var_2 [ ( var_3 - 3 ) % 4 ] ) ;
}
return var_2 [ var_1 % 4 ] ;
}
| 4 | 2<SEP>4<SEP>3<SEP>1 |
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] %= 3;
}
rst |= bits[i] << i;
}
return rst;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int [ ] var_1 = new int [ 32 ] ;
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < 32 ;
var_3 ++ ) {
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
var_1 [ var_3 ] += var_0 [ var_4 ] >> var_3 & 1 ;
var_1 [ var_3 ] %= 3 ;
}
var_2 |= var_1 [ var_3 ] << var_3 ;
}
return var_2 ;
}
| 4 | 0<SEP>3<SEP>32<SEP>1 |
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) && !map.containsKey(rightChildKey)) return sum;
int result = 0;
if (map.containsKey(leftChildKey)) result += dfs(map, leftChildKey, sum);
if (map.containsKey(rightChildKey)) result += dfs(map, rightChildKey, sum);
return result;
} | 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 . containsKey ( rightChildKey ) ) return sum ;
int result = 0 ;
if ( map . containsKey ( leftChildKey ) ) result += dfs ( map , leftChildKey , sum ) ;
if ( map . containsKey ( rightChildKey ) ) result += dfs ( map , rightChildKey , sum ) ;
return result ;
}
| 4 | 10<SEP>1<SEP>0<SEP>2 |
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 ;
}
| 0 | null |
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.length(); i++) {
int c = s.charAt(i);
if (i % 2 == 0) {
even[c]++;
} else {
odd[c]++;
}
}
String signature = Arrays.toString(odd) + Arrays.toString(even);
set.add(signature);
}
return set.size();
} | public int sample_funcname ( String [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
HashSet < String > var_1 = new HashSet < > ( ) ;
for ( String var_2 : var_0 ) {
int [ ] var_3 = new int [ 256 ] ;
int [ ] var_4 = new int [ 256 ] ;
for ( int var_5 = 0 ;
var_5 < var_2 . length ( ) ;
var_5 ++ ) {
int var_6 = var_2 . charAt ( var_5 ) ;
if ( var_5 % 2 == 0 ) {
var_4 [ var_6 ] ++ ;
}
else {
var_3 [ var_6 ] ++ ;
}
}
String var_7 = Arrays . toString ( var_3 ) + Arrays . toString ( var_4 ) ;
var_1 . add ( var_7 ) ;
}
return var_1 . size ( ) ;
}
| 3 | 0<SEP>256<SEP>2 |
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];
}
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = 0 ;
for ( int var_2 = 1 ;
var_2 < var_0 . length ;
var_2 ++ ) {
if ( var_0 [ var_2 ] > var_0 [ var_2 - 1 ] ) {
var_1 += var_0 [ var_2 ] - var_0 [ var_2 - 1 ] ;
}
}
return var_1 ;
}
| 2 | 0<SEP>1 |
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]) {
stopMap.putIfAbsent(stop, new HashSet<>());
stopMap.get(stop).add(i);
}
}
queue.offer(S);
int count = 0;
while (!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size; i++) {
int stop = queue.poll();
if (stop == T) return count;
for (int bus : stopMap.get(stop)) {
if (!visited.contains(bus)) {
visited.add(bus);
for (int nextStop : routes[bus]) {
queue.offer(nextStop);
}
}
}
}
count++;
}
return -1;
} | public int sample_funcname ( int [ ] [ ] var_0 , int var_1 , int var_2 ) {
Set < Integer > var_3 = new HashSet < > ( ) ;
Map < Integer , Set < Integer >> var_4 = new HashMap < > ( ) ;
Queue < Integer > var_5 = new LinkedList < > ( ) ;
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
for ( int var_7 : var_0 [ var_6 ] ) {
var_4 . putIfAbsent ( var_7 , new HashSet < > ( ) ) ;
var_4 . get ( var_7 ) . add ( var_6 ) ;
}
}
var_5 . offer ( var_1 ) ;
int var_8 = 0 ;
while ( ! var_5 . isEmpty ( ) ) {
int size = var_5 . size ( ) ;
for ( int var_6 = 0 ;
var_6 < size ;
var_6 ++ ) {
int var_7 = var_5 . poll ( ) ;
if ( var_7 == var_2 ) return var_8 ;
for ( int var_9 : var_4 . get ( var_7 ) ) {
if ( ! var_3 . contains ( var_9 ) ) {
var_3 . add ( var_9 ) ;
for ( int var_10 : var_0 [ var_9 ] ) {
var_5 . offer ( var_10 ) ;
}
}
}
}
var_8 ++ ;
}
return - 1 ;
}
| 2 | 0<SEP>1 |
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;
if (map.containsKey(preSum - k)) {
max = Math.max(max, i - map.get(preSum - k));
}
if (!map.containsKey(preSum)) {
map.put(preSum, i);
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
Map < Integer , Integer > var_1 = new HashMap < > ( ) ;
var_1 . put ( 0 , - 1 ) ;
int var_2 = 0 , max = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
var_2 += var_0 [ var_3 ] ;
int var_4 = var_2 - var_3 - 1 ;
if ( var_1 . containsKey ( var_2 - var_4 ) ) {
max = Math . max ( max , var_3 - var_1 . get ( var_2 - var_4 ) ) ;
}
if ( ! var_1 . containsKey ( var_2 ) ) {
var_1 . put ( var_2 , var_3 ) ;
}
}
return max ;
}
| 2 | 0<SEP>1 |
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 ) ;
}
| 3 | 0xaaaaaaaa<SEP>1<SEP>0x55555555 |
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;
}
if(digits[0]==10){
int[] output = new int[digits.length+1];
output[0] = 1;
return output;
}
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_1 = var_0 . length - 1 ;
var_1 > 0 ;
var_1 -- ) {
if ( var_0 [ var_1 ] == 10 ) {
var_0 [ var_1 ] = 0 ;
var_0 [ var_1 - 1 ] += 1 ;
}
else return var_0 ;
}
if ( var_0 [ 0 ] == 10 ) {
int [ ] var_2 = new int [ var_0 . length + 1 ] ;
var_2 [ 0 ] = 1 ;
return var_2 ;
}
else return var_0 ;
}
| 3 | 10<SEP>0<SEP>1 |
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_1 , int var_2 , int var_3 ) {
if ( var_3 > 0 && var_1 . containsKey ( var_2 + var_3 ) ) {
var_1 . get ( var_2 + var_3 ) . add ( var_3 ) ;
}
}
| 1 | 0 |
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 == null ? 2 : Math.max(2, lastFactor);
while (low <= high) {
if (num % low == 0) {
list.add(low);
dfs(rst, list, num / low, low);
list.remove(list.size() - 1);
}
low++;
}
} | 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 = lastFactor == null ? 2 : Math . max ( 2 , lastFactor ) ;
while ( low <= high ) {
if ( num % low == 0 ) {
list . add ( low ) ;
dfs ( rst , list , num / low , low ) ;
list . remove ( list . size ( ) - 1 ) ;
}
low ++ ;
}
}
| 3 | 1<SEP>0<SEP>2 |
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++) {
char c = arr[i];
if (map.containsKey(c)) {
i = map.get(c);
map = new HashMap<>();
} else {
map.put(c, i);
}
rst = Math.max(rst, map.size());
}
return rst == Integer.MIN_VALUE ? 0 : rst;
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
HashMap < Character , Integer > var_1 = new HashMap < > ( ) ;
char [ ] var_2 = var_0 . toCharArray ( ) ;
int var_3 = Integer . MIN_VALUE ;
for ( int var_4 = 0 ;
var_4 < var_2 . length ;
var_4 ++ ) {
char var_5 = var_2 [ var_4 ] ;
if ( var_1 . containsKey ( var_5 ) ) {
var_4 = var_1 . get ( var_5 ) ;
var_1 = new HashMap < > ( ) ;
}
else {
var_1 . put ( var_5 , var_4 ) ;
}
var_3 = Math . max ( var_3 , var_1 . size ( ) ) ;
}
return var_3 == Integer . MIN_VALUE ? 0 : var_3 ;
}
| 1 | 0 |
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 + 2);
if (str.equals("++")) {
sb.replace(i, i + 2, "--");
rst.add(sb.toString());
sb.replace(i, i + 2, "++");
}
}
return rst;
} | public List < String > var_0 ( String var_1 ) {
List < String > var_2 = new ArrayList < > ( ) ;
if ( var_1 == null || var_1 . length ( ) < 2 ) {
return var_2 ;
}
StringBuffer var_3 = new StringBuffer ( var_1 ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) - 1 ;
var_4 ++ ) {
String var_5 = var_1 . substring ( var_4 , var_4 + 2 ) ;
if ( var_5 . equals ( "++" ) ) {
var_3 . replace ( var_4 , var_4 + 2 , "--" ) ;
var_2 . add ( var_3 . toString ( ) ) ;
var_3 . replace ( var_4 , var_4 + 2 , "++" ) ;
}
}
return var_2 ;
}
| 5 | <D_QUOTE>++<D_QUOTE><SEP>2<SEP>0<SEP>1<SEP><D_QUOTE>--<D_QUOTE> |
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_2 ) {
if ( ! var_2 . contains ( var_1 ) ) var_2 . add ( var_1 ) ;
else if ( var_1 != '.' ) return false ;
return true ;
}
| 1 | <S_QUOTE>.<S_QUOTE> |
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_0 ( List < Integer > var_1 , int [ ] var_2 ) {
List < Integer > var_3 = new ArrayList < > ( ) ;
for ( int var_4 : var_1 ) var_3 . add ( var_2 [ var_4 ] ) ;
return var_3 ;
}
| 0 | null |
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++) {
dp[0][i] = Integer.MAX_VALUE;
}
for (int k = 1; k <= K; k++) {
for (int i = 1; i <= n; i++) {
int sum = 0;
dp[k % 2][i] = Integer.MAX_VALUE;
for (int j = i; j >= 0; j--) {
dp[k % 2][i] = Math.min(dp[k % 2][i], Math.max(dp[(k - 1) % 2][j], sum));
if (j > 0) {
sum += pages[j - 1];
}
}
}
}
return dp[K % 2][n];
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_2 = var_0 . length ;
if ( var_1 > var_2 ) {
var_1 = var_2 ;
}
int [ ] [ ] var_3 = new int [ 2 ] [ var_2 + 1 ] ;
var_3 [ 0 ] [ 0 ] = 0 ;
for ( int var_4 = 1 ;
var_4 <= var_2 ;
var_4 ++ ) {
var_3 [ 0 ] [ var_4 ] = Integer . MAX_VALUE ;
}
for ( int var_5 = 1 ;
var_5 <= var_1 ;
var_5 ++ ) {
for ( int var_4 = 1 ;
var_4 <= var_2 ;
var_4 ++ ) {
int var_6 = 0 ;
var_3 [ var_5 % 2 ] [ var_4 ] = Integer . MAX_VALUE ;
for ( int var_7 = var_4 ;
var_7 >= 0 ;
var_7 -- ) {
var_3 [ var_5 % 2 ] [ var_4 ] = Math . min ( var_3 [ var_5 % 2 ] [ var_4 ] , Math . max ( var_3 [ ( var_5 - 1 ) % 2 ] [ var_7 ] , var_6 ) ) ;
if ( var_7 > 0 ) {
var_6 += var_0 [ var_7 - 1 ] ;
}
}
}
}
return var_3 [ var_1 % 2 ] [ var_2 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
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];
dp[1][1] = dp[0][1];
for (int i = 2; i < n; i++) {
if (i == n - 1) {
dp[i % 2][0] = Math.max(dp[(i - 1) % 2][0], dp[(i - 2) % 2][0] + nums[i]);
dp[i % 2][1] = dp[(i - 1) % 2][1];
} else {
dp[i % 2][0] = Math.max(dp[(i - 1) % 2][0], dp[(i - 2) % 2][0] + nums[i]);
dp[i % 2][1] = Math.max(dp[(i - 1) % 2][1], dp[(i - 2) % 2][1] + nums[i]);
}
}
return Math.max(dp[(n - 1) % 2][0], dp[(n - 1) % 2][1]);
} | 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_1 = var_0 . length ;
int [ ] [ ] var_2 = new int [ 2 ] [ 2 ] ;
var_2 [ 0 ] [ 0 ] = 0 ;
var_2 [ 1 ] [ 0 ] = var_0 [ 1 ] ;
var_2 [ 0 ] [ 1 ] = var_0 [ 0 ] ;
var_2 [ 1 ] [ 1 ] = var_2 [ 0 ] [ 1 ] ;
for ( int var_3 = 2 ;
var_3 < var_1 ;
var_3 ++ ) {
if ( var_3 == var_1 - 1 ) {
var_2 [ var_3 % 2 ] [ 0 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] [ 0 ] , var_2 [ ( var_3 - 2 ) % 2 ] [ 0 ] + var_0 [ var_3 ] ) ;
var_2 [ var_3 % 2 ] [ 1 ] = var_2 [ ( var_3 - 1 ) % 2 ] [ 1 ] ;
}
else {
var_2 [ var_3 % 2 ] [ 0 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] [ 0 ] , var_2 [ ( var_3 - 2 ) % 2 ] [ 0 ] + var_0 [ var_3 ] ) ;
var_2 [ var_3 % 2 ] [ 1 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] [ 1 ] , var_2 [ ( var_3 - 2 ) % 2 ] [ 1 ] + var_0 [ var_3 ] ) ;
}
}
return Math . max ( var_2 [ ( var_1 - 1 ) % 2 ] [ 0 ] , var_2 [ ( var_1 - 1 ) % 2 ] [ 1 ] ) ;
}
| 3 | 2<SEP>0<SEP>1 |
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] > prices[i - 1]) {
profit += prices[i] - prices[i - 1];
}
}
return profit;
}
int[][] dp = new int[2][statusLength];
int prev, curr = 0;
dp[0][0] = 0;
for (int i = 1; i < n; i++) {
prev = curr;
curr = 1 - prev;
for (int j = 1; j < statusLength; j++) {
if (j % 2 == 0) {
dp[curr][j] = Math.max(dp[prev][j], dp[prev][j - 1] + prices[i] - prices[i - 1]);
profit = Math.max(profit, dp[curr][j]);
} else {
dp[curr][j] = Math.max(dp[prev][j] + prices[i] - prices[i - 1], dp[prev][j - 1]);
}
}
}
return profit;
} | 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_2 = 0 ;
int var_3 = var_1 . length ;
int var_4 = 2 * var_0 + 1 ;
if ( var_0 >= var_3 / 2 ) {
for ( int var_5 = 1 ;
var_5 < var_3 ;
var_5 ++ ) {
if ( var_1 [ var_5 ] > var_1 [ var_5 - 1 ] ) {
var_2 += var_1 [ var_5 ] - var_1 [ var_5 - 1 ] ;
}
}
return var_2 ;
}
int [ ] [ ] var_6 = new int [ 2 ] [ var_4 ] ;
int var_7 , var_8 = 0 ;
var_6 [ 0 ] [ 0 ] = 0 ;
for ( int var_5 = 1 ;
var_5 < var_3 ;
var_5 ++ ) {
var_7 = var_8 ;
var_8 = 1 - var_7 ;
for ( int var_9 = 1 ;
var_9 < var_4 ;
var_9 ++ ) {
if ( var_9 % 2 == 0 ) {
var_6 [ var_8 ] [ var_9 ] = Math . max ( var_6 [ var_7 ] [ var_9 ] , var_6 [ var_7 ] [ var_9 - 1 ] + var_1 [ var_5 ] - var_1 [ var_5 - 1 ] ) ;
var_2 = Math . max ( var_2 , var_6 [ var_8 ] [ var_9 ] ) ;
}
else {
var_6 [ var_8 ] [ var_9 ] = Math . max ( var_6 [ var_7 ] [ var_9 ] + var_1 [ var_5 ] - var_1 [ var_5 - 1 ] , var_6 [ var_7 ] [ var_9 - 1 ] ) ;
}
}
}
return var_2 ;
}
| 3 | 0<SEP>1<SEP>2 |
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]++;
}
for (char c : ransomNote.toCharArray()) {
count[c]--;
if (count[c] < 0) {
return false;
}
}
return true;
} | public boolean var_0 ( String var_1 , String var_2 ) {
if ( var_1 == null ) return true ;
if ( var_2 == null || var_2 . length ( ) < var_1 . length ( ) ) return false ;
int [ ] var_3 = new int [ 256 ] ;
for ( char var_4 : var_2 . toCharArray ( ) ) {
var_3 [ var_4 ] ++ ;
}
for ( char var_4 : var_1 . toCharArray ( ) ) {
var_3 [ var_4 ] -- ;
if ( var_3 [ var_4 ] < 0 ) {
return false ;
}
}
return true ;
}
| 2 | 0<SEP>256 |
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];
int[] maxRight = new int[n + 1];
maxLeft[0] = Integer.MIN_VALUE;
maxRight[n] = Integer.MIN_VALUE;
for (int i = 1; i <= n; i++) {
dpLeft[i % 2] = Math.max(dpLeft[(i - 1) % 2] + nums.get(i - 1), nums.get(i - 1));
maxLeft[i] = Math.max(maxLeft[i - 1], dpLeft[i % 2]);
}
for (int j = n - 1; j >= 0; j--) {
dpRight[j % 2] = Math.max(dpRight[(j + 1) % 2] + nums.get(j), nums.get(j));
maxRight[j] = Math.max(maxRight[j + 1], dpRight[j % 2]);
}
int max = Integer.MIN_VALUE;
for (int i = 1; i < n; i++) {
max = Math.max(max, maxLeft[i] + maxRight[i]);
}
return max;
} | public int sample_funcname ( List < Integer > var_0 ) {
if ( var_0 == null || var_0 . size ( ) == 0 ) {
return 0 ;
}
int var_1 = var_0 . size ( ) ;
int [ ] var_2 = new int [ 2 ] ;
int [ ] var_3 = new int [ 2 ] ;
var_2 [ 0 ] = 0 ;
var_3 [ var_1 % 2 ] = 0 ;
int [ ] var_4 = new int [ var_1 + 1 ] ;
int [ ] var_5 = new int [ var_1 + 1 ] ;
var_4 [ 0 ] = Integer . MIN_VALUE ;
var_5 [ var_1 ] = Integer . MIN_VALUE ;
for ( int var_6 = 1 ;
var_6 <= var_1 ;
var_6 ++ ) {
var_2 [ var_6 % 2 ] = Math . max ( var_2 [ ( var_6 - 1 ) % 2 ] + var_0 . get ( var_6 - 1 ) , var_0 . get ( var_6 - 1 ) ) ;
var_4 [ var_6 ] = Math . max ( var_4 [ var_6 - 1 ] , var_2 [ var_6 % 2 ] ) ;
}
for ( int var_7 = var_1 - 1 ;
var_7 >= 0 ;
var_7 -- ) {
var_3 [ var_7 % 2 ] = Math . max ( var_3 [ ( var_7 + 1 ) % 2 ] + var_0 . get ( var_7 ) , var_0 . get ( var_7 ) ) ;
var_5 [ var_7 ] = Math . max ( var_5 [ var_7 + 1 ] , var_3 [ var_7 % 2 ] ) ;
}
int max = Integer . MIN_VALUE ;
for ( int var_6 = 1 ;
var_6 < var_1 ;
var_6 ++ ) {
max = Math . max ( max , var_4 [ var_6 ] + var_5 [ var_6 ] ) ;
}
return max ;
}
| 3 | 0<SEP>1<SEP>2 |
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]);
}
return (int) dp[n];
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_1 = var_0 . length ;
long [ ] var_2 = new long [ var_1 + 1 ] ;
var_2 [ 0 ] = 0 ;
var_2 [ 1 ] = var_0 [ 0 ] ;
for ( int var_3 = 2 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] = Math . max ( var_2 [ var_3 - 1 ] , var_2 [ var_3 - 2 ] + var_0 [ var_3 - 1 ] ) ;
}
return ( int ) var_2 [ var_1 ] ;
}
| 3 | 2<SEP>0<SEP>1 |
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 == group[item]) continue;
graph.putIfAbsent(group[item], new ArrayList<>());
graph.get(group[item]).add(groupId);
}
}
return graph;
} | private Map < Integer , List < Integer >> var_0 ( int var_1 , int [ ] var_2 , List < List < Integer >> var_3 ) {
Map < Integer , List < Integer >> var_4 = new HashMap < > ( ) ;
for ( int var_5 = 0 ;
var_5 < var_1 ;
var_5 ++ ) {
int var_6 = var_2 [ var_5 ] ;
for ( int var_7 : var_3 . get ( var_5 ) ) {
if ( var_6 == var_2 [ var_7 ] ) continue ;
var_4 . putIfAbsent ( var_2 [ var_7 ] , new ArrayList < > ( ) ) ;
var_4 . get ( var_2 [ var_7 ] ) . add ( var_6 ) ;
}
}
return var_4 ;
}
| 1 | 0 |
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 = j < 0 ? 0 : (num2.charAt(j) - '0');
int sum = x + y + carry;
sb.append(sum % 10);
carry = sum / 10;
}
return sb.reverse().toString();
} | public String var_0 ( String var_1 , String var_2 ) {
StringBuffer var_3 = new StringBuffer ( ) ;
int var_4 = 0 ;
int var_5 = var_1 . length ( ) - 1 , var_6 = var_2 . length ( ) - 1 ;
for ( ;
var_5 >= 0 || var_6 >= 0 || var_4 == 1 ;
var_5 -- , var_6 -- ) {
int var_7 = var_5 < 0 ? 0 : ( var_1 . charAt ( var_5 ) - '0' ) ;
int var_8 = var_6 < 0 ? 0 : ( var_2 . charAt ( var_6 ) - '0' ) ;
int var_9 = var_7 + var_8 + var_4 ;
var_3 . append ( var_9 % 10 ) ;
var_4 = var_9 / 10 ;
}
return var_3 . reverse ( ) . toString ( ) ;
}
| 4 | 10<SEP>0<SEP><S_QUOTE>0<S_QUOTE><SEP>1 |
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 (int i = 0; i < A.length; i++) {
int start = 0;
int end = B.length - 1;
int mid;
if (B[start] >= A[A.length - 1]) {
return B[start] - A[A.length - 1];
}
if (A[start] >= B[B.length - 1]) {
return A[start] - B[B.length - 1];
}
while (start + 1 < end) {
mid = start + (end - start)/2;
if (B[mid] == A[i]) {
return 0;
} else if (mid - 1 >= 0 && B[mid - 1] < A[i] && A[i] < B[mid]) {
diff = Math.min(diff, Math.min(A[i] - B[mid - 1], B[mid] - A[i]));
break;
} else if (mid + 1 < B.length - 1 && B[mid] < A[i] && A[i] < B[mid + 1]) {
diff = Math.min(diff, Math.min(A[i] - B[mid], B[mid + 1] - A[i]));
break;
} else if (B[mid] > A[i]) {
end = mid;
} else {
start = mid;
}
}
if (start + 1 >= end) {
int min = Math.min(Math.abs(A[i] - B[start]), Math.abs(A[i] - B[end]));
diff = Math.min(diff, min);
}
}
return diff;
} | 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_2 = var_0 ;
var_0 = var_1 ;
var_1 = var_2 ;
}
Arrays . sort ( var_0 ) ;
Arrays . sort ( var_1 ) ;
int var_3 = Integer . MAX_VALUE ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
int var_5 = 0 ;
int var_6 = var_1 . length - 1 ;
int var_7 ;
if ( var_1 [ var_5 ] >= var_0 [ var_0 . length - 1 ] ) {
return var_1 [ var_5 ] - var_0 [ var_0 . length - 1 ] ;
}
if ( var_0 [ var_5 ] >= var_1 [ var_1 . length - 1 ] ) {
return var_0 [ var_5 ] - var_1 [ var_1 . length - 1 ] ;
}
while ( var_5 + 1 < var_6 ) {
var_7 = var_5 + ( var_6 - var_5 ) / 2 ;
if ( var_1 [ var_7 ] == var_0 [ var_4 ] ) {
return 0 ;
}
else if ( var_7 - 1 >= 0 && var_1 [ var_7 - 1 ] < var_0 [ var_4 ] && var_0 [ var_4 ] < var_1 [ var_7 ] ) {
var_3 = Math . min ( var_3 , Math . min ( var_0 [ var_4 ] - var_1 [ var_7 - 1 ] , var_1 [ var_7 ] - var_0 [ var_4 ] ) ) ;
break ;
}
else if ( var_7 + 1 < var_1 . length - 1 && var_1 [ var_7 ] < var_0 [ var_4 ] && var_0 [ var_4 ] < var_1 [ var_7 + 1 ] ) {
var_3 = Math . min ( var_3 , Math . min ( var_0 [ var_4 ] - var_1 [ var_7 ] , var_1 [ var_7 + 1 ] - var_0 [ var_4 ] ) ) ;
break ;
}
else if ( var_1 [ var_7 ] > var_0 [ var_4 ] ) {
var_6 = var_7 ;
}
else {
var_5 = var_7 ;
}
}
if ( var_5 + 1 >= var_6 ) {
int min = Math . min ( Math . abs ( var_0 [ var_4 ] - var_1 [ var_5 ] ) , Math . abs ( var_0 [ var_4 ] - var_1 [ var_6 ] ) ) ;
var_3 = Math . min ( var_3 , min ) ;
}
}
return var_3 ;
}
| 3 | 2<SEP>0<SEP>1 |
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;
int prev = 0;
for (int i = 0; i < m; i++) {
curr = prev;
prev = 1 - curr;
for (int j = 0; j < n; j++) {
if (i == 0 || j == 0) {
dp[curr][j] = matrix[i][j] == '1' ? 1 : 0;
maxLen = Math.max(dp[curr][j], maxLen);
continue;
}
if (matrix[i][j] == '1') {
dp[curr][j] = Math.min(Math.min(dp[prev][j], dp[curr][j - 1]), dp[prev][j - 1]) + 1;
} else {
dp[curr][j] = 0;
}
maxLen = Math.max(dp[curr][j], maxLen);
}
}
return maxLen * maxLen;
} | 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_1 = var_0 . length ;
int var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ 2 ] [ var_2 ] ;
int var_4 = 0 ;
int var_5 = 0 ;
int var_6 = 0 ;
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
var_5 = var_6 ;
var_6 = 1 - var_5 ;
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
if ( var_7 == 0 || var_8 == 0 ) {
var_3 [ var_5 ] [ var_8 ] = var_0 [ var_7 ] [ var_8 ] == '1' ? 1 : 0 ;
var_4 = Math . max ( var_3 [ var_5 ] [ var_8 ] , var_4 ) ;
continue ;
}
if ( var_0 [ var_7 ] [ var_8 ] == '1' ) {
var_3 [ var_5 ] [ var_8 ] = Math . min ( Math . min ( var_3 [ var_6 ] [ var_8 ] , var_3 [ var_5 ] [ var_8 - 1 ] ) , var_3 [ var_6 ] [ var_8 - 1 ] ) + 1 ;
}
else {
var_3 [ var_5 ] [ var_8 ] = 0 ;
}
var_4 = Math . max ( var_3 [ var_5 ] [ var_8 ] , var_4 ) ;
}
}
return var_4 * var_4 ;
}
| 4 | 0<SEP><S_QUOTE>1<S_QUOTE><SEP>1<SEP>2 |
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_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
int var_5 = var_1 [ var_4 ] ;
if ( var_3 == var_5 || ( Math . abs ( var_2 - var_4 ) == Math . abs ( var_3 - var_5 ) ) ) {
return false ;
}
}
return true ;
}
| 1 | 0 |
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 dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]);
}
}
return dp[0][n - 1];
} | private int sample_funcname ( String var_0 ) {
int var_1 = var_0 . length ( ) ;
int [ ] [ ] var_2 = new int [ var_1 ] [ var_1 ] ;
for ( int var_3 = var_1 - 1 ;
var_3 >= 0 ;
var_3 -- ) {
var_2 [ var_3 ] [ var_3 ] = 1 ;
for ( int var_4 = var_3 + 1 ;
var_4 < var_1 ;
var_4 ++ ) {
if ( var_0 . charAt ( var_3 ) == var_0 . charAt ( var_4 ) ) var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 + 1 ] [ var_4 - 1 ] + 2 ;
else var_2 [ var_3 ] [ var_4 ] = Math . max ( var_2 [ var_3 + 1 ] [ var_4 ] , var_2 [ var_3 ] [ var_4 - 1 ] ) ;
}
}
return var_2 [ 0 ] [ var_1 - 1 ] ;
}
| 3 | 1<SEP>0<SEP>2 |
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_1 ) {
if ( var_1 . length ( ) != 1 ) return false ;
char var_2 = var_1 . charAt ( 0 ) ;
return var_2 == '+' || var_2 == '-' || var_2 == '/' || var_2 == '*' ;
}
| 6 | <S_QUOTE>-<S_QUOTE><SEP>1<SEP>0<SEP><S_QUOTE>*<S_QUOTE><SEP><S_QUOTE>+<S_QUOTE><SEP><S_QUOTE>/<S_QUOTE> |
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 = candidates[i];
list.add(value);
if (target - value >= 0) dfs(result, list, candidates, i, target - value);
list.remove(list.size() - 1);
}
} | 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 ] ;
list . add ( value ) ;
if ( target - value >= 0 ) dfs ( result , list , candidates , i , target - value ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
| 2 | 0<SEP>1 |
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] = dp[i - 1][j];
if (j - A[i - 1] >= 0) {
dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - A[i - 1]] + V[i - 1]);
}
}
}
return dp[n][m];
} | 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_3 = var_1 . length ;
int [ ] [ ] var_4 = new int [ var_3 + 1 ] [ var_0 + 1 ] ;
for ( int var_5 = 1 ;
var_5 <= var_3 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 <= var_0 ;
var_6 ++ ) {
var_4 [ var_5 ] [ var_6 ] = var_4 [ var_5 - 1 ] [ var_6 ] ;
if ( var_6 - var_1 [ var_5 - 1 ] >= 0 ) {
var_4 [ var_5 ] [ var_6 ] = Math . max ( var_4 [ var_5 ] [ var_6 ] , var_4 [ var_5 - 1 ] [ var_6 - var_1 [ var_5 - 1 ] ] + var_2 [ var_5 - 1 ] ) ;
}
}
}
return var_4 [ var_3 ] [ var_0 ] ;
}
| 2 | 0<SEP>1 |
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_0 ( int [ ] var_1 ) {
Map < Integer , Integer > var_2 = new HashMap < > ( ) ;
for ( int var_3 : var_1 ) var_2 . put ( var_3 , var_2 . getOrDefault ( var_3 , 0 ) + 1 ) ;
return var_2 ;
}
| 2 | 0<SEP>1 |
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_1 = var_0 . length ;
for ( int var_2 = 0 ;
var_2 < var_0 . length ;
var_2 ++ ) {
var_1 = var_1 ^ var_0 [ var_2 ] ^ var_2 ;
}
return var_1 ;
}
| 1 | 0 |
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) {
maxProduct[i] = Math.max(num, maxProduct[i - 1] * num);
minProduct[i] = Math.min(num, minProduct[i - 1] * num);
} else {
maxProduct[i] = Math.max(num, minProduct[i - 1] * num);
minProduct[i] = Math.min(num, maxProduct[i - 1] * num);
}
max = Math.max(max, maxProduct[i]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_1 = var_0 . length ;
int [ ] var_2 = new int [ var_1 ] , var_3 = new int [ var_1 ] ;
var_2 [ 0 ] = var_0 [ 0 ] ;
var_3 [ 0 ] = var_0 [ 0 ] ;
int max = var_0 [ 0 ] ;
for ( int var_4 = 1 ;
var_4 < var_1 ;
var_4 ++ ) {
int var_5 = var_0 [ var_4 ] ;
if ( var_5 > 0 ) {
var_2 [ var_4 ] = Math . max ( var_5 , var_2 [ var_4 - 1 ] * var_5 ) ;
var_3 [ var_4 ] = Math . min ( var_5 , var_3 [ var_4 - 1 ] * var_5 ) ;
}
else {
var_2 [ var_4 ] = Math . max ( var_5 , var_3 [ var_4 - 1 ] * var_5 ) ;
var_3 [ var_4 ] = Math . min ( var_5 , var_2 [ var_4 - 1 ] * var_5 ) ;
}
max = Math . max ( max , var_2 [ var_4 ] ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
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);
max = Math.max(max, dp[i % 2]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_1 = var_0 . length , max = Integer . MIN_VALUE ;
int [ ] var_2 = new int [ 2 ] ;
var_2 [ 0 ] = 0 ;
for ( int var_3 = 1 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 % 2 ] = var_0 [ var_3 - 1 ] + ( var_2 [ ( var_3 - 1 ) % 2 ] >= 0 ? var_2 [ ( var_3 - 1 ) % 2 ] : 0 ) ;
max = Math . max ( max , var_2 [ var_3 % 2 ] ) ;
}
return max ;
}
| 3 | 0<SEP>1<SEP>2 |
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) {
if (history.get(i)) {
continue;
}
int temp = i;
int total = 1;
while (history.containsKey(temp + 1)) {
total++;
temp++;
history.put(temp, true);
}
temp = i;
while (history.containsKey(temp - 1)) {
total++;
temp--;
history.put(temp, true);
}
maxL = Math.max(maxL, total);
}
return maxL;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = 1 ;
HashMap < Integer , Boolean > var_2 = new HashMap < Integer , Boolean > ( ) ;
for ( int var_3 : var_0 ) {
var_2 . put ( var_3 , false ) ;
}
for ( int var_3 : var_0 ) {
if ( var_2 . get ( var_3 ) ) {
continue ;
}
int var_4 = var_3 ;
int var_5 = 1 ;
while ( var_2 . containsKey ( var_4 + 1 ) ) {
var_5 ++ ;
var_4 ++ ;
var_2 . put ( var_4 , true ) ;
}
var_4 = var_3 ;
while ( var_2 . containsKey ( var_4 - 1 ) ) {
var_5 ++ ;
var_4 -- ;
var_2 . put ( var_4 , true ) ;
}
var_1 = Math . max ( var_1 , var_5 ) ;
}
return var_1 ;
}
| 2 | 0<SEP>1 |
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(numbers);
int start = 0;
int end = numbers.length - 1;
int num1 = -1;
int num2 = -1;
while (start != end) {
int sum = numbers[start] + numbers[end];
if (sum == target) {
num1 = numbers[start];
num2 = numbers[end];
break;
}else if (sum < target) {
start++;
} else {
end--;
}
}
int[] rst = new int[2];
rst[0] = -1;
rst[1] = -1;
for (int i = 0; i < original.length; i++) {
if (original[i] == num1 || original[i] == num2) {
if (rst[0] == -1) {
rst[0] = i + 1;
} else {
rst[1] = i + 1;
break;
}
}
}
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return null ;
}
int [ ] var_2 = new int [ var_0 . length ] ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
var_2 [ var_3 ] = var_0 [ var_3 ] ;
}
Arrays . sort ( var_0 ) ;
int var_4 = 0 ;
int var_5 = var_0 . length - 1 ;
int var_6 = - 1 ;
int var_7 = - 1 ;
while ( var_4 != var_5 ) {
int var_8 = var_0 [ var_4 ] + var_0 [ var_5 ] ;
if ( var_8 == var_1 ) {
var_6 = var_0 [ var_4 ] ;
var_7 = var_0 [ var_5 ] ;
break ;
}
else if ( var_8 < var_1 ) {
var_4 ++ ;
}
else {
var_5 -- ;
}
}
int [ ] var_9 = new int [ 2 ] ;
var_9 [ 0 ] = - 1 ;
var_9 [ 1 ] = - 1 ;
for ( int var_3 = 0 ;
var_3 < var_2 . length ;
var_3 ++ ) {
if ( var_2 [ var_3 ] == var_6 || var_2 [ var_3 ] == var_7 ) {
if ( var_9 [ 0 ] == - 1 ) {
var_9 [ 0 ] = var_3 + 1 ;
}
else {
var_9 [ 1 ] = var_3 + 1 ;
break ;
}
}
}
return var_9 ;
}
| 3 | 2<SEP>0<SEP>1 |
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]);
}
return dp[n % 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_2 = new int [ 3 ] ;
var_2 [ 0 ] = 0 ;
var_2 [ 1 ] = var_1 ;
var_2 [ 2 ] = var_1 + var_1 * ( var_1 - 1 ) ;
for ( int var_3 = 3 ;
var_3 <= var_0 ;
var_3 ++ ) {
var_2 [ var_3 % 3 ] = ( var_1 - 1 ) * ( var_2 [ ( var_3 - 1 ) % 3 ] + var_2 [ ( var_3 - 2 ) % 3 ] ) ;
}
return var_2 [ var_0 % 3 ] ;
}
| 4 | 2<SEP>1<SEP>0<SEP>3 |
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);
Integer lower = treeSet.lower(num);
Integer higher = treeSet.higher(num);
if (higher != null && higher - num == k + 1 ) {
return i + 1;
}
if (lower != null && num - lower == k + 1) {
return i + 1;
}
}
return -1;
} | 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_2 = new TreeSet < > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
int var_4 = var_0 [ var_3 ] ;
var_2 . add ( var_4 ) ;
Integer lower = var_2 . lower ( var_4 ) ;
Integer higher = var_2 . higher ( var_4 ) ;
if ( higher != null && higher - var_4 == var_1 + 1 ) {
return var_3 + 1 ;
}
if ( lower != null && var_4 - lower == var_1 + 1 ) {
return var_3 + 1 ;
}
}
return - 1 ;
}
| 2 | 0<SEP>1 |
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;
}
while (index <= range) {
maxRange = Math.max(maxRange, index + nums[index]);
index++;
}
range = maxRange;
step++;
}
return step;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) {
return 0 ;
}
int var_1 = 0 ;
int var_2 = 0 ;
int var_3 = 0 ;
int var_4 = 0 ;
while ( var_1 < var_0 . length ) {
if ( var_3 >= var_0 . length - 1 ) {
break ;
}
while ( var_1 <= var_3 ) {
var_4 = Math . max ( var_4 , var_1 + var_0 [ var_1 ] ) ;
var_1 ++ ;
}
var_3 = var_4 ;
var_2 ++ ;
}
return var_2 ;
}
| 2 | 1<SEP>0 |
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) {
if (nums[i] + nums[j] + nums[k] >= target) {
k--;
} else {
rst += (k - j);
j++;
}
}
}
return rst;
} | 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_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length - 2 ;
var_3 ++ ) {
int var_4 = var_3 + 1 ;
int var_5 = var_0 . length - 1 ;
while ( var_4 < var_5 ) {
if ( var_0 [ var_3 ] + var_0 [ var_4 ] + var_0 [ var_5 ] >= var_1 ) {
var_5 -- ;
}
else {
var_2 += ( var_5 - var_4 ) ;
var_4 ++ ;
}
}
}
return var_2 ;
}
| 3 | 0<SEP>1<SEP>2 |
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_1 , int var_2 ) {
int var_3 = ( var_1 . charAt ( var_2 - 1 ) - '0' ) * 10 + ( var_1 . charAt ( var_2 ) - '0' ) ;
return var_3 <= 26 && var_3 >= 10 ;
}
| 4 | 10<SEP>1<SEP>26<SEP><S_QUOTE>0<S_QUOTE> |
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_1 = var_0 . length , var_2 = var_0 [ 0 ] . length ;
int var_3 = 0 ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
var_3 += var_0 [ var_4 ] [ var_5 ] == '1' ? 1 : 0 ;
}
}
return var_3 ;
}
| 3 | 0<SEP><S_QUOTE>1<S_QUOTE><SEP>1 |
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 ;
}
| 1 | 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++) {
if (counts[i] > 0) pq.offer(counts[i]);
}
int count = 0;
while (!pq.isEmpty()) {
int k = n + 1;
List<Integer> list = new ArrayList<>();
while (k > 0 && !pq.isEmpty()) {
Integer taskCount = pq.poll();
if (taskCount-- > 1) list.add(taskCount);
count++;
k--;
}
pq.addAll(list);
if (pq.isEmpty()) break;
count += k;
}
return count;
} | public int sample_funcname ( char [ ] var_0 , int var_1 ) {
if ( var_0 == null ) return 0 ;
PriorityQueue < Integer > var_2 = new PriorityQueue < > ( 26 , Collections . reverseOrder ( ) ) ;
int [ ] var_3 = new int [ 26 ] ;
for ( char var_4 : var_0 ) var_3 [ var_4 - 'A' ] ++ ;
for ( int var_5 = 0 ;
var_5 < var_3 . length ;
var_5 ++ ) {
if ( var_3 [ var_5 ] > 0 ) var_2 . offer ( var_3 [ var_5 ] ) ;
}
int var_6 = 0 ;
while ( ! var_2 . isEmpty ( ) ) {
int var_7 = var_1 + 1 ;
List < Integer > var_8 = new ArrayList < > ( ) ;
while ( var_7 > 0 && ! var_2 . isEmpty ( ) ) {
Integer var_9 = var_2 . poll ( ) ;
if ( var_9 -- > 1 ) var_8 . add ( var_9 ) ;
var_6 ++ ;
var_7 -- ;
}
var_2 . addAll ( var_8 ) ;
if ( var_2 . isEmpty ( ) ) break ;
var_6 += var_7 ;
}
return var_6 ;
}
| 4 | 0<SEP>26<SEP>1<SEP><S_QUOTE>A<S_QUOTE> |
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 = 0; j < n; j++) {
if (i == 0 && j == 0) {
dp[i % 2][j] = grid[i][j];
continue;
}
int fromUp = i == 0 ? Integer.MAX_VALUE : dp[(i - 1) % 2][j];
int fromLeft = j == 0 ? Integer.MAX_VALUE : dp[i % 2][j - 1];
dp[i % 2][j] = Math.min(fromUp, fromLeft) + grid[i][j];
}
}
return dp[(m - 1) % 2][n - 1];
} | 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_1 = var_0 . length ;
int var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ 2 ] [ var_2 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
if ( var_4 == 0 && var_5 == 0 ) {
var_3 [ var_4 % 2 ] [ var_5 ] = var_0 [ var_4 ] [ var_5 ] ;
continue ;
}
int var_6 = var_4 == 0 ? Integer . MAX_VALUE : var_3 [ ( var_4 - 1 ) % 2 ] [ var_5 ] ;
int var_7 = var_5 == 0 ? Integer . MAX_VALUE : var_3 [ var_4 % 2 ] [ var_5 - 1 ] ;
var_3 [ var_4 % 2 ] [ var_5 ] = Math . min ( var_6 , var_7 ) + var_0 [ var_4 ] [ var_5 ] ;
}
}
return var_3 [ ( var_1 - 1 ) % 2 ] [ var_2 - 1 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
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_0 ) {
int [ ] var_1 = new int [ var_0 . size ( ) ] ;
for ( int var_2 = 0 ;
var_2 < var_0 . size ( ) ;
var_2 ++ ) {
var_1 [ var_2 ] = var_0 . get ( var_2 ) ;
}
return var_1 ;
}
| 1 | 0 |
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 ;
}
| 1 | 0 |
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];
int[][] right = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] != 'W') {
up[i][j] = grid[i][j] == 'E' ? 1 : 0;
up[i][j] += i - 1 >= 0 ? up[i - 1][j] : 0;
}
}
}
for (int i = m - 1; i >= 0; i--) {
for (int j = 0; j < n; j++) {
if (grid[i][j] != 'W') {
down[i][j] = grid[i][j] == 'E' ? 1 : 0;
down[i][j] += i + 1 < m ? down[i + 1][j] : 0;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] != 'W') {
left[i][j] = grid[i][j] == 'E' ? 1 : 0;
left[i][j] += j - 1 >= 0 ? left[i][j - 1] : 0;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = n - 1; j >= 0; j--) {
if (grid[i][j] != 'W') {
right[i][j] = grid[i][j] == 'E' ? 1 : 0;
right[i][j] += j + 1 < n ? right[i][j + 1] : 0;
}
}
}
int max = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == '0') {
max = Math.max(max, up[i][j] + down[i][j] + left[i][j] + right[i][j]);
}
}
}
return max;
} | public int sample_funcname ( char [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] . length == 0 ) {
return 0 ;
}
int var_1 = var_0 . length ;
int var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 ] [ var_2 ] ;
int [ ] [ ] var_4 = new int [ var_1 ] [ var_2 ] ;
int [ ] [ ] var_5 = new int [ var_1 ] [ var_2 ] ;
int [ ] [ ] var_6 = new int [ var_1 ] [ var_2 ] ;
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
if ( var_0 [ var_7 ] [ var_8 ] != 'W' ) {
var_3 [ var_7 ] [ var_8 ] = var_0 [ var_7 ] [ var_8 ] == 'E' ? 1 : 0 ;
var_3 [ var_7 ] [ var_8 ] += var_7 - 1 >= 0 ? var_3 [ var_7 - 1 ] [ var_8 ] : 0 ;
}
}
}
for ( int var_7 = var_1 - 1 ;
var_7 >= 0 ;
var_7 -- ) {
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
if ( var_0 [ var_7 ] [ var_8 ] != 'W' ) {
var_4 [ var_7 ] [ var_8 ] = var_0 [ var_7 ] [ var_8 ] == 'E' ? 1 : 0 ;
var_4 [ var_7 ] [ var_8 ] += var_7 + 1 < var_1 ? var_4 [ var_7 + 1 ] [ var_8 ] : 0 ;
}
}
}
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
if ( var_0 [ var_7 ] [ var_8 ] != 'W' ) {
var_5 [ var_7 ] [ var_8 ] = var_0 [ var_7 ] [ var_8 ] == 'E' ? 1 : 0 ;
var_5 [ var_7 ] [ var_8 ] += var_8 - 1 >= 0 ? var_5 [ var_7 ] [ var_8 - 1 ] : 0 ;
}
}
}
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
for ( int var_8 = var_2 - 1 ;
var_8 >= 0 ;
var_8 -- ) {
if ( var_0 [ var_7 ] [ var_8 ] != 'W' ) {
var_6 [ var_7 ] [ var_8 ] = var_0 [ var_7 ] [ var_8 ] == 'E' ? 1 : 0 ;
var_6 [ var_7 ] [ var_8 ] += var_8 + 1 < var_2 ? var_6 [ var_7 ] [ var_8 + 1 ] : 0 ;
}
}
}
int max = 0 ;
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
if ( var_0 [ var_7 ] [ var_8 ] == '0' ) {
max = Math . max ( max , var_3 [ var_7 ] [ var_8 ] + var_4 [ var_7 ] [ var_8 ] + var_5 [ var_7 ] [ var_8 ] + var_6 [ var_7 ] [ var_8 ] ) ;
}
}
}
return max ;
}
| 5 | 0<SEP>1<SEP><S_QUOTE>E<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP><S_QUOTE>W<S_QUOTE> |
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 <= n; j++) {
if (i == 0 || j == 0) {
dp[i][j] = 0;
continue;
}
if (A.charAt(i - 1) == B.charAt(j - 1)) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = 0;
}
max = Math.max(max, dp[i][j]);
}
}
return max;
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_0 == null || var_1 == null || var_0 . length ( ) == 0 || var_1 . length ( ) == 0 ) {
return 0 ;
}
int var_2 = var_0 . length ( ) ;
int var_3 = var_1 . length ( ) ;
int [ ] [ ] var_4 = new int [ var_2 + 1 ] [ var_3 + 1 ] ;
int max = 0 ;
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 <= var_3 ;
var_6 ++ ) {
if ( var_5 == 0 || var_6 == 0 ) {
var_4 [ var_5 ] [ var_6 ] = 0 ;
continue ;
}
if ( var_0 . charAt ( var_5 - 1 ) == var_1 . charAt ( var_6 - 1 ) ) {
var_4 [ var_5 ] [ var_6 ] = var_4 [ var_5 - 1 ] [ var_6 - 1 ] + 1 ;
}
else {
var_4 [ var_5 ] [ var_6 ] = 0 ;
}
max = Math . max ( max , var_4 [ var_5 ] [ var_6 ] ) ;
}
}
return max ;
}
| 2 | 0<SEP>1 |
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] >= 0) {
dp[i % 2][j] = Math.max(dp[i % 2][j], dp[(i - 1) % 2][j - A[i - 1]] + A[i - 1]);
}
}
}
return dp[n % 2][m];
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length < 0 ) {
return 0 ;
}
int var_2 = var_1 . length ;
int [ ] [ ] var_3 = new int [ 2 ] [ var_0 + 1 ] ;
for ( int var_4 = 1 ;
var_4 <= var_2 ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 <= var_0 ;
var_5 ++ ) {
var_3 [ var_4 % 2 ] [ var_5 ] = var_3 [ ( var_4 - 1 ) % 2 ] [ var_5 ] ;
if ( var_5 - var_1 [ var_4 - 1 ] >= 0 ) {
var_3 [ var_4 % 2 ] [ var_5 ] = Math . max ( var_3 [ var_4 % 2 ] [ var_5 ] , var_3 [ ( var_4 - 1 ) % 2 ] [ var_5 - var_1 [ var_4 - 1 ] ] + var_1 [ var_4 - 1 ] ) ;
}
}
}
return var_3 [ var_2 % 2 ] [ var_0 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
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();
continue;
}
stack.push(s);
}
StringBuffer sb = new StringBuffer();
while (!stack.isEmpty()) sb.insert(0, "/" + stack.pop());
if (sb.length() == 0) sb.append("/");
return sb.toString();
} | public String var_0 ( String var_1 ) {
Stack < String > var_2 = new Stack < > ( ) ;
String [ ] var_3 = var_1 . split ( "/" ) ;
for ( String var_4 : var_3 ) {
if ( var_4 . isEmpty ( ) || var_4 . equals ( "." ) ) continue ;
if ( var_4 . equals ( ".." ) ) {
if ( ! var_2 . isEmpty ( ) ) var_2 . pop ( ) ;
continue ;
}
var_2 . push ( var_4 ) ;
}
StringBuffer var_5 = new StringBuffer ( ) ;
while ( ! var_2 . isEmpty ( ) ) var_5 . insert ( 0 , "/" + var_2 . pop ( ) ) ;
if ( var_5 . length ( ) == 0 ) var_5 . append ( "/" ) ;
return var_5 . toString ( ) ;
}
| 4 | <D_QUOTE>.<D_QUOTE><SEP><D_QUOTE>/<D_QUOTE><SEP><D_QUOTE>..<D_QUOTE><SEP>0 |
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][0] = A[0];
for (int i = 0; i < n; i++) {
sum[i][i] = A[i];
for (int j = i + 1; j < n; j++) {
sum[i][j] = sum[i][j - 1] + A[j];
}
}
for (int delta = 1; delta < n; delta++) {
for (int start = 0; start < n - delta; start++) {
int end = start + delta;
f[start][end] = Integer.MAX_VALUE;
for (int k = start; k < end; k++) {
f[start][end] = Math.min(f[start][end], f[start][k] + f[k + 1][end] + sum[start][end]);
}
}
}
return f[0][n - 1];
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = var_0 . length ;
int [ ] [ ] var_2 = new int [ var_1 ] [ var_1 ] ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] [ var_3 ] = 0 ;
}
int [ ] [ ] var_4 = new int [ var_1 ] [ var_1 ] ;
var_4 [ 0 ] [ 0 ] = var_0 [ 0 ] ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) {
var_4 [ var_3 ] [ var_3 ] = var_0 [ var_3 ] ;
for ( int var_5 = var_3 + 1 ;
var_5 < var_1 ;
var_5 ++ ) {
var_4 [ var_3 ] [ var_5 ] = var_4 [ var_3 ] [ var_5 - 1 ] + var_0 [ var_5 ] ;
}
}
for ( int var_6 = 1 ;
var_6 < var_1 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 < var_1 - var_6 ;
var_7 ++ ) {
int var_8 = var_7 + var_6 ;
var_2 [ var_7 ] [ var_8 ] = Integer . MAX_VALUE ;
for ( int var_9 = var_7 ;
var_9 < var_8 ;
var_9 ++ ) {
var_2 [ var_7 ] [ var_8 ] = Math . min ( var_2 [ var_7 ] [ var_8 ] , var_2 [ var_7 ] [ var_9 ] + var_2 [ var_9 + 1 ] [ var_8 ] + var_4 [ var_7 ] [ var_8 ] ) ;
}
}
}
return var_2 [ 0 ] [ var_1 - 1 ] ;
}
| 2 | 0<SEP>1 |
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]) {
end--;
} else if (nums[mid] > nums[end]) {
start = mid;
} else {
end = mid;
}
}
return nums[start] < nums[end] ? nums[start] : nums[end];
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = var_0 . length ;
int var_2 = 0 ;
int var_3 = var_1 - 1 ;
while ( var_2 + 1 < var_3 ) {
int var_4 = ( var_2 + var_3 ) >> 1 ;
if ( var_0 [ var_4 ] == var_0 [ var_3 ] ) {
var_3 -- ;
}
else if ( var_0 [ var_4 ] > var_0 [ var_3 ] ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
return var_0 [ var_2 ] < var_0 [ var_3 ] ? var_0 [ var_2 ] : var_0 [ var_3 ] ;
}
| 2 | 0<SEP>1 |
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 ;
}
| 6 | <S_QUOTE>}<S_QUOTE><SEP><S_QUOTE>[<S_QUOTE><SEP><S_QUOTE>]<S_QUOTE><SEP><S_QUOTE>)<S_QUOTE><SEP><S_QUOTE>(<S_QUOTE><SEP><S_QUOTE>{<S_QUOTE> |
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_1 ) {
var_1 . remove ( var_1 . size ( ) - 1 ) ;
var_1 . remove ( var_1 . size ( ) - 1 ) ;
}
| 1 | 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_2 -> var_2 [ 0 ] ) ) ;
for ( int var_2 = 0 ;
var_2 < var_1 . length - 1 ;
var_2 ++ ) {
if ( var_1 [ var_2 ] [ 1 ] > var_1 [ var_2 + 1 ] [ 0 ] ) return false ;
}
return true ;
}
| 2 | 0<SEP>1 |
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) {
str = "0";
}
rst.add(Integer.parseInt(str, 2));
int step = n - 1;
boolean LR = true;
int steps = (int)Math.pow(2, n) - 1;
for (int i = 0; i < steps; i++) {
bits[step] = bits[step] == '0' ? '1' : '0';
str = new String(bits);
rst.add(Integer.parseInt(str, 2));
if (LR) {
step--;
} else {
step++;
}
if (step == (n - 1) || step == 0) {
LR = !LR;
}
}
return rst;
} | public List < Integer > var_0 ( int var_1 ) {
List < Integer > var_2 = new ArrayList < Integer > ( ) ;
if ( var_1 < 0 ) {
return var_2 ;
}
char [ ] var_3 = new char [ var_1 ] ;
for ( int var_4 = 0 ;
var_4 < var_3 . length ;
var_4 ++ ) {
var_3 [ var_4 ] = '0' ;
}
String var_5 = new String ( var_3 ) ;
if ( var_1 == 0 ) {
var_5 = "0" ;
}
var_2 . add ( Integer . parseInt ( var_5 , 2 ) ) ;
int var_6 = var_1 - 1 ;
boolean var_8 = true ;
int var_7 = ( int ) Math . pow ( 2 , var_1 ) - 1 ;
for ( int var_4 = 0 ;
var_4 < var_7 ;
var_4 ++ ) {
var_3 [ var_6 ] = var_3 [ var_6 ] == '0' ? '1' : '0' ;
var_5 = new String ( var_3 ) ;
var_2 . add ( Integer . parseInt ( var_5 , 2 ) ) ;
if ( var_8 ) {
var_6 -- ;
}
else {
var_6 ++ ;
}
if ( var_6 == ( var_1 - 1 ) || var_6 == 0 ) {
var_8 = ! var_8 ;
}
}
return var_2 ;
}
| 6 | 2<SEP>0<SEP>1<SEP><D_QUOTE>0<D_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP><S_QUOTE>1<S_QUOTE> |
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_2 = new StringBuffer ( ) ;
for ( int var_3 : var_1 ) {
var_2 . append ( var_3 + "#" ) ;
}
return var_2 . toString ( ) ;
}
| 1 | <D_QUOTE>#<D_QUOTE> |
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++) {
if (i < s1.length() || j < s2.length()) {
if (i < s1.length() && s3.indexOf(base + s1.charAt(i)) == 0) {
base += s1.charAt(i);
i++;
} else if (j < s2.length() && s3.indexOf(base + s2.charAt(j)) == 0) {
base += s2.charAt(j);
j++;
} else {
return false;
}
}
}
return true;
} | public boolean var_0 ( String var_1 , String var_2 , String var_3 ) {
if ( var_3 == null || ( var_1 == null && var_2 == null ) || var_1 . length ( ) + var_2 . length ( ) != var_3 . length ( ) ) {
return false ;
}
int var_4 = 0 ;
int var_5 = 0 ;
String var_6 = "" ;
for ( int var_7 = 0 ;
var_7 < var_1 . length ( ) * var_2 . length ( ) - 1 ;
var_7 ++ ) {
if ( var_4 < var_1 . length ( ) || var_5 < var_2 . length ( ) ) {
if ( var_4 < var_1 . length ( ) && var_3 . indexOf ( var_6 + var_1 . charAt ( var_4 ) ) == 0 ) {
var_6 += var_1 . charAt ( var_4 ) ;
var_4 ++ ;
}
else if ( var_5 < var_2 . length ( ) && var_3 . indexOf ( var_6 + var_2 . charAt ( var_5 ) ) == 0 ) {
var_6 += var_2 . charAt ( var_5 ) ;
var_5 ++ ;
}
else {
return false ;
}
}
}
return true ;
}
| 3 | 0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
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_3 = 0 ;
var_3 < 256 ;
var_3 ++ ) {
if ( var_1 [ var_3 ] < var_2 [ var_3 ] ) return false ;
}
return true ;
}
| 2 | 0<SEP>256 |
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 ;
}
| 0 | null |
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_2 = new StringBuffer ( ) ;
int var_3 = 0 ;
for ( char var_4 : var_1 ) {
var_3 += var_4 == ' ' ? 1 : 0 ;
if ( var_3 != 0 & var_4 != ' ' ) var_3 = 0 ;
if ( var_3 <= 1 ) var_2 . append ( var_4 ) ;
}
return var_2 . toString ( ) . trim ( ) ;
}
| 3 | 0<SEP><S_QUOTE> <S_QUOTE><SEP>1 |
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_2 = 0 ;
for ( int var_3 : var_0 ) {
var_2 += Math . ceil ( var_3 / var_1 ) ;
}
return var_2 ;
}
| 1 | 0 |
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 ;
}
| 2 | 0<SEP>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;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
for (int k = 0; k * A[i - 1] <= m; k++) {
if (j - k * A[i - 1] >= 0 && dp[i - 1][j - k * A[i - 1]] != -1) {
dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - k * A[i - 1]] + k * V[i - 1]);
}
}
}
}
int rst = 0;
for (int j = 0; j <= m; j++) {
rst = Math.max(rst, dp[n][j]);
}
return rst;
} | 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_3 = var_0 . length ;
int [ ] [ ] var_4 = new int [ var_3 + 1 ] [ var_2 + 1 ] ;
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
var_4 [ 0 ] [ var_5 ] = - 1 ;
}
var_4 [ 0 ] [ 0 ] = 0 ;
for ( int var_6 = 1 ;
var_6 <= var_3 ;
var_6 ++ ) {
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_7 = 0 ;
var_7 * var_0 [ var_6 - 1 ] <= var_2 ;
var_7 ++ ) {
if ( var_5 - var_7 * var_0 [ var_6 - 1 ] >= 0 && var_4 [ var_6 - 1 ] [ var_5 - var_7 * var_0 [ var_6 - 1 ] ] != - 1 ) {
var_4 [ var_6 ] [ var_5 ] = Math . max ( var_4 [ var_6 ] [ var_5 ] , var_4 [ var_6 - 1 ] [ var_5 - var_7 * var_0 [ var_6 - 1 ] ] + var_7 * var_1 [ var_6 - 1 ] ) ;
}
}
}
}
int var_8 = 0 ;
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
var_8 = Math . max ( var_8 , var_4 [ var_3 ] [ var_5 ] ) ;
}
return var_8 ;
}
| 2 | 0<SEP>1 |
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();
int[][] dp = new int[2][n + 1];
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0) {
dp[i % 2][j] = j;
continue;
}
if (j == 0) {
dp[i % 2][j] = i;
continue;
}
dp[i % 2][j] = Math.min(dp[(i - 1) % 2][j - 1], Math.min(dp[i % 2][j - 1], dp[(i - 1) % 2][j])) + 1;
if (word.charAt(i - 1) == target.charAt(j - 1)) {
dp[i % 2][j] = Math.min(dp[i % 2][j], dp[(i - 1) % 2][j - 1]);
}
}
}
return dp[m % 2][n] <= k;
} | private boolean var_0 ( String var_1 , String var_2 , int var_3 ) {
if ( var_1 . equals ( var_2 ) ) {
return true ;
}
if ( Math . abs ( var_1 . length ( ) - var_2 . length ( ) ) > var_3 ) {
return false ;
}
int var_4 = var_1 . length ( ) ;
int var_5 = var_2 . length ( ) ;
int [ ] [ ] var_6 = new int [ 2 ] [ var_5 + 1 ] ;
for ( int var_7 = 0 ;
var_7 <= var_4 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 <= var_5 ;
var_8 ++ ) {
if ( var_7 == 0 ) {
var_6 [ var_7 % 2 ] [ var_8 ] = var_8 ;
continue ;
}
if ( var_8 == 0 ) {
var_6 [ var_7 % 2 ] [ var_8 ] = var_7 ;
continue ;
}
var_6 [ var_7 % 2 ] [ var_8 ] = Math . min ( var_6 [ ( var_7 - 1 ) % 2 ] [ var_8 - 1 ] , Math . min ( var_6 [ var_7 % 2 ] [ var_8 - 1 ] , var_6 [ ( var_7 - 1 ) % 2 ] [ var_8 ] ) ) + 1 ;
if ( var_1 . charAt ( var_7 - 1 ) == var_2 . charAt ( var_8 - 1 ) ) {
var_6 [ var_7 % 2 ] [ var_8 ] = Math . min ( var_6 [ var_7 % 2 ] [ var_8 ] , var_6 [ ( var_7 - 1 ) % 2 ] [ var_8 - 1 ] ) ;
}
}
}
return var_6 [ var_4 % 2 ] [ var_5 ] <= var_3 ;
}
| 3 | 1<SEP>0<SEP>2 |
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_0 ( int [ ] var_1 ) {
Map < Integer , Integer > var_2 = new HashMap < > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) var_2 . put ( var_1 [ var_3 ] , var_3 ) ;
return var_2 ;
}
| 1 | 0 |
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_1 ) {
if ( var_1 . size ( ) == 0 ) {
return "" ;
}
StringBuffer var_2 = new StringBuffer ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . size ( ) ;
var_3 ++ ) {
var_2 . append ( var_1 . get ( var_3 ) . length ( ) + "#" + var_1 . get ( var_3 ) ) ;
}
return var_2 . toString ( ) ;
}
| 3 | <D_QUOTE>#<D_QUOTE><SEP>0<SEP><D_QUOTE><D_QUOTE> |
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];
}
}
return count[n];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
int [ ] var_1 = new int [ var_0 + 1 ] ;
var_1 [ 0 ] = 1 ;
var_1 [ 1 ] = 1 ;
for ( int var_2 = 2 ;
var_2 < var_0 + 1 ;
var_2 ++ ) {
for ( int var_3 = 0 ;
var_3 < var_2 ;
var_3 ++ ) {
var_1 [ var_2 ] += var_1 [ var_3 ] * var_1 [ var_2 - var_3 - 1 ] ;
}
}
return var_1 [ var_0 ] ;
}
| 3 | 1<SEP>0<SEP>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_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) return true ;
char [ ] var_2 = var_1 . toCharArray ( ) ;
Arrays . sort ( var_2 ) ;
for ( int var_3 = 1 ;
var_3 < var_2 . length ;
var_3 ++ ) {
if ( var_2 [ var_3 ] == var_2 [ var_3 - 1 ] ) return false ;
}
return true ;
}
| 2 | 0<SEP>1 |
Subsets and Splits