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
⌀ |
|---|---|---|---|---|---|
516 | <awangdev>1267. Count Servers that Communicate_2.java | private int dfs(int[][] grid, int i, int j, boolean[][] visited) {
if (visited[i][j] || grid[i][j] == 0) return 0;
visited[i][j] = true;
int count = 1;
for (int x = 0; x < grid.length; x++) {
count += dfs(grid, x, j, visited);
}
for (int y = 0; y < grid[0].length; y++) {
count += dfs(grid, i, y, visited);
}
return count;
} | private int sample_funcname ( int [ ] [ ] grid , int i , int j , boolean [ ] [ ] visited ) {
if ( visited [ i ] [ j ] || grid [ i ] [ j ] == 0 ) return 0 ;
visited [ i ] [ j ] = true ;
int count = 1 ;
for ( int x = 0 ;
x < grid . length ;
x ++ ) {
count += dfs ( grid , x , j , visited ) ;
}
for ( int y = 0 ;
y < grid [ 0 ] . length ;
y ++ ) {
count += dfs ( grid , i , y , visited ) ;
}
return count ;
}
| 2 | 0<SEP>1 |
517 | <awangdev>Maximum Subarray II_3.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]);
int j = n - i;
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 ] ) ;
int var_7 = var_1 - var_6 ;
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 |
518 | <awangdev>[lint]. 2 Sum II_1.java | public int twoSum2(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return 0;
}
int count = 0;
int left = 0;
int right = nums.length - 1;
Arrays.sort(nums);
while (left < right) {
if (nums[left] + nums[right] > target) {
count += (right - left);
right--;
} else {
left++;
}
}
return count;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_2 = 0 ;
int var_3 = 0 ;
int var_4 = var_0 . length - 1 ;
Arrays . sort ( var_0 ) ;
while ( var_3 < var_4 ) {
if ( var_0 [ var_3 ] + var_0 [ var_4 ] > var_1 ) {
var_2 += ( var_4 - var_3 ) ;
var_4 -- ;
}
else {
var_3 ++ ;
}
}
return var_2 ;
}
| 2 | 0<SEP>1 |
519 | <awangdev>Best Time to Buy and Sell Stock IV_2.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];
dp[0][0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j < statusLength; j++) {
if (j % 2 == 0) {
dp[i % 2][j] = Math.max(dp[(i - 1) % 2][j], dp[(i - 1) % 2][j - 1] + prices[i] - prices[i - 1]);
profit = Math.max(profit, dp[i % 2][j]);
} else {
dp[i % 2][j] = Math.max(dp[(i - 1) % 2][j] + prices[i] - prices[i - 1], dp[(i - 1) % 2][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 ] ;
var_6 [ 0 ] [ 0 ] = 0 ;
for ( int var_5 = 1 ;
var_5 < var_3 ;
var_5 ++ ) {
for ( int var_7 = 1 ;
var_7 < var_4 ;
var_7 ++ ) {
if ( var_7 % 2 == 0 ) {
var_6 [ var_5 % 2 ] [ var_7 ] = Math . max ( var_6 [ ( var_5 - 1 ) % 2 ] [ var_7 ] , var_6 [ ( var_5 - 1 ) % 2 ] [ var_7 - 1 ] + var_1 [ var_5 ] - var_1 [ var_5 - 1 ] ) ;
var_2 = Math . max ( var_2 , var_6 [ var_5 % 2 ] [ var_7 ] ) ;
}
else {
var_6 [ var_5 % 2 ] [ var_7 ] = Math . max ( var_6 [ ( var_5 - 1 ) % 2 ] [ var_7 ] + var_1 [ var_5 ] - var_1 [ var_5 - 1 ] , var_6 [ ( var_5 - 1 ) % 2 ] [ var_7 - 1 ] ) ;
}
}
}
return var_2 ;
}
| 3 | 0<SEP>1<SEP>2 |
520 | <awangdev>Palindrome Pairs_1.java | private boolean isPalindrome(String word) {
if (word.length() == 1) {
return true;
}
int start = 0;
int end = word.length() - 1;
while (start < end) {
if (word.charAt(start) != word.charAt(end)) {
return false;
}
start++;
end--;
}
return true;
} | private boolean var_0 ( String var_1 ) {
if ( var_1 . length ( ) == 1 ) {
return true ;
}
int var_2 = 0 ;
int var_3 = var_1 . length ( ) - 1 ;
while ( var_2 < var_3 ) {
if ( var_1 . charAt ( var_2 ) != var_1 . charAt ( var_3 ) ) {
return false ;
}
var_2 ++ ;
var_3 -- ;
}
return true ;
}
| 2 | 1<SEP>0 |
521 | <awangdev>72. Edit Distance_1.java | public int minDistance(String word1, String word2) {
if (word1 == null && word2 == null) return 0;
if (word1 == null || word2 == null) return word1 == null ? word2.length() : word1.length();
int m = word1.length(), n = word2.length();
int[][] dp = new int[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0) {
dp[i][j] = j;
continue;
}
if (j == 0) {
dp[i][j] = i;
continue;
}
if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
dp[i][j] = dp[i - 1][j - 1];
} else {
dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1;
}
}
}
return dp[m][n];
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_0 == null && var_1 == null ) return 0 ;
if ( var_0 == null || var_1 == null ) return var_0 == null ? var_1 . length ( ) : var_0 . length ( ) ;
int var_2 = var_0 . length ( ) , var_3 = var_1 . length ( ) ;
int [ ] [ ] var_4 = new int [ var_2 + 1 ] [ var_3 + 1 ] ;
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_4 [ var_5 ] [ var_6 ] = var_6 ;
continue ;
}
if ( var_6 == 0 ) {
var_4 [ var_5 ] [ var_6 ] = var_5 ;
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 ] ;
}
else {
var_4 [ var_5 ] [ var_6 ] = Math . min ( var_4 [ var_5 - 1 ] [ var_6 - 1 ] , Math . min ( var_4 [ var_5 ] [ var_6 - 1 ] , var_4 [ var_5 - 1 ] [ var_6 ] ) ) + 1 ;
}
}
}
return var_4 [ var_2 ] [ var_3 ] ;
}
| 2 | 0<SEP>1 |
522 | <awangdev>Search a 2D Matrix II_1.java | public boolean searchMatrix(int[][] matrix, int target) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return false;
}
int row = matrix.length;
int col = matrix[0].length;
int x = row - 1;
int y = 0;
while (x >= 0 && y < col) {
if (matrix[x][y] < target) {
y++;
} else if (matrix[x][y] > target) {
x--;
} else {
return true;
}
}
return false;
} | public boolean var_0 ( int [ ] [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 || var_1 [ 0 ] . length == 0 ) {
return false ;
}
int var_3 = var_1 . length ;
int var_4 = var_1 [ 0 ] . length ;
int var_5 = var_3 - 1 ;
int var_6 = 0 ;
while ( var_5 >= 0 && var_6 < var_4 ) {
if ( var_1 [ var_5 ] [ var_6 ] < var_2 ) {
var_6 ++ ;
}
else if ( var_1 [ var_5 ] [ var_6 ] > var_2 ) {
var_5 -- ;
}
else {
return true ;
}
}
return false ;
}
| 2 | 0<SEP>1 |
523 | <awangdev>Copy Books_2.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[K + 1][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][i] = Integer.MAX_VALUE;
for (int j = i; j >= 0; j--) {
dp[k][i] = Math.min(dp[k][i], Math.max(dp[k - 1][j], sum));
if (j > 0) {
sum += pages[j - 1];
}
}
}
}
return dp[K][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 [ var_1 + 1 ] [ 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 ] [ var_4 ] = Integer . MAX_VALUE ;
for ( int var_7 = var_4 ;
var_7 >= 0 ;
var_7 -- ) {
var_3 [ var_5 ] [ var_4 ] = Math . min ( var_3 [ var_5 ] [ var_4 ] , Math . max ( var_3 [ var_5 - 1 ] [ var_7 ] , var_6 ) ) ;
if ( var_7 > 0 ) {
var_6 += var_0 [ var_7 - 1 ] ;
}
}
}
}
return var_3 [ var_1 ] [ var_2 ] ;
}
| 2 | 0<SEP>1 |
524 | <awangdev>House Robber II_5.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
} else if (nums.length == 1) {
return nums[0];
} else if (nums.length == 2) {
return Math.max(nums[0], nums[1]);
}
int n = nums.length;
int[] dp1 = new int[n];
dp1[0] = nums[0];
dp1[1] = Math.max(nums[0], nums[1]);
for (int i = 2; i < n - 1; i++) {
dp1[i] = Math.max(dp1[i - 1], dp1[i - 2] + nums[i]);
}
dp1[n - 1] = dp1[n - 2];
int[] dp2 = new int[n];
dp2[0] = 0;
dp2[1] = nums[1];
for (int i = 2; i < n - 2; i++) {
dp2[i] = Math.max(dp2[i - 1], dp2[i - 2] + nums[i]);
}
dp2[n - 1] = dp2[n - 3] + nums[n - 1];
return Math.max(dp2[n - 1], dp1[n - 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 ] ;
}
else if ( var_0 . length == 2 ) {
return Math . max ( var_0 [ 0 ] , var_0 [ 1 ] ) ;
}
int var_1 = var_0 . length ;
int [ ] var_2 = new int [ var_1 ] ;
var_2 [ 0 ] = var_0 [ 0 ] ;
var_2 [ 1 ] = Math . max ( var_0 [ 0 ] , var_0 [ 1 ] ) ;
for ( int var_3 = 2 ;
var_3 < var_1 - 1 ;
var_3 ++ ) {
var_2 [ var_3 ] = Math . max ( var_2 [ var_3 - 1 ] , var_2 [ var_3 - 2 ] + var_0 [ var_3 ] ) ;
}
var_2 [ var_1 - 1 ] = var_2 [ var_1 - 2 ] ;
int [ ] var_4 = new int [ var_1 ] ;
var_4 [ 0 ] = 0 ;
var_4 [ 1 ] = var_0 [ 1 ] ;
for ( int var_3 = 2 ;
var_3 < var_1 - 2 ;
var_3 ++ ) {
var_4 [ var_3 ] = Math . max ( var_4 [ var_3 - 1 ] , var_4 [ var_3 - 2 ] + var_0 [ var_3 ] ) ;
}
var_4 [ var_1 - 1 ] = var_4 [ var_1 - 3 ] + var_0 [ var_1 - 1 ] ;
return Math . max ( var_4 [ var_1 - 1 ] , var_2 [ var_1 - 1 ] ) ;
}
| 4 | 2<SEP>0<SEP>3<SEP>1 |
525 | <awangdev>Combinations_1.java | private void dfs(List<List<Integer>> result, List<Integer> list, int index, int k, int n) {
for (int i = index; i <= n; i++) {
list.add(i);
if (list.size() == k) {
result.add(new ArrayList<>(list));
list.remove(list.size() - 1);
continue;
}
dfs(result, list, i + 1, k, n);
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 <= n ;
i ++ ) {
list . add ( i ) ;
if ( list . size ( ) == k ) {
result . add ( new ArrayList < > ( list ) ) ;
list . remove ( list . size ( ) - 1 ) ;
continue ;
}
dfs ( result , list , i + 1 , k , n ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
| 1 | 1 |
526 | <awangdev>843. Guess the Word_2.java | private int countMatch(String a, String b) {
int count = 0;
for (int i = 0; i < 6; i++) {
if (a.charAt(i) == b.charAt(i)) count++;
}
return count;
} | private int sample_funcname ( String var_0 , String var_1 ) {
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < 6 ;
var_3 ++ ) {
if ( var_0 . charAt ( var_3 ) == var_1 . charAt ( var_3 ) ) var_2 ++ ;
}
return var_2 ;
}
| 2 | 0<SEP>6 |
527 | <awangdev>266. Palindrome Permutation_1.java | public boolean canPermutePalindrome(String s) {
if (s == null || s.length() == 0) return false;
int[] chars = new int[256];
for (char c : s.toCharArray()) chars[c]++;
int countOdd = 0;
for (int i = 0; i < chars.length; i++) {
countOdd += chars[i] % 2;
if (countOdd > 1) return false;
}
return true;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) return false ;
int [ ] var_2 = new int [ 256 ] ;
for ( char var_3 : var_1 . toCharArray ( ) ) var_2 [ var_3 ] ++ ;
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_2 . length ;
var_5 ++ ) {
var_4 += var_2 [ var_5 ] % 2 ;
if ( var_4 > 1 ) return false ;
}
return true ;
}
| 4 | 0<SEP>1<SEP>256<SEP>2 |
528 | <awangdev>257. Binary Tree Paths_1.java | private String convert(List<String> path) {
return String.join("->", path);
} | private String var_0 ( List < String > var_1 ) {
return String . join ( "->" , var_1 ) ;
}
| 1 | <D_QUOTE>-><D_QUOTE> |
529 | <awangdev>1170. Compare Strings by Frequency of the Smallest Character_1.java | private int count(String w) {
int[] count = new int[26];
for (char c : w.toCharArray()) count[c - 'a']++;
for (int num : count) {
if (num != 0) return num;
}
return 0;
} | private int sample_funcname ( String var_0 ) {
int [ ] var_1 = new int [ 26 ] ;
for ( char var_2 : var_0 . toCharArray ( ) ) var_1 [ var_2 - 'a' ] ++ ;
for ( int var_3 : var_1 ) {
if ( var_3 != 0 ) return var_3 ;
}
return 0 ;
}
| 3 | 0<SEP>26<SEP><S_QUOTE>a<S_QUOTE> |
530 | <awangdev>Unique Word Abbreviation_1.java | private String convertToAbbr(String word) {
if (word == null || word.length() <= 2) {
return word;
}
return word.charAt(0) + String.valueOf(word.length() - 2) + word.charAt(word.length() - 1);
} | private String var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) <= 2 ) {
return var_1 ;
}
return var_1 . charAt ( 0 ) + String . valueOf ( var_1 . length ( ) - 2 ) + var_1 . charAt ( var_1 . length ( ) - 1 ) ;
}
| 3 | 0<SEP>1<SEP>2 |
532 | <awangdev>Longest Substring Without Repeating Characters_3.java | public int lengthOfLongestSubstring(String s) {
if (s == null || s.length() == 0) {
return 0;
}
HashMap<Character, Integer> map = new HashMap<Character, Integer>();
int head = 0;
int max = 0;
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (map.containsKey(c)) {
if (map.get(c) + 1 > head) {
head = map.get(c) + 1;
}
}
map.put(c, i);
String str = s.substring(head, i + 1);
max = Math.max(max, str.length());
}
return max;
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
HashMap < Character , Integer > var_1 = new HashMap < Character , Integer > ( ) ;
int var_2 = 0 ;
int max = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ( ) ;
var_3 ++ ) {
char var_4 = var_0 . charAt ( var_3 ) ;
if ( var_1 . containsKey ( var_4 ) ) {
if ( var_1 . get ( var_4 ) + 1 > var_2 ) {
var_2 = var_1 . get ( var_4 ) + 1 ;
}
}
var_1 . put ( var_4 , var_3 ) ;
String var_5 = var_0 . substring ( var_2 , var_3 + 1 ) ;
max = Math . max ( max , var_5 . length ( ) ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
533 | <awangdev>766. Toeplitz Matrix_1.java | private boolean check(int x, int y, int[][] matrix) {
int n = matrix.length, m = matrix[0].length;
for (int i = x, j = y; i < n && j < m; i++, j++) {
if (matrix[i][j] != matrix[x][y]) return false;
}
return true;
} | private boolean var_0 ( int var_1 , int var_2 , int [ ] [ ] var_3 ) {
int var_4 = var_3 . length , var_5 = var_3 [ 0 ] . length ;
for ( int var_6 = var_1 , var_7 = var_2 ;
var_6 < var_4 && var_7 < var_5 ;
var_6 ++ , var_7 ++ ) {
if ( var_3 [ var_6 ] [ var_7 ] != var_3 [ var_1 ] [ var_2 ] ) return false ;
}
return true ;
}
| 1 | 0 |
535 | <awangdev>438. Find All Anagrams in a String_3.java | private boolean isAnagram(String a, String b) {
int[] arr = new int[26];
for (int i = 0; i < a.length(); i++) {
arr[a.charAt(i) - 'a']++;
arr[b.charAt(i) - 'a']--;
}
for (int i = 0; i < 26; i++) {
if (arr[i] != 0) {
return false;
}
}
return true;
} | private boolean var_0 ( String var_1 , String var_2 ) {
int [ ] var_3 = new int [ 26 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
var_3 [ var_1 . charAt ( var_4 ) - 'a' ] ++ ;
var_3 [ var_2 . charAt ( var_4 ) - 'a' ] -- ;
}
for ( int var_4 = 0 ;
var_4 < 26 ;
var_4 ++ ) {
if ( var_3 [ var_4 ] != 0 ) {
return false ;
}
}
return true ;
}
| 3 | 0<SEP>26<SEP><S_QUOTE>a<S_QUOTE> |
536 | <awangdev>Nim Game_2.java | public boolean canWinNim(int n ) {
if (n <= 3) {
return true;
}
boolean[] dp = new boolean[n + 1];
dp[0] = true;
dp[1] = dp[2] = dp[3] = true;
for (int i = 4; i <= n; i++) {
dp[i] = !(dp[i - 1] && dp[i - 2] && dp[i - 3]);
}
return dp[n];
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 3 ) {
return true ;
}
boolean [ ] var_2 = new boolean [ var_1 + 1 ] ;
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 ] = ! ( var_2 [ var_3 - 1 ] && var_2 [ var_3 - 2 ] && var_2 [ var_3 - 3 ] ) ;
}
return var_2 [ var_1 ] ;
}
| 4 | 4<SEP>1<SEP>3<SEP>2 |
537 | <awangdev>665. Non-decreasing Array_1.java | public boolean checkPossibility(int[] nums) {
if (nums == null || nums.length < 0) {
return false;
} else if (nums.length <= 2) {
return true;
}
int count = 0;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] > nums[i + 1]) {
if (i >= 1 && nums[i - 1] < nums[i + 1]) {
nums[i] = nums[i + 1];
} else if (i >= 1 && nums[i - 1] > nums[i + 1]) {
nums[i + 1] = nums[i];
}
count++;
}
if (count >= 2) {
return false;
}
}
return true;
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length < 0 ) {
return false ;
}
else if ( var_1 . length <= 2 ) {
return true ;
}
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_1 . length - 1 ;
var_3 ++ ) {
if ( var_1 [ var_3 ] > var_1 [ var_3 + 1 ] ) {
if ( var_3 >= 1 && var_1 [ var_3 - 1 ] < var_1 [ var_3 + 1 ] ) {
var_1 [ var_3 ] = var_1 [ var_3 + 1 ] ;
}
else if ( var_3 >= 1 && var_1 [ var_3 - 1 ] > var_1 [ var_3 + 1 ] ) {
var_1 [ var_3 + 1 ] = var_1 [ var_3 ] ;
}
var_2 ++ ;
}
if ( var_2 >= 2 ) {
return false ;
}
}
return true ;
}
| 3 | 0<SEP>1<SEP>2 |
538 | <awangdev>Word Search_2.java | public boolean search(char[][] board, String word, int i, int j, int start) {
if (start == word.length()) {
return true;
}
if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != word.charAt(start)) {
return false;
}
board[i][j] = '#';
boolean rst = search(board, word, i, j - 1, start + 1)
|| search(board, word, i, j + 1, start + 1)
|| search(board, word, i + 1, j, start + 1)
|| search(board, word, i - 1, j, start + 1);
board[i][j] = word.charAt(start);
return rst;
} | public boolean sample_funcname ( char [ ] [ ] board , String word , int i , int j , int start ) {
if ( start == word . length ( ) ) {
return true ;
}
if ( i < 0 || i >= board . length || j < 0 || j >= board [ 0 ] . length || board [ i ] [ j ] != word . charAt ( start ) ) {
return false ;
}
board [ i ] [ j ] = '#' ;
boolean rst = search ( board , word , i , j - 1 , start + 1 ) || search ( board , word , i , j + 1 , start + 1 ) || search ( board , word , i + 1 , j , start + 1 ) || search ( board , word , i - 1 , j , start + 1 ) ;
board [ i ] [ j ] = word . charAt ( start ) ;
return rst ;
}
| 3 | <S_QUOTE>#<S_QUOTE><SEP>0<SEP>1 |
539 | <awangdev>674. Longest Continuous Increasing Subsequence_2.java | public int findLengthOfLCIS(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int max = 1, size = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] > nums[i - 1]) size++;
else size = 1;
max = Math.max(size, max);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int max = 1 , var_1 = 1 ;
for ( int var_2 = 1 ;
var_2 < var_0 . length ;
var_2 ++ ) {
if ( var_0 [ var_2 ] > var_0 [ var_2 - 1 ] ) var_1 ++ ;
else var_1 = 1 ;
max = Math . max ( var_1 , max ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
540 | <awangdev>Longest Increasing Subsequence_1.java | public int lengthOfLIS(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int[] dp = new int[n];
int max = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (nums[i] > nums[j]) {
dp[i] = Math.max(dp[i], dp[j] + 1);
}
}
max = Math.max(dp[i], max);
}
return max + 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 ] ;
int max = 0 ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) {
for ( int var_4 = 0 ;
var_4 < var_3 ;
var_4 ++ ) {
if ( var_0 [ var_3 ] > var_0 [ var_4 ] ) {
var_2 [ var_3 ] = Math . max ( var_2 [ var_3 ] , var_2 [ var_4 ] + 1 ) ;
}
}
max = Math . max ( var_2 [ var_3 ] , max ) ;
}
return max + 1 ;
}
| 2 | 0<SEP>1 |
541 | <awangdev>Subsets II_6.java | public void dfs(List<List<Integer>> rst, ArrayList<Integer> list, int index, int[] nums) {
if (!rst.contains(list)) {
rst.add(new ArrayList<Integer>(list));
}
for (int i = index; i < nums.length; i++) {
list.add(nums[i]);
dfs(rst, list, i + 1, nums);
list.remove(list.size() - 1);
}
} | public void sample_funcname ( List < List < Integer >> rst , ArrayList < Integer > list , int index , int [ ] nums ) {
if ( ! rst . contains ( list ) ) {
rst . add ( new ArrayList < Integer > ( list ) ) ;
}
for ( int i = index ;
i < nums . length ;
i ++ ) {
list . add ( nums [ i ] ) ;
dfs ( rst , list , i + 1 , nums ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
| 1 | 1 |
542 | <awangdev>42. Trapping Rain Water_4.java | public int trap(int[] height) {
if (height == null || height.length == 0) return 0;
final Stack<Integer> stack = new Stack<>();
int total = 0;
stack.push(0);
for (int i = 1; i < height.length; i++) {
int curr = height[i];
if (curr >= height[stack.peek()]) {
int bottom = height[stack.pop()];
while (!stack.isEmpty() && curr >= height[stack.peek()]) {
int leftBound = stack.pop();
total += (height[leftBound] - bottom) * (i - leftBound - 1);
bottom = height[leftBound];
}
if (!stack.isEmpty() && curr < height[stack.peek()]) {
total += (curr - bottom) * (i - stack.peek() - 1);
}
}
stack.push(i);
}
return total;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
final Stack < Integer > var_1 = new Stack < > ( ) ;
int var_2 = 0 ;
var_1 . push ( 0 ) ;
for ( int var_3 = 1 ;
var_3 < var_0 . length ;
var_3 ++ ) {
int var_4 = var_0 [ var_3 ] ;
if ( var_4 >= var_0 [ var_1 . peek ( ) ] ) {
int var_5 = var_0 [ var_1 . pop ( ) ] ;
while ( ! var_1 . isEmpty ( ) && var_4 >= var_0 [ var_1 . peek ( ) ] ) {
int var_6 = var_1 . pop ( ) ;
var_2 += ( var_0 [ var_6 ] - var_5 ) * ( var_3 - var_6 - 1 ) ;
var_5 = var_0 [ var_6 ] ;
}
if ( ! var_1 . isEmpty ( ) && var_4 < var_0 [ var_1 . peek ( ) ] ) {
var_2 += ( var_4 - var_5 ) * ( var_3 - var_1 . peek ( ) - 1 ) ;
}
}
var_1 . push ( var_3 ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
543 | <awangdev>567. Permutation in String_2.java | private Integer[] countFreq(String s) {
Integer[] freq = new Integer[256];
for (char c : s.toCharArray()) freq[c] = freq[c] == null ? 1 : freq[c] + 1;
return freq;
} | private Integer [ ] var_0 ( String var_1 ) {
Integer [ ] var_2 = new Integer [ 256 ] ;
for ( char var_3 : var_1 . toCharArray ( ) ) var_2 [ var_3 ] = var_2 [ var_3 ] == null ? 1 : var_2 [ var_3 ] + 1 ;
return var_2 ;
}
| 2 | 1<SEP>256 |
544 | <awangdev>327. Count of Range Sum_2.java | private long[] calcPreSum(int[] nums) {
long[] preSum = new long[nums.length + 1];
for (int i = 1; i < preSum.length; i++) {
preSum[i] = preSum[i - 1] + nums[i - 1];
}
return preSum;
} | private long [ ] sample_funcname ( int [ ] var_0 ) {
long [ ] var_1 = new long [ var_0 . length + 1 ] ;
for ( int var_2 = 1 ;
var_2 < var_1 . length ;
var_2 ++ ) {
var_1 [ var_2 ] = var_1 [ var_2 - 1 ] + var_0 [ var_2 - 1 ] ;
}
return var_1 ;
}
| 1 | 1 |
545 | <awangdev>1249. Minimum Remove to Make Valid Parentheses_1.java | public String minRemoveToMakeValid(String s) {
Set<Integer> set = new HashSet<>();
Stack<Integer> stack = new Stack<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (c == '(') stack.push(i);
if (c == ')') {
if (!stack.isEmpty()) stack.pop();
else set.add(i);
}
}
while (!stack.isEmpty()) set.add(stack.pop());
StringBuffer sb = new StringBuffer();
for (int i = 0; i < s.length(); i++) {
if (!set.contains(i)) sb.append(s.charAt(i));
}
return sb.toString();
} | public String var_0 ( String var_1 ) {
Set < Integer > var_2 = new HashSet < > ( ) ;
Stack < Integer > var_3 = new Stack < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
char var_5 = var_1 . charAt ( var_4 ) ;
if ( var_5 == '(' ) var_3 . push ( var_4 ) ;
if ( var_5 == ')' ) {
if ( ! var_3 . isEmpty ( ) ) var_3 . pop ( ) ;
else var_2 . add ( var_4 ) ;
}
}
while ( ! var_3 . isEmpty ( ) ) var_2 . add ( var_3 . pop ( ) ) ;
StringBuffer var_6 = new StringBuffer ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
if ( ! var_2 . contains ( var_4 ) ) var_6 . append ( var_1 . charAt ( var_4 ) ) ;
}
return var_6 . toString ( ) ;
}
| 3 | 0<SEP><S_QUOTE>)<S_QUOTE><SEP><S_QUOTE>(<S_QUOTE> |
546 | <awangdev>Backspace String Compare_1.java | private String type(String s) {
Stack<Character> stack = new Stack<>();
for (char c : s.toCharArray()) {
if (c == '#') {
if (!stack.isEmpty()) stack.pop();
} else {
stack.push(c);
}
}
StringBuffer sb = new StringBuffer();
while (!stack.isEmpty()) {
sb.append(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 == '#' ) {
if ( ! var_2 . isEmpty ( ) ) var_2 . pop ( ) ;
}
else {
var_2 . push ( var_3 ) ;
}
}
StringBuffer var_4 = new StringBuffer ( ) ;
while ( ! var_2 . isEmpty ( ) ) {
var_4 . append ( var_2 . pop ( ) ) ;
}
return var_4 . toString ( ) ;
}
| 1 | <S_QUOTE>#<S_QUOTE> |
547 | <awangdev>636. Exclusive Time of Functions_1.java | public int[] exclusiveTime(int n, List<String> logs) {
int[] rst = new int[n];
Stack<Integer> stack = new Stack<>();
int timestamp = 0;
for (String log : logs) {
String[] parts = log.split(":");
int task = Integer.parseInt(parts[0]);
boolean start = parts[1].equals("start");
int time = Integer.parseInt(parts[2]);
if (!stack.isEmpty()) rst[stack.peek()] += time - timestamp;
timestamp = time;
if (start) stack.push(task);
else {
int endTask = stack.pop();
rst[endTask] += 1;
timestamp++;
}
}
return rst;
} | public int [ ] sample_funcname ( int var_0 , List < String > var_1 ) {
int [ ] var_2 = new int [ var_0 ] ;
Stack < Integer > var_3 = new Stack < > ( ) ;
int var_4 = 0 ;
for ( String var_5 : var_1 ) {
String [ ] var_6 = var_5 . split ( ":" ) ;
int var_7 = Integer . parseInt ( var_6 [ 0 ] ) ;
boolean var_8 = var_6 [ 1 ] . equals ( "start" ) ;
int var_9 = Integer . parseInt ( var_6 [ 2 ] ) ;
if ( ! var_3 . isEmpty ( ) ) var_2 [ var_3 . peek ( ) ] += var_9 - var_4 ;
var_4 = var_9 ;
if ( var_8 ) var_3 . push ( var_7 ) ;
else {
int var_10 = var_3 . pop ( ) ;
var_2 [ var_10 ] += 1 ;
var_4 ++ ;
}
}
return var_2 ;
}
| 5 | 2<SEP>0<SEP>1<SEP><D_QUOTE>start<D_QUOTE><SEP><D_QUOTE>:<D_QUOTE> |
548 | <awangdev>275. H-Index II_1.java | public int hIndex(int[] citations) {
if (citations == null || citations.length == 0) {
return 0;
}
int n = citations.length;
int start = 0, end = n - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
int h = n - mid;
if (citations[mid] < h) start = mid;
else {
if (mid - 1 >= 0 && citations[mid - 1] <= h) return h;
end = mid;
}
}
if (citations[start] >= n - start) return n - start;
if (citations[end] >= n - end) return n - end;
return 0;
} | 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 , var_3 = var_1 - 1 ;
while ( var_2 + 1 < var_3 ) {
int var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
int var_5 = var_1 - var_4 ;
if ( var_0 [ var_4 ] < var_5 ) var_2 = var_4 ;
else {
if ( var_4 - 1 >= 0 && var_0 [ var_4 - 1 ] <= var_5 ) return var_5 ;
var_3 = var_4 ;
}
}
if ( var_0 [ var_2 ] >= var_1 - var_2 ) return var_1 - var_2 ;
if ( var_0 [ var_3 ] >= var_1 - var_3 ) return var_1 - var_3 ;
return 0 ;
}
| 3 | 2<SEP>0<SEP>1 |
549 | <awangdev>694. Number of Distinct Islands_1.java | private boolean validateInput(int[][] grid, int x, int y) {
return x < 0 || x >= grid.length || y < 0 || y >= grid[0].length || grid[x][y] == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 < 0 || var_2 >= var_1 . length || var_3 < 0 || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] == 0 ;
}
| 1 | 0 |
550 | <awangdev>767. Reorganize String_2.java | private Map<Character, Integer> buildCountMap(String S) {
Map<Character, Integer> map = new HashMap<>();
for (char c : S.toCharArray()) {
int count = map.getOrDefault(c, 0) + 1;
if (count > (S.length() + 1) / 2) return new HashMap<>();
map.put(c, count);
}
return map;
} | private Map < Character , Integer > var_0 ( String var_1 ) {
Map < Character , Integer > var_2 = new HashMap < > ( ) ;
for ( char var_3 : var_1 . toCharArray ( ) ) {
int var_4 = var_2 . getOrDefault ( var_3 , 0 ) + 1 ;
if ( var_4 > ( var_1 . length ( ) + 1 ) / 2 ) return new HashMap < > ( ) ;
var_2 . put ( var_3 , var_4 ) ;
}
return var_2 ;
}
| 3 | 2<SEP>0<SEP>1 |
551 | <awangdev>Maximal Rectangle_1.java | private int findLargestRectInHistogram(int[] height) {
Stack<Integer> stack = new Stack<>();
int m = height.length;
int max = 0;
for (int i = 0; i <= m; i++) {
int currHeight = i == m ? -1 : height[i];
while (!stack.isEmpty() && currHeight <= height[stack.peek()]) {
int peekHeight = height[stack.pop()];
int width = stack.isEmpty() ? i : i - stack.peek() - 1;
max = Math.max(max, peekHeight * width);
}
stack.push(i);
}
return max;
} | private int sample_funcname ( int [ ] var_0 ) {
Stack < Integer > var_1 = new Stack < > ( ) ;
int var_2 = var_0 . length ;
int max = 0 ;
for ( int var_3 = 0 ;
var_3 <= var_2 ;
var_3 ++ ) {
int var_4 = var_3 == var_2 ? - 1 : var_0 [ var_3 ] ;
while ( ! var_1 . isEmpty ( ) && var_4 <= var_0 [ var_1 . peek ( ) ] ) {
int var_5 = var_0 [ var_1 . pop ( ) ] ;
int var_6 = var_1 . isEmpty ( ) ? var_3 : var_3 - var_1 . peek ( ) - 1 ;
max = Math . max ( max , var_5 * var_6 ) ;
}
var_1 . push ( var_3 ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
553 | <awangdev>53. Maximum Subarray_4.java | public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length;
int[] dp = new int[2];
dp[0] = 0;
int max = Integer.MIN_VALUE;
for (int i = 1; i <= n; i++) {
dp[i % 2] = Math.max(dp[(i - 1) % 2] + nums[i - 1], nums[i - 1]);
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 ;
int [ ] var_2 = new int [ 2 ] ;
var_2 [ 0 ] = 0 ;
int max = Integer . MIN_VALUE ;
for ( int var_3 = 1 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 % 2 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] + var_0 [ var_3 - 1 ] , var_0 [ var_3 - 1 ] ) ;
max = Math . max ( max , var_2 [ var_3 % 2 ] ) ;
}
return max ;
}
| 3 | 0<SEP>1<SEP>2 |
554 | <awangdev>152. Maximum Product Subarray_3.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];
maxProduct[i] = Math.max(num, Math.max(maxProduct[i - 1] * num, minProduct[i - 1] * num));
minProduct[i] = Math.min(num, Math.min(minProduct[i - 1] * 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 ] ;
var_2 [ var_4 ] = Math . max ( var_5 , Math . max ( var_2 [ var_4 - 1 ] * var_5 , var_3 [ var_4 - 1 ] * var_5 ) ) ;
var_3 [ var_4 ] = Math . min ( var_5 , Math . min ( var_3 [ var_4 - 1 ] * var_5 , var_2 [ var_4 - 1 ] * var_5 ) ) ;
max = Math . max ( max , var_2 [ var_4 ] ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
555 | <awangdev>46. Permutations_5.java | private void populateQueue(Queue<List<Integer>> queue, List<Integer> list, int[] nums) {
for (int num : nums) {
if (list.contains(num)) continue;
list.add(num);
queue.offer(new ArrayList<>(list));
list.remove(list.size() - 1);
}
} | private void var_0 ( Queue < List < Integer >> var_1 , List < Integer > var_2 , int [ ] var_3 ) {
for ( int var_4 : var_3 ) {
if ( var_2 . contains ( var_4 ) ) continue ;
var_2 . add ( var_4 ) ;
var_1 . offer ( new ArrayList < > ( var_2 ) ) ;
var_2 . remove ( var_2 . size ( ) - 1 ) ;
}
}
| 1 | 1 |
556 | <awangdev>Missing Number_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 |
557 | <awangdev>283. Move Zeroes_1.java | public void moveZeroes(int[] nums) {
if (nums == null) return;
int index = 0, n = nums.length;
for (int i = 0; i < n; i++) {
if (nums[i] != 0) nums[index++] = nums[i];
}
for (int i = index; i < n; i++) {
nums[i] = 0;
}
} | public void var_0 ( int [ ] var_1 ) {
if ( var_1 == null ) return ;
int var_2 = 0 , var_3 = var_1 . length ;
for ( int var_4 = 0 ;
var_4 < var_3 ;
var_4 ++ ) {
if ( var_1 [ var_4 ] != 0 ) var_1 [ var_2 ++ ] = var_1 [ var_4 ] ;
}
for ( int var_4 = var_2 ;
var_4 < var_3 ;
var_4 ++ ) {
var_1 [ var_4 ] = 0 ;
}
}
| 1 | 0 |
558 | <awangdev>680. Valid Palindrome II_1.java | public boolean validate(String s, int start, int end, boolean state) {
if (start > end) return false;
while (start < end) {
if (s.charAt(start) == s.charAt(end)) {
start++;
end--;
continue;
} else if (state) {
return validate(s, start + 1, end, false) || validate(s, start, end - 1, false);
}
return false;
}
return true;
} | public boolean sample_funcname ( String s , int start , int end , boolean state ) {
if ( start > end ) return false ;
while ( start < end ) {
if ( s . charAt ( start ) == s . charAt ( end ) ) {
start ++ ;
end -- ;
continue ;
}
else if ( state ) {
return validate ( s , start + 1 , end , false ) || validate ( s , start , end - 1 , false ) ;
}
return false ;
}
return true ;
}
| 1 | 1 |
559 | <awangdev>349. Intersection of Two Arrays_1.java | public int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> set = new HashSet<>();
for (int num : nums1) set.add(num);
Set<Integer> rst = new HashSet<>();
for (int num: nums2) {
if (set.contains(num)) rst.add(num);
}
int i = 0;
int[] result = new int[rst.size()];
for (int num : rst) result[i++] = num;
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
Set < Integer > var_2 = new HashSet < > ( ) ;
for ( int var_3 : var_0 ) var_2 . add ( var_3 ) ;
Set < Integer > var_4 = new HashSet < > ( ) ;
for ( int var_3 : var_1 ) {
if ( var_2 . contains ( var_3 ) ) var_4 . add ( var_3 ) ;
}
int var_5 = 0 ;
int [ ] var_6 = new int [ var_4 . size ( ) ] ;
for ( int var_3 : var_4 ) var_6 [ var_5 ++ ] = var_3 ;
return var_6 ;
}
| 1 | 0 |
560 | <awangdev>Backpack II_3.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 j = 0; j <= m; j++) {
dp[0][j] = -1;
}
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
dp[i][j] = dp[i - 1][j];
if (j - A[i - 1] >= 0 && dp[i - 1][j - A[i - 1]] != -1) {
dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - A[i - 1]] + V[i - 1]);
}
}
}
int rst = 0;
for (int j = 0; j <= m; j++) {
if (dp[n][j] != -1) {
rst = Math.max(rst, dp[n][j]);
}
}
return rst;
} | 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 = 0 ;
var_5 <= var_0 ;
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 = 1 ;
var_5 <= var_0 ;
var_5 ++ ) {
var_4 [ var_6 ] [ var_5 ] = var_4 [ var_6 - 1 ] [ var_5 ] ;
if ( var_5 - var_1 [ var_6 - 1 ] >= 0 && var_4 [ var_6 - 1 ] [ var_5 - var_1 [ 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_1 [ var_6 - 1 ] ] + var_2 [ var_6 - 1 ] ) ;
}
}
}
int var_7 = 0 ;
for ( int var_5 = 0 ;
var_5 <= var_0 ;
var_5 ++ ) {
if ( var_4 [ var_3 ] [ var_5 ] != - 1 ) {
var_7 = Math . max ( var_7 , var_4 [ var_3 ] [ var_5 ] ) ;
}
}
return var_7 ;
}
| 2 | 0<SEP>1 |
561 | <awangdev>Brick Wall_1.java | private boolean validate(List<List<Integer>> wall) {
return wall == null || wall.size() == 0 || wall.get(0) == null || wall.get(0).size() == 0;
} | private boolean var_0 ( List < List < Integer >> var_1 ) {
return var_1 == null || var_1 . size ( ) == 0 || var_1 . get ( 0 ) == null || var_1 . get ( 0 ) . size ( ) == 0 ;
}
| 1 | 0 |
562 | <awangdev>39. Combination Sum_3.java | private void dfs(List<List<Integer>> result, List<Integer> list,
int[] candidates, int index, int target) {
for (int i = index; i < candidates.length; i++) {
int value = candidates[i];
list.add(value);
if (target == value) result.add(new ArrayList<>(list));
else 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 ) {
for ( int i = index ;
i < candidates . length ;
i ++ ) {
int value = candidates [ i ] ;
list . add ( value ) ;
if ( target == value ) result . add ( new ArrayList < > ( list ) ) ;
else if ( target - value > 0 ) dfs ( result , list , candidates , i , target - value ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
| 2 | 0<SEP>1 |
563 | <awangdev>Russian Doll Envelopes_1.java | public int maxEnvelopes(int[][] envelopes) {
if (envelopes == null || envelopes.length == 0
|| envelopes[0] == null || envelopes[0].length == 0) {
return 0;
}
Arrays.sort(envelopes, new Comparator<int[]>() {
public int compare (int[] a, int[] b) {
if (a[0] == b[0]) {
return a[1] - b[1];
} else {
return a[0] - b[0];
}
}
});
int n = envelopes.length;
int[] dp = new int[n];
int max = 0;
for (int i = 0; i < n; i++) {
dp[i] = 1;
for (int j = 0; j < i; j++) {
if(envelopes[j][0] < envelopes[i][0] && envelopes[j][1] < envelopes[i][1]) {
dp[i] = Math.max(dp[i], dp[j] + 1);
}
}
max = Math.max(max, dp[i]);
}
return max;
} | 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 ;
}
Arrays . sort ( var_0 , new Comparator < int [ ] > ( ) {
public int compare ( int [ ] var_1 , int [ ] var_2 ) {
if ( var_1 [ 0 ] == var_2 [ 0 ] ) {
return var_1 [ 1 ] - var_2 [ 1 ] ;
}
else {
return var_1 [ 0 ] - var_2 [ 0 ] ;
}
}
}
) ;
int var_3 = var_0 . length ;
int [ ] var_4 = new int [ var_3 ] ;
int max = 0 ;
for ( int var_5 = 0 ;
var_5 < var_3 ;
var_5 ++ ) {
var_4 [ var_5 ] = 1 ;
for ( int var_6 = 0 ;
var_6 < var_5 ;
var_6 ++ ) {
if ( var_0 [ var_6 ] [ 0 ] < var_0 [ var_5 ] [ 0 ] && var_0 [ var_6 ] [ 1 ] < var_0 [ var_5 ] [ 1 ] ) {
var_4 [ var_5 ] = Math . max ( var_4 [ var_5 ] , var_4 [ var_6 ] + 1 ) ;
}
}
max = Math . max ( max , var_4 [ var_5 ] ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
564 | <awangdev>221. Maximal Square_1.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, n = matrix[0].length;
int[][] dp = new int[m + 1][n + 1];
int maxLen = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (matrix[i - 1][j - 1] == '0') continue;
dp[i][j] = Math.min(Math.min(dp[i][j-1], dp[i-1][j]), dp[i-1][j-1]) + 1;
maxLen = Math.max(maxLen, dp[i][j]);
}
}
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 , var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 + 1 ] [ var_2 + 1 ] ;
int var_4 = 0 ;
for ( int var_5 = 1 ;
var_5 <= var_1 ;
var_5 ++ ) {
for ( int var_6 = 1 ;
var_6 <= var_2 ;
var_6 ++ ) {
if ( var_0 [ var_5 - 1 ] [ var_6 - 1 ] == '0' ) continue ;
var_3 [ var_5 ] [ var_6 ] = Math . min ( Math . min ( var_3 [ var_5 ] [ var_6 - 1 ] , var_3 [ var_5 - 1 ] [ var_6 ] ) , var_3 [ var_5 - 1 ] [ var_6 - 1 ] ) + 1 ;
var_4 = Math . max ( var_4 , var_3 [ var_5 ] [ var_6 ] ) ;
}
}
return var_4 * var_4 ;
}
| 3 | 0<SEP><S_QUOTE>0<S_QUOTE><SEP>1 |
565 | <awangdev>51. N-Queens_3.java | private boolean validate(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(rowNum - newRowNum) == Math.abs(colNum - newColNum)) {
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_4 - var_3 ) == Math . abs ( var_5 - var_2 ) ) {
return false ;
}
}
return true ;
}
| 1 | 0 |
566 | <awangdev>Palindromic Substrings_1.java | private boolean[][] buildPalin(String s) {
int n = s.length();
boolean[][] isPalin = new boolean[n][n];
for (int i = 0; i < n; i++) isPalin[i][i] = true;
for (int j = 0; j < n; j++) {
for (int i = 0; i <= j; i++) {
isPalin[i][j] = s.charAt(i) == s.charAt(j) && (j - i <= 1 || isPalin[i + 1][j - 1]);
}
}
return isPalin;
} | private boolean [ ] [ ] var_0 ( String var_1 ) {
int var_2 = var_1 . length ( ) ;
boolean [ ] [ ] var_3 = new boolean [ var_2 ] [ var_2 ] ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) var_3 [ var_4 ] [ var_4 ] = true ;
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
for ( int var_4 = 0 ;
var_4 <= var_5 ;
var_4 ++ ) {
var_3 [ var_4 ] [ var_5 ] = var_1 . charAt ( var_4 ) == var_1 . charAt ( var_5 ) && ( var_5 - var_4 <= 1 || var_3 [ var_4 + 1 ] [ var_5 - 1 ] ) ;
}
}
return var_3 ;
}
| 2 | 0<SEP>1 |
567 | <awangdev>1004. Max Consecutive Ones III_1.java | public int longestOnes(int[] A, int k) {
int left = 0, right = 0, n = A.length;
while (right < n) {
if (A[right++] == 0) k--;
if (k < 0) {
if (A[left] == 0) k++;
left++;
}
}
return right - left;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_2 = 0 , var_3 = 0 , var_4 = var_0 . length ;
while ( var_3 < var_4 ) {
if ( var_0 [ var_3 ++ ] == 0 ) var_1 -- ;
if ( var_1 < 0 ) {
if ( var_0 [ var_2 ] == 0 ) var_1 ++ ;
var_2 ++ ;
}
}
return var_3 - var_2 ;
}
| 1 | 0 |
568 | <awangdev>Sort Colors_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 |
569 | <awangdev>415. Add Strings_3.java | private String convertToString(int[] result) {
int n = result[result.length - 1] == 0 ? result.length - 1: result.length;
StringBuffer sb = new StringBuffer();
for (int i = 0; i < n; i++) {
char c = (char)('0' + result[n - i - 1]);
sb.append(c);
}
return sb.toString();
} | private String var_0 ( int [ ] var_1 ) {
int var_2 = var_1 [ var_1 . length - 1 ] == 0 ? var_1 . length - 1 : var_1 . length ;
StringBuffer var_3 = new StringBuffer ( ) ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
char var_5 = ( char ) ( '0' + var_1 [ var_2 - var_4 - 1 ] ) ;
var_3 . append ( var_5 ) ;
}
return var_3 . toString ( ) ;
}
| 3 | 1<SEP>0<SEP><S_QUOTE>0<S_QUOTE> |
570 | <awangdev>[lint]. 2 Sum II_2.java | public int binarySearch(int[] nums, int target, int start, int end) {
int mid;
int sum;
while (start + 1 < end) {
mid = start + (end - start) /2;
if (mid - 1 >= 0 && nums[mid-1] <= target && target < nums[mid]) {
return mid;
} else if (mid + 1 < nums.length && nums[mid] <= target && target < nums[mid + 1]) {
return mid + 1;
} else if (target < nums[mid]) {
end = mid;
} else {
start = mid;
}
}
if (nums[start] > target) {
return start;
}
return (nums[end] > target) ? end : nums.length;
} | public int sample_funcname ( int [ ] var_0 , int var_1 , int var_2 , int var_3 ) {
int var_4 ;
int var_5 ;
while ( var_2 + 1 < var_3 ) {
var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
if ( var_4 - 1 >= 0 && var_0 [ var_4 - 1 ] <= var_1 && var_1 < var_0 [ var_4 ] ) {
return var_4 ;
}
else if ( var_4 + 1 < var_0 . length && var_0 [ var_4 ] <= var_1 && var_1 < var_0 [ var_4 + 1 ] ) {
return var_4 + 1 ;
}
else if ( var_1 < var_0 [ var_4 ] ) {
var_3 = var_4 ;
}
else {
var_2 = var_4 ;
}
}
if ( var_0 [ var_2 ] > var_1 ) {
return var_2 ;
}
return ( var_0 [ var_3 ] > var_1 ) ? var_3 : var_0 . length ;
}
| 3 | 1<SEP>0<SEP>2 |
571 | <awangdev>198. House Robber_3.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length;
int[][] dp = new int[n][2];
dp[0][1] = nums[0];
for (int i = 1; i < n; i++) {
dp[i][0] = Math.max(dp[i - 1][1], dp[i - 1][0]);
dp[i][1] = dp[i - 1][0] + nums[i];
}
return Math.max(dp[n - 1][0], dp[n - 1][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 ] [ 2 ] ;
var_2 [ 0 ] [ 1 ] = var_0 [ 0 ] ;
for ( int var_3 = 1 ;
var_3 < var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] [ 0 ] = Math . max ( var_2 [ var_3 - 1 ] [ 1 ] , var_2 [ var_3 - 1 ] [ 0 ] ) ;
var_2 [ var_3 ] [ 1 ] = var_2 [ var_3 - 1 ] [ 0 ] + var_0 [ var_3 ] ;
}
return Math . max ( var_2 [ var_1 - 1 ] [ 0 ] , var_2 [ var_1 - 1 ] [ 1 ] ) ;
}
| 3 | 0<SEP>1<SEP>2 |
572 | <awangdev>1267. Count Servers that Communicate_1.java | public int countServers(int[][] grid) {
int total = 0;
int m = grid.length, n = grid[0].length;
int[] row = new int[m], col = new int[n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == 1) {
total++;
row[i]++;
col[j]++;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == 1 && row[i] == 1 && col[j] == 1) {
total--;
}
}
}
return total;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
int var_1 = 0 ;
int var_2 = var_0 . length , var_3 = var_0 [ 0 ] . length ;
int [ ] var_4 = new int [ var_2 ] , var_5 = new int [ var_3 ] ;
for ( int var_6 = 0 ;
var_6 < var_2 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 < var_3 ;
var_7 ++ ) {
if ( var_0 [ var_6 ] [ var_7 ] == 1 ) {
var_1 ++ ;
var_4 [ var_6 ] ++ ;
var_5 [ var_7 ] ++ ;
}
}
}
for ( int var_6 = 0 ;
var_6 < var_2 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 < var_3 ;
var_7 ++ ) {
if ( var_0 [ var_6 ] [ var_7 ] == 1 && var_4 [ var_6 ] == 1 && var_5 [ var_7 ] == 1 ) {
var_1 -- ;
}
}
}
return var_1 ;
}
| 2 | 0<SEP>1 |
573 | <awangdev>Palindrome Pairs_2.java | private boolean isPalindrome(String word) {
if (word.length() == 1) {
return true;
}
int start = 0;
int end = word.length() - 1;
while (start < end) {
if (word.charAt(start) != word.charAt(end)) {
return false;
}
start++;
end--;
}
return true;
} | private boolean var_0 ( String var_1 ) {
if ( var_1 . length ( ) == 1 ) {
return true ;
}
int var_2 = 0 ;
int var_3 = var_1 . length ( ) - 1 ;
while ( var_2 < var_3 ) {
if ( var_1 . charAt ( var_2 ) != var_1 . charAt ( var_3 ) ) {
return false ;
}
var_2 ++ ;
var_3 -- ;
}
return true ;
}
| 2 | 1<SEP>0 |
574 | <awangdev>557. Reverse Words in a String III_1.java | public void reverse(char[] s, int start, int end) {
while (start < end) {
char temp = s[start];
s[start] = s[end];
s[end] = temp;
start++;
end--;
}
} | public 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 ;
var_2 ++ ;
var_3 -- ;
}
}
| 0 | null |
575 | <awangdev>Best Time to Buy and Sell Stock IV_1.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[n][statusLength];
dp[0][0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j < statusLength; j++) {
if (j % 2 == 0) {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - 1] + prices[i] - prices[i - 1]);
profit = Math.max(profit, dp[i][j]);
} else {
dp[i][j] = Math.max(dp[i - 1][j] + prices[i] - prices[i - 1], dp[i - 1][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 [ var_3 ] [ var_4 ] ;
var_6 [ 0 ] [ 0 ] = 0 ;
for ( int var_5 = 1 ;
var_5 < var_3 ;
var_5 ++ ) {
for ( int var_7 = 1 ;
var_7 < var_4 ;
var_7 ++ ) {
if ( var_7 % 2 == 0 ) {
var_6 [ var_5 ] [ var_7 ] = Math . max ( var_6 [ var_5 - 1 ] [ var_7 ] , var_6 [ var_5 - 1 ] [ var_7 - 1 ] + var_1 [ var_5 ] - var_1 [ var_5 - 1 ] ) ;
var_2 = Math . max ( var_2 , var_6 [ var_5 ] [ var_7 ] ) ;
}
else {
var_6 [ var_5 ] [ var_7 ] = Math . max ( var_6 [ var_5 - 1 ] [ var_7 ] + var_1 [ var_5 ] - var_1 [ var_5 - 1 ] , var_6 [ var_5 - 1 ] [ var_7 - 1 ] ) ;
}
}
}
return var_2 ;
}
| 3 | 0<SEP>1<SEP>2 |
576 | <awangdev>843. Guess the Word_1.java | private int countMatch(String a, String b) {
int count = 0;
for (int i = 0; i < 6; i++) {
if (a.charAt(i) == b.charAt(i)) count++;
}
return count;
} | private int sample_funcname ( String var_0 , String var_1 ) {
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < 6 ;
var_3 ++ ) {
if ( var_0 . charAt ( var_3 ) == var_1 . charAt ( var_3 ) ) var_2 ++ ;
}
return var_2 ;
}
| 2 | 0<SEP>6 |
577 | <awangdev>Cosine Similarity_1.java | public double cosineSimilarity(int[] A, int[] B) {
if (A == null || B == null || A.length == 0 || B.length == 0 || A.length != B.length) {
return 2;
}
double sumProduct = 0;
double sumASq = 0;
double sumBSq = 0;
for (int i = 0; i < A.length; i++) {
sumProduct += A[i]*B[i];
sumASq += A[i] * A[i];
sumBSq += B[i] * B[i];
}
if (sumASq == 0 && sumBSq == 0) {
return 2.0;
}
return sumProduct / (Math.sqrt(sumASq) * Math.sqrt(sumBSq));
} | public double sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
if ( var_0 == null || var_1 == null || var_0 . length == 0 || var_1 . length == 0 || var_0 . length != var_1 . length ) {
return 2 ;
}
double var_2 = 0 ;
double var_3 = 0 ;
double var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
var_2 += var_0 [ var_5 ] * var_1 [ var_5 ] ;
var_3 += var_0 [ var_5 ] * var_0 [ var_5 ] ;
var_4 += var_1 [ var_5 ] * var_1 [ var_5 ] ;
}
if ( var_3 == 0 && var_4 == 0 ) {
return 2.0 ;
}
return var_2 / ( Math . sqrt ( var_3 ) * Math . sqrt ( var_4 ) ) ;
}
| 3 | 2.0<SEP>0<SEP>2 |
578 | <awangdev>Maximum XOR of Two Numbers in an Array_1.java | public int findMaximumXOR(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int res = 0, mask = 0;
for (int i = 31; i >= 0; i--) {
mask = mask | (1 << i);
final Set<Integer> set = new HashSet<>();
for (int num : nums) {
set.add(num & mask);
}
int temp = res | (1 << i);
for (int prefix : set) {
if (set.contains(temp ^ prefix)) {
res = temp;
break;
}
}
}
return res;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = 0 , var_2 = 0 ;
for ( int var_3 = 31 ;
var_3 >= 0 ;
var_3 -- ) {
var_2 = var_2 | ( 1 << var_3 ) ;
final Set < Integer > var_4 = new HashSet < > ( ) ;
for ( int var_5 : var_0 ) {
var_4 . add ( var_5 & var_2 ) ;
}
int var_6 = var_1 | ( 1 << var_3 ) ;
for ( int var_7 : var_4 ) {
if ( var_4 . contains ( var_6 ^ var_7 ) ) {
var_1 = var_6 ;
break ;
}
}
}
return var_1 ;
}
| 3 | 31<SEP>0<SEP>1 |
579 | <awangdev>Copy Books_1.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[n + 1][K + 1];
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
dp[i][0] = Integer.MAX_VALUE;
}
for (int i = 1; i <= n; i++) {
for (int k = 1; k <= K; k++) {
int sum = 0;
dp[i][k] = Integer.MAX_VALUE;
for (int j = i; j >= 0; j--) {
dp[i][k] = Math.min(dp[i][k], Math.max(dp[j][k - 1], sum));
if (j > 0) {
sum += pages[j - 1];
}
}
}
}
return dp[n][K];
} | 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 [ var_2 + 1 ] [ var_1 + 1 ] ;
var_3 [ 0 ] [ 0 ] = 0 ;
for ( int var_4 = 1 ;
var_4 <= var_2 ;
var_4 ++ ) {
var_3 [ var_4 ] [ 0 ] = Integer . MAX_VALUE ;
}
for ( int var_4 = 1 ;
var_4 <= var_2 ;
var_4 ++ ) {
for ( int var_5 = 1 ;
var_5 <= var_1 ;
var_5 ++ ) {
int var_6 = 0 ;
var_3 [ var_4 ] [ var_5 ] = Integer . MAX_VALUE ;
for ( int var_7 = var_4 ;
var_7 >= 0 ;
var_7 -- ) {
var_3 [ var_4 ] [ var_5 ] = Math . min ( var_3 [ var_4 ] [ var_5 ] , Math . max ( var_3 [ var_7 ] [ var_5 - 1 ] , var_6 ) ) ;
if ( var_7 > 0 ) {
var_6 += var_0 [ var_7 - 1 ] ;
}
}
}
}
return var_3 [ var_2 ] [ var_1 ] ;
}
| 2 | 0<SEP>1 |
580 | <awangdev>Combinations_2.java | public void helper(List<List<Integer>> rst,
List<Integer> solution, int n, int k, int start) {
if (solution.size() == k) {
rst.add(new ArrayList(solution));
return;
}
for (int i = start; i <= n; i++) {
solution.add(i);
helper(rst, solution, n, k, i + 1);
solution.remove(solution.size() - 1);
}
} | public void sample_funcname ( List < List < Integer >> rst , List < Integer > solution , int n , int k , int start ) {
if ( solution . size ( ) == k ) {
rst . add ( new ArrayList ( solution ) ) ;
return ;
}
for ( int i = start ;
i <= n ;
i ++ ) {
solution . add ( i ) ;
helper ( rst , solution , n , k , i + 1 ) ;
solution . remove ( solution . size ( ) - 1 ) ;
}
}
| 1 | 1 |
581 | <awangdev>Search a 2D Matrix II_2.java | public boolean searchMatrix(int[][] matrix, int target) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return false;
}
int row = matrix.length;
int col = matrix[0].length;
int x = 0;
int y = col - 1;
while (x < row && y >= 0) {
if (matrix[x][y] < target) {
x++;
} else if (matrix[x][y] > target) {
y--;
} else {
return true;
}
}
return false;
} | public boolean var_0 ( int [ ] [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 || var_1 [ 0 ] . length == 0 ) {
return false ;
}
int var_3 = var_1 . length ;
int var_4 = var_1 [ 0 ] . length ;
int var_5 = 0 ;
int var_6 = var_4 - 1 ;
while ( var_5 < var_3 && var_6 >= 0 ) {
if ( var_1 [ var_5 ] [ var_6 ] < var_2 ) {
var_5 ++ ;
}
else if ( var_1 [ var_5 ] [ var_6 ] > var_2 ) {
var_6 -- ;
}
else {
return true ;
}
}
return false ;
}
| 2 | 0<SEP>1 |
582 | <awangdev>72. Edit Distance_2.java | public int minDistance(String word1, String word2) {
if (word1 == null && word2 == null) return 0;
if (word1 == null || word2 == null) return word1 == null ? word2.length() : word1.length();
int m = word1.length();
int n = word2.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;
}
if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
dp[i%2][j] = dp[(i - 1)%2][j - 1];
} else {
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;
}
}
}
return dp[m%2][n];
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_0 == null && var_1 == null ) return 0 ;
if ( var_0 == null || var_1 == null ) return var_0 == null ? var_1 . length ( ) : var_0 . length ( ) ;
int var_2 = var_0 . length ( ) ;
int var_3 = var_1 . length ( ) ;
int [ ] [ ] var_4 = new int [ 2 ] [ var_3 + 1 ] ;
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_4 [ var_5 % 2 ] [ var_6 ] = var_6 ;
continue ;
}
if ( var_6 == 0 ) {
var_4 [ var_5 % 2 ] [ var_6 ] = var_5 ;
continue ;
}
if ( var_0 . charAt ( var_5 - 1 ) == var_1 . charAt ( var_6 - 1 ) ) {
var_4 [ var_5 % 2 ] [ var_6 ] = var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 - 1 ] ;
}
else {
var_4 [ var_5 % 2 ] [ var_6 ] = Math . min ( var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 - 1 ] , Math . min ( var_4 [ var_5 % 2 ] [ var_6 - 1 ] , var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 ] ) ) + 1 ;
}
}
}
return var_4 [ var_2 % 2 ] [ var_3 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
583 | <awangdev>1170. Compare Strings by Frequency of the Smallest Character_2.java | private int calc(int[] wordCounts, int count) {
int rst = 0;
for (int i = wordCounts.length - 1; i >= 0; i--) {
if (wordCounts[i] <= count) break;
rst++;
}
return rst;
} | private int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_2 = 0 ;
for ( int var_3 = var_0 . length - 1 ;
var_3 >= 0 ;
var_3 -- ) {
if ( var_0 [ var_3 ] <= var_1 ) break ;
var_2 ++ ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
584 | <awangdev>218. The Skyline Problem_5.java | int rson(int id) {
return id * 2 + 2;
} | int sample_funcname ( int var_0 ) {
return var_0 * 2 + 2 ;
}
| 1 | 2 |
585 | <awangdev>293. Flip Game_3.java | public static void search(char target, char replace, char[] arr, List<String> rst) {
int p1 = 0;
int p2 = 1;
while (p2 <= arr.length - 1) {
if (arr[p1] == target && arr[p2] == target) {
arr[p1] = replace;
arr[p2] = replace;
rst.add(new String(arr));
arr[p1] = target;
arr[p2] = target;
}
p1++;
p2++;
}
} | public static void var_0 ( char var_1 , char var_2 , char [ ] var_3 , List < String > var_4 ) {
int var_5 = 0 ;
int var_6 = 1 ;
while ( var_6 <= var_3 . length - 1 ) {
if ( var_3 [ var_5 ] == var_1 && var_3 [ var_6 ] == var_1 ) {
var_3 [ var_5 ] = var_2 ;
var_3 [ var_6 ] = var_2 ;
var_4 . add ( new String ( var_3 ) ) ;
var_3 [ var_5 ] = var_1 ;
var_3 [ var_6 ] = var_1 ;
}
var_5 ++ ;
var_6 ++ ;
}
}
| 2 | 0<SEP>1 |
586 | <awangdev>852. Peak Index in a Mountain Array_1.java | public int peakIndexInMountainArray(int[] A) {
int start = 1, end = A.length - 2;
int mid = start + (end - start)/2;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid-1] < A[mid] && A[mid] > A[mid+1]) return mid;
else if (A[mid-1] < A[mid+1]) start = mid;
else if (A[mid-1] > A[mid+1]) end = mid;
}
return A[start] < A[end] ? end : start;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_1 = 1 , var_2 = var_0 . length - 2 ;
int var_3 = var_1 + ( var_2 - var_1 ) / 2 ;
while ( var_1 + 1 < var_2 ) {
var_3 = var_1 + ( var_2 - var_1 ) / 2 ;
if ( var_0 [ var_3 - 1 ] < var_0 [ var_3 ] && var_0 [ var_3 ] > var_0 [ var_3 + 1 ] ) return var_3 ;
else if ( var_0 [ var_3 - 1 ] < var_0 [ var_3 + 1 ] ) var_1 = var_3 ;
else if ( var_0 [ var_3 - 1 ] > var_0 [ var_3 + 1 ] ) var_2 = var_3 ;
}
return var_0 [ var_1 ] < var_0 [ var_2 ] ? var_2 : var_1 ;
}
| 2 | 1<SEP>2 |
587 | <awangdev>266. Palindrome Permutation_2.java | public boolean canPermutePalindrome(String s) {
if (s == null || s.length() == 0) {
return true;
}
HashMap<String, Integer> map = new HashMap<String, Integer>();
for (int i = 0; i < s.length(); i++) {
String str = s.charAt(i) + "";
if (!map.containsKey(str)) {
map.put(str, 1);
} else {
map.put(str, map.get(str) + 1);
}
}
int countOdd = 0;
for (HashMap.Entry<String, Integer> entry : map.entrySet()) {
if (entry.getValue() % 2 == 1) {
countOdd++;
}
if (countOdd > 1) {
return false;
}
}
return true;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return true ;
}
HashMap < String , Integer > var_2 = new HashMap < String , Integer > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ( ) ;
var_3 ++ ) {
String var_4 = var_1 . charAt ( var_3 ) + "" ;
if ( ! var_2 . containsKey ( var_4 ) ) {
var_2 . put ( var_4 , 1 ) ;
}
else {
var_2 . put ( var_4 , var_2 . get ( var_4 ) + 1 ) ;
}
}
int var_5 = 0 ;
for ( HashMap . Entry < String , Integer > var_6 : var_2 . entrySet ( ) ) {
if ( var_6 . getValue ( ) % 2 == 1 ) {
var_5 ++ ;
}
if ( var_5 > 1 ) {
return false ;
}
}
return true ;
}
| 4 | 2<SEP>0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
588 | <awangdev>639. Decode Ways II_1.java | private int countSingle(char c) {
if (c == '*') return 9;
if (c == '0') return 0;
return 1;
} | private int sample_funcname ( char var_0 ) {
if ( var_0 == '*' ) return 9 ;
if ( var_0 == '0' ) return 0 ;
return 1 ;
}
| 5 | 0<SEP>1<SEP><S_QUOTE>*<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP>9 |
589 | <awangdev>168. Excel Sheet Column Title_1.java | public String convertToTitle(int n) {
if (n <= 0) {
return null;
}
StringBuilder sb = new StringBuilder();
while (n > 0) {
int remain = n % 26;
n = n / 26;
if (remain == 0) {
sb.append("Z");
n--;
} else {
sb.append((char)('A' + remain - 1));
}
}
return sb.reverse().toString();
} | public String var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return null ;
}
StringBuilder var_2 = new StringBuilder ( ) ;
while ( var_1 > 0 ) {
int var_3 = var_1 % 26 ;
var_1 = var_1 / 26 ;
if ( var_3 == 0 ) {
var_2 . append ( "Z" ) ;
var_1 -- ;
}
else {
var_2 . append ( ( char ) ( 'A' + var_3 - 1 ) ) ;
}
}
return var_2 . reverse ( ) . toString ( ) ;
}
| 5 | 0<SEP>1<SEP><S_QUOTE>A<S_QUOTE><SEP><D_QUOTE>Z<D_QUOTE><SEP>26 |
590 | <awangdev>Plus One_3.java | public int[] plusOne(int[] digits) {
if (digits == null || digits.length == 0) {
return null;
}
String str = "";
for (int i = 0; i < digits.length; i++) {
str += digits[i];
}
long digit = Long.parseLong(str);
digit += 1;
str = digit + "";
int[] rst = new int[str.length()];
for (int i = 0; i < str.length(); i++) {
rst[i] = Character.getNumericValue(str.charAt(i));
}
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return null ;
}
String var_1 = "" ;
for ( int var_2 = 0 ;
var_2 < var_0 . length ;
var_2 ++ ) {
var_1 += var_0 [ var_2 ] ;
}
long var_3 = Long . parseLong ( var_1 ) ;
var_3 += 1 ;
var_1 = var_3 + "" ;
int [ ] var_4 = new int [ var_1 . length ( ) ] ;
for ( int var_2 = 0 ;
var_2 < var_1 . length ( ) ;
var_2 ++ ) {
var_4 [ var_2 ] = Character . getNumericValue ( var_1 . charAt ( var_2 ) ) ;
}
return var_4 ;
}
| 3 | 0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
591 | <awangdev>122. Best Time to Buy and Sell Stock II_3.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) return 0;
int n = prices.length;
int[][] dp = new int[n+1][2];
dp[0][0] = dp[0][1] = 0;
dp[1][0] = - prices[0];
for (int i = 2; i <= n; i++) {
dp[i][0] = Math.max(dp[i-1][0], dp[i-1][1] - prices[i-1]);
dp[i][1] = Math.max(dp[i-1][1], dp[i-1][0] + prices[i-1]);
}
return dp[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 + 1 ] [ 2 ] ;
var_2 [ 0 ] [ 0 ] = var_2 [ 0 ] [ 1 ] = 0 ;
var_2 [ 1 ] [ 0 ] = - var_0 [ 0 ] ;
for ( int var_3 = 2 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] [ 0 ] = Math . max ( var_2 [ var_3 - 1 ] [ 0 ] , var_2 [ var_3 - 1 ] [ 1 ] - var_0 [ var_3 - 1 ] ) ;
var_2 [ var_3 ] [ 1 ] = Math . max ( var_2 [ var_3 - 1 ] [ 1 ] , var_2 [ var_3 - 1 ] [ 0 ] + var_0 [ var_3 - 1 ] ) ;
}
return var_2 [ var_1 ] [ 1 ] ;
}
| 3 | 2<SEP>0<SEP>1 |
592 | <awangdev>Hamming Distance_1.java | public int hammingDistance(int x, int y) {
int xor = x ^ y;
int count = 0;
while (xor != 0) {
count += xor & 1;
xor = xor >> 1;
}
return count;
} | public int sample_funcname ( int var_0 , int var_1 ) {
int var_2 = var_0 ^ var_1 ;
int var_3 = 0 ;
while ( var_2 != 0 ) {
var_3 += var_2 & 1 ;
var_2 = var_2 >> 1 ;
}
return var_3 ;
}
| 2 | 0<SEP>1 |
593 | <awangdev>Flip Game II_4.java | public static boolean checkP1Win(String str, int x, boolean isP1) {
String s = str.substring(0,x) + "--" + str.substring(x + 2);
if (s.indexOf("++") == -1) {
return isP1;
}
for (int i = s.indexOf("++"); i >= 0 && i < s.length() - 1; i = s.indexOf("++")) {
if (checkP1Win(s, i, !isP1)) {
return true;
}
s = s.substring(0, i) + "-" + s.substring(i + 1);
}
return false;
} | public static boolean sample_funcname ( String str , int x , boolean isP1 ) {
String s = str . substring ( 0 , x ) + "--" + str . substring ( x + 2 ) ;
if ( s . indexOf ( "++" ) == - 1 ) {
return isP1 ;
}
for ( int i = s . indexOf ( "++" ) ;
i >= 0 && i < s . length ( ) - 1 ;
i = s . indexOf ( "++" ) ) {
if ( checkP1Win ( s , i , ! isP1 ) ) {
return true ;
}
s = s . substring ( 0 , i ) + "-" + s . substring ( i + 1 ) ;
}
return false ;
}
| 6 | <D_QUOTE>-<D_QUOTE><SEP><D_QUOTE>++<D_QUOTE><SEP>2<SEP>0<SEP>1<SEP><D_QUOTE>--<D_QUOTE> |
594 | <awangdev>189. Rotate Array_1.java | private void rotateByRange(int[] nums, int x, int y) {
while (x >= 0 && x < y) {
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
x++;
y--;
}
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
while ( var_2 >= 0 && var_2 < var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
var_2 ++ ;
var_3 -- ;
}
}
| 1 | 0 |
595 | <awangdev>297. Serialize and Deserialize Binary Tree_1.java | private void truncateData(StringBuffer sb) {
sb.delete(0, sb.indexOf(",") + 1);
} | private void var_0 ( StringBuffer var_1 ) {
var_1 . delete ( 0 , var_1 . indexOf ( "," ) + 1 ) ;
}
| 3 | 0<SEP><D_QUOTE>,<D_QUOTE><SEP>1 |
596 | <awangdev>766. Toeplitz Matrix_2.java | public boolean isToeplitzMatrix(int[][] matrix) {
for (int i = 0; i < matrix.length - 1; i++) {
for (int j = 0; j < matrix[i].length - 1; j++) {
if (matrix[i][j] != matrix[i + 1][j + 1]) return false;
}
}
return true;
} | public boolean var_0 ( int [ ] [ ] var_1 ) {
for ( int var_2 = 0 ;
var_2 < var_1 . length - 1 ;
var_2 ++ ) {
for ( int var_3 = 0 ;
var_3 < var_1 [ var_2 ] . length - 1 ;
var_3 ++ ) {
if ( var_1 [ var_2 ] [ var_3 ] != var_1 [ var_2 + 1 ] [ var_3 + 1 ] ) return false ;
}
}
return true ;
}
| 2 | 0<SEP>1 |
598 | <awangdev>Word Search_1.java | private boolean validate(char[][] board, int x, int y, char c) {
return x < 0 || x >= board.length || y < 0 || y >= board[0].length
|| board[x][y] != c || board[x][y] == '#';
} | private boolean var_0 ( char [ ] [ ] var_1 , int var_2 , int var_3 , char var_4 ) {
return var_2 < 0 || var_2 >= var_1 . length || var_3 < 0 || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] != var_4 || var_1 [ var_2 ] [ var_3 ] == '#' ;
}
| 2 | <S_QUOTE>#<S_QUOTE><SEP>0 |
599 | <awangdev>Nim Game_1.java | public boolean canWinNim(int n) {
return n % 4 != 0;
} | public boolean var_0 ( int var_1 ) {
return var_1 % 4 != 0 ;
}
| 2 | 4<SEP>0 |
600 | <awangdev>Subsets II_5.java | public void helper(ArrayList<ArrayList<Integer>> rst, ArrayList<Integer> list,
ArrayList<Integer> S, int level) {
if (!rst.contains(list)) {
rst.add(new ArrayList<Integer>(list));
}
if (level == S.size()) {
return;
}
list.add(S.get(level));
helper(rst, list, S, level + 1);
list.remove(list.size() - 1);
helper(rst, list, S, level + 1);
} | public void sample_funcname ( ArrayList < ArrayList < Integer >> rst , ArrayList < Integer > list , ArrayList < Integer > S , int level ) {
if ( ! rst . contains ( list ) ) {
rst . add ( new ArrayList < Integer > ( list ) ) ;
}
if ( level == S . size ( ) ) {
return ;
}
list . add ( S . get ( level ) ) ;
helper ( rst , list , S , level + 1 ) ;
list . remove ( list . size ( ) - 1 ) ;
helper ( rst , list , S , level + 1 ) ;
}
| 1 | 1 |
601 | <awangdev>Longest Increasing Subsequence_2.java | public int binarySearch(List<Integer> list, int target) {
int start = 0;
int end = list.size() - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
if (list.get(mid) == target) {
return mid;
} else if (list.get(mid) < target) {
start = mid;
} else {
end = mid;
}
}
return list.get(start) >= target ? start : end;
} | public int sample_funcname ( List < Integer > var_0 , int var_1 ) {
int var_2 = 0 ;
int var_3 = var_0 . size ( ) - 1 ;
while ( var_2 + 1 < var_3 ) {
int var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
if ( var_0 . get ( var_4 ) == var_1 ) {
return var_4 ;
}
else if ( var_0 . get ( var_4 ) < var_1 ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
return var_0 . get ( var_2 ) >= var_1 ? var_2 : var_3 ;
}
| 3 | 2<SEP>0<SEP>1 |
602 | <awangdev>674. Longest Continuous Increasing Subsequence_1.java | public int findLengthOfLCIS(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length, windowStart = 0;
int max = 1;
for (int i = 1; i < n; i++) {
if (nums[i] <= nums[i - 1]) windowStart = i;
max = Math.max(max, i - windowStart + 1);
}
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 , var_2 = 0 ;
int max = 1 ;
for ( int var_3 = 1 ;
var_3 < var_1 ;
var_3 ++ ) {
if ( var_0 [ var_3 ] <= var_0 [ var_3 - 1 ] ) var_2 = var_3 ;
max = Math . max ( max , var_3 - var_2 + 1 ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
603 | <awangdev>319. Bulb Switcher_1.java | public int bulbSwitch(int n) {
return (int)Math.sqrt(n);
} | public int sample_funcname ( int var_0 ) {
return ( int ) Math . sqrt ( var_0 ) ;
}
| 0 | null |
604 | <awangdev>Word Ladder II_1.java | public void DFS(String start, String str, Map<String, Integer> distance, Map<String, ArrayList<String>> pastMap, ArrayList<String> path, List<List<String>> rst) {
path.add(str);
if (str.equals(start)) {
Collections.reverse(path);
rst.add(new ArrayList<String>(path));
Collections.reverse(path);
} else {
for (String s : pastMap.get(str)) {
if (distance.containsKey(s) && distance.get(str) == distance.get(s) + 1) {
DFS(start, s, distance, pastMap, path, rst);
}
}
}
path.remove(path.size() - 1);
} | public void sample_funcname ( String start , String str , Map < String , Integer > distance , Map < String , ArrayList < String >> pastMap , ArrayList < String > path , List < List < String >> rst ) {
path . add ( str ) ;
if ( str . equals ( start ) ) {
Collections . reverse ( path ) ;
rst . add ( new ArrayList < String > ( path ) ) ;
Collections . reverse ( path ) ;
}
else {
for ( String s : pastMap . get ( str ) ) {
if ( distance . containsKey ( s ) && distance . get ( str ) == distance . get ( s ) + 1 ) {
DFS ( start , s , distance , pastMap , path , rst ) ;
}
}
}
path . remove ( path . size ( ) - 1 ) ;
}
| 1 | 1 |
605 | <awangdev>Trapping Rain Water II_1.java | private boolean isValidCoordinate(int x, int y, boolean[][] visited) {
int m = visited.length, n = visited[0].length;
return x >= 0 && x < m && y >= 0 && y < n && !visited[x][y];
} | private boolean var_0 ( int var_1 , int var_2 , boolean [ ] [ ] var_3 ) {
int var_4 = var_3 . length , var_5 = var_3 [ 0 ] . length ;
return var_1 >= 0 && var_1 < var_4 && var_2 >= 0 && var_2 < var_5 && ! var_3 [ var_1 ] [ var_2 ] ;
}
| 1 | 0 |
606 | <awangdev>Coins in a Line_3.java | public boolean firstWillWin(int n) {
if (n <= 0) {
return false;
}
if (n <= 2) {
return true;
}
int start = 0;
int mid = 1;
int end = 2;
boolean[] dp = new boolean[3];
dp[start] = false;
dp[mid] = true;
for (int i = 2; i <= n; i++) {
dp[end] = !dp[start] || !dp[mid];
if (i != n) {
start = (start + 1) % 3;
mid = (mid + 1) % 3;
end = (end + 1) % 3;
}
}
return dp[end];
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
if ( var_1 <= 2 ) {
return true ;
}
int var_2 = 0 ;
int var_3 = 1 ;
int var_4 = 2 ;
boolean [ ] var_5 = new boolean [ 3 ] ;
var_5 [ var_2 ] = false ;
var_5 [ var_3 ] = true ;
for ( int var_6 = 2 ;
var_6 <= var_1 ;
var_6 ++ ) {
var_5 [ var_4 ] = ! var_5 [ var_2 ] || ! var_5 [ var_3 ] ;
if ( var_6 != var_1 ) {
var_2 = ( var_2 + 1 ) % 3 ;
var_3 = ( var_3 + 1 ) % 3 ;
var_4 = ( var_4 + 1 ) % 3 ;
}
}
return var_5 [ var_4 ] ;
}
| 4 | 0<SEP>3<SEP>1<SEP>2 |
607 | <awangdev>k Sum_1.java | public int kSum(int[] A, int k, int target) {
if (A == null || A.length == 0 || k <= 0) {
return 0;
}
final int[][][] dp = new int[target + 1][A.length + 1][k + 1];
for (int j = 0; j <= A.length; j++) {
dp[0][j][0] = 1;
}
for (int i = 1; i <= target; i++) {
for (int j = 1; j <= A.length; j++) {
for (int m = 1; m <= j && m <= k; m++) {
dp[i][j][m] = dp[i][j - 1][m];
if (i - A[j - 1] >= 0) {
dp[i][j][m] += dp[i - A[j - 1]][j - 1][m - 1];
}
}
}
}
return dp[target][A.length][k];
} | public int sample_funcname ( int [ ] var_0 , int var_1 , int var_2 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 <= 0 ) {
return 0 ;
}
final int [ ] [ ] [ ] var_3 = new int [ var_2 + 1 ] [ var_0 . length + 1 ] [ var_1 + 1 ] ;
for ( int var_4 = 0 ;
var_4 <= var_0 . length ;
var_4 ++ ) {
var_3 [ 0 ] [ var_4 ] [ 0 ] = 1 ;
}
for ( int var_5 = 1 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_4 = 1 ;
var_4 <= var_0 . length ;
var_4 ++ ) {
for ( int var_6 = 1 ;
var_6 <= var_4 && var_6 <= var_1 ;
var_6 ++ ) {
var_3 [ var_5 ] [ var_4 ] [ var_6 ] = var_3 [ var_5 ] [ var_4 - 1 ] [ var_6 ] ;
if ( var_5 - var_0 [ var_4 - 1 ] >= 0 ) {
var_3 [ var_5 ] [ var_4 ] [ var_6 ] += var_3 [ var_5 - var_0 [ var_4 - 1 ] ] [ var_4 - 1 ] [ var_6 - 1 ] ;
}
}
}
}
return var_3 [ var_2 ] [ var_0 . length ] [ var_1 ] ;
}
| 2 | 0<SEP>1 |
608 | <awangdev>301. Remove Invalid Parentheses_3.java | private boolean validate(String s) {
int count = 0;
for (char c : s.toCharArray()) {
count += c == '(' ? 1 : 0;
count -= c == ')' ? 1 : 0;
if (count < 0) return false;
}
return count == 0;
} | private boolean var_0 ( String var_1 ) {
int var_2 = 0 ;
for ( char var_3 : var_1 . toCharArray ( ) ) {
var_2 += var_3 == '(' ? 1 : 0 ;
var_2 -= var_3 == ')' ? 1 : 0 ;
if ( var_2 < 0 ) return false ;
}
return var_2 == 0 ;
}
| 4 | 0<SEP><S_QUOTE>)<S_QUOTE><SEP><S_QUOTE>(<S_QUOTE><SEP>1 |
609 | <awangdev>373. Find K Pairs with Smallest Sums_1.java | private PriorityQueue<List<Integer>> initQueue(int k) {
return new PriorityQueue<>(k, new Comparator<List<Integer>>() {
public int compare(List<Integer> a, List<Integer> b) {
return a.get(0) + a.get(1) - b.get(0) - b.get(1);
}
});
} | private PriorityQueue < List < Integer >> var_0 ( int var_1 ) {
return new PriorityQueue < > ( var_1 , new Comparator < List < Integer >> ( ) {
public int compare ( List < Integer > var_2 , List < Integer > var_3 ) {
return var_2 . get ( 0 ) + var_2 . get ( 1 ) - var_3 . get ( 0 ) - var_3 . get ( 1 ) ;
}
}
) ;
}
| 2 | 0<SEP>1 |
610 | <awangdev>689. Maximum Sum of 3 Non-Overlapping Subarrays_3.java | private int[] calcPresum(int[] nums) {
int[] presum = new int[nums.length + 1];
for (int i = 1; i <= nums.length; i++)
presum[i] += presum[i - 1] + nums[i - 1];
return presum;
} | private int [ ] sample_funcname ( int [ ] var_0 ) {
int [ ] var_1 = new int [ var_0 . length + 1 ] ;
for ( int var_2 = 1 ;
var_2 <= var_0 . length ;
var_2 ++ ) var_1 [ var_2 ] += var_1 [ var_2 - 1 ] + var_0 [ var_2 - 1 ] ;
return var_1 ;
}
| 1 | 1 |
611 | <awangdev>245. Shortest Word Distance III_1.java | public int shortestWordDistance(String[] words, String word1, String word2) {
Integer p1 = null, p2 = null;
int distance = Integer.MAX_VALUE;
for (int i = 0; i < words.length; i++) {
String word = words[i];
if (word.equals(word1) && word.equals(word2)) {
if (p1 != null) distance = Math.min(distance, i - p1);
p1 = i;
continue;
}
if (words[i].equals(word1)) p1 = i;
if (words[i].equals(word2)) p2 = i;
if (p1 != null && p2 != null) distance = Math.min(distance, Math.abs(p1 - p2));
}
return distance;
} | public int sample_funcname ( String [ ] var_0 , String var_1 , String var_2 ) {
Integer var_3 = null , var_4 = null ;
int var_5 = Integer . MAX_VALUE ;
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
String var_7 = var_0 [ var_6 ] ;
if ( var_7 . equals ( var_1 ) && var_7 . equals ( var_2 ) ) {
if ( var_3 != null ) var_5 = Math . min ( var_5 , var_6 - var_3 ) ;
var_3 = var_6 ;
continue ;
}
if ( var_0 [ var_6 ] . equals ( var_1 ) ) var_3 = var_6 ;
if ( var_0 [ var_6 ] . equals ( var_2 ) ) var_4 = var_6 ;
if ( var_3 != null && var_4 != null ) var_5 = Math . min ( var_5 , Math . abs ( var_3 - var_4 ) ) ;
}
return var_5 ;
}
| 1 | 0 |
612 | <awangdev>140. Word Break II_3.java | public boolean[][] isWord(List<String> wordDict, String s) {
int n = s.length();
boolean[][] isWord = new boolean[n][n];
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
isWord[i][j] = wordDict.contains(s.substring(i, j + 1));
}
}
return isWord;
} | public boolean [ ] [ ] var_0 ( List < String > var_1 , String var_2 ) {
int var_3 = var_2 . length ( ) ;
boolean [ ] [ ] var_4 = new boolean [ var_3 ] [ var_3 ] ;
for ( int var_5 = 0 ;
var_5 < var_3 ;
var_5 ++ ) {
for ( int var_6 = var_5 ;
var_6 < var_3 ;
var_6 ++ ) {
var_4 [ var_5 ] [ var_6 ] = var_1 . contains ( var_2 . substring ( var_5 , var_6 + 1 ) ) ;
}
}
return var_4 ;
}
| 2 | 0<SEP>1 |
613 | <awangdev>Distinct Subsequences_3.java | public int numDistinct(String S, String T) {
int[][] DP = new int[T.length() + 1][S.length() + 1];
DP[0][0] = 1;
for(int i = 1; i < S.length(); i++) {
DP[0][i] = 1;
}
for (int i = 1; i < T.length(); i++) {
DP[i][0] = 0;
}
for (int i = 1; i <= T.length(); i++) {
for (int j = 1; j <= S.length(); j++){
DP[i][j] = DP[i][j - 1];
if (T.charAt(i - 1) == S.charAt(j - 1)) {
DP[i][j] += DP[i - 1][j - 1];
}
}
}
return DP[T.length()][S.length()];
} | public int sample_funcname ( String var_0 , String var_1 ) {
int [ ] [ ] var_2 = new int [ var_1 . length ( ) + 1 ] [ var_0 . length ( ) + 1 ] ;
var_2 [ 0 ] [ 0 ] = 1 ;
for ( int var_3 = 1 ;
var_3 < var_0 . length ( ) ;
var_3 ++ ) {
var_2 [ 0 ] [ var_3 ] = 1 ;
}
for ( int var_3 = 1 ;
var_3 < var_1 . length ( ) ;
var_3 ++ ) {
var_2 [ var_3 ] [ 0 ] = 0 ;
}
for ( int var_3 = 1 ;
var_3 <= var_1 . length ( ) ;
var_3 ++ ) {
for ( int var_4 = 1 ;
var_4 <= var_0 . length ( ) ;
var_4 ++ ) {
var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 ] [ var_4 - 1 ] ;
if ( var_1 . charAt ( var_3 - 1 ) == var_0 . charAt ( var_4 - 1 ) ) {
var_2 [ var_3 ] [ var_4 ] += var_2 [ var_3 - 1 ] [ var_4 - 1 ] ;
}
}
}
return var_2 [ var_1 . length ( ) ] [ var_0 . length ( ) ] ;
}
| 2 | 1<SEP>0 |
614 | <awangdev>34. Find First and Last Position of Element in Sorted Array_1.java | private int binarySearch(int[] nums, int target, boolean isLeft) {
int n = nums.length, start = 0, end = n - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2, val = nums[mid];
if (val == target) {
if (isLeft) end = mid;
else start = mid;
} else if (val < target) start = mid;
else end = mid;
}
if (nums[start] == target && nums[end] == target) return isLeft ? start : end;
if (nums[start] == target) return start;
if (nums[end] == target) return end;
return -1;
} | private int sample_funcname ( int [ ] var_0 , int var_1 , boolean var_2 ) {
int var_3 = var_0 . length , var_4 = 0 , var_5 = var_3 - 1 ;
while ( var_4 + 1 < var_5 ) {
int var_6 = var_4 + ( var_5 - var_4 ) / 2 , var_7 = var_0 [ var_6 ] ;
if ( var_7 == var_1 ) {
if ( var_2 ) var_5 = var_6 ;
else var_4 = var_6 ;
}
else if ( var_7 < var_1 ) var_4 = var_6 ;
else var_5 = var_6 ;
}
if ( var_0 [ var_4 ] == var_1 && var_0 [ var_5 ] == var_1 ) return var_2 ? var_4 : var_5 ;
if ( var_0 [ var_4 ] == var_1 ) return var_4 ;
if ( var_0 [ var_5 ] == var_1 ) return var_5 ;
return - 1 ;
}
| 3 | 2<SEP>0<SEP>1 |
615 | <awangdev>53. Maximum Subarray_10.java | public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int preSum = 0, minPreSum = 0;
int max = Integer.MIN_VALUE;
for (int num : nums) {
preSum += num;
max = Math.max(max, preSum - minPreSum);
minPreSum = Math.min(minPreSum, preSum);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_1 = 0 , var_2 = 0 ;
int max = Integer . MIN_VALUE ;
for ( int var_3 : var_0 ) {
var_1 += var_3 ;
max = Math . max ( max , var_1 - var_2 ) ;
var_2 = Math . min ( var_2 , var_1 ) ;
}
return max ;
}
| 1 | 0 |
616 | <awangdev>516. Longest Palindromic Subsequence_1.java | public int longestPalindromeSubseq(String s) {
char[] ss = s.toCharArray();
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 (ss[i] == ss[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];
} | public int sample_funcname ( String var_0 ) {
char [ ] var_1 = var_0 . toCharArray ( ) ;
int var_2 = var_0 . length ( ) ;
int [ ] [ ] var_3 = new int [ var_2 ] [ var_2 ] ;
for ( int var_4 = var_2 - 1 ;
var_4 >= 0 ;
var_4 -- ) {
var_3 [ var_4 ] [ var_4 ] = 1 ;
for ( int var_5 = var_4 + 1 ;
var_5 < var_2 ;
var_5 ++ ) {
if ( var_1 [ var_4 ] == var_1 [ var_5 ] ) var_3 [ var_4 ] [ var_5 ] = var_3 [ var_4 + 1 ] [ var_5 - 1 ] + 2 ;
else var_3 [ var_4 ] [ var_5 ] = Math . max ( var_3 [ var_4 + 1 ] [ var_5 ] , var_3 [ var_4 ] [ var_5 - 1 ] ) ;
}
}
return var_3 [ 0 ] [ var_2 - 1 ] ;
}
| 3 | 1<SEP>0<SEP>2 |
617 | <awangdev>169. Majority Element_5.java | public int majorityNumber(ArrayList<Integer> nums) {
if (nums == null || nums.size() == 0) {
return -1;
}
int majorNum = nums.get(0);
int count = 1;
for (int i = 1; i < nums.size(); i++) {
if (majorNum == nums.get(i)) {
count++;
} else {
count--;
}
if (count == 0) {
majorNum = nums.get(i);
count = 1;
}
}
return majorNum;
} | public int sample_funcname ( ArrayList < Integer > var_0 ) {
if ( var_0 == null || var_0 . size ( ) == 0 ) {
return - 1 ;
}
int var_1 = var_0 . get ( 0 ) ;
int var_2 = 1 ;
for ( int var_3 = 1 ;
var_3 < var_0 . size ( ) ;
var_3 ++ ) {
if ( var_1 == var_0 . get ( var_3 ) ) {
var_2 ++ ;
}
else {
var_2 -- ;
}
if ( var_2 == 0 ) {
var_1 = var_0 . get ( var_3 ) ;
var_2 = 1 ;
}
}
return var_1 ;
}
| 2 | 0<SEP>1 |
618 | <awangdev>Number Of Corner Rectangles_3.java | private boolean validate(int[][] grid) {
return grid == null || grid.length == 0 || grid[0] == null || grid[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
| 1 | 0 |
619 | <awangdev>Longest Common Subsequence_4.java | public int longestCommonSubsequence(String A, String B) {
if (A == null || B == null || A.length() == 0 || B.length() == 0) {
return 0;
}
int[][] check = new int[A.length() + 1][B.length() + 1];
for (int i = 1; i <= A.length(); i++) {
for (int j = 1; j <= B.length(); j++) {
if (A.charAt(i - 1) == B.charAt(j - 1)) {
check[i][j] = check[i - 1][j - 1] + 1;
} else {
check[i][j] = Math.max(check[i][j], check[i - 1][j]);
check[i][j] = Math.max(check[i][j], check[i][j - 1]);
}
}
}
return check[A.length()][B.length()];
} | 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 = new int [ var_0 . length ( ) + 1 ] [ var_1 . length ( ) + 1 ] ;
for ( int var_3 = 1 ;
var_3 <= var_0 . length ( ) ;
var_3 ++ ) {
for ( int var_4 = 1 ;
var_4 <= var_1 . length ( ) ;
var_4 ++ ) {
if ( var_0 . charAt ( var_3 - 1 ) == var_1 . charAt ( var_4 - 1 ) ) {
var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 - 1 ] [ var_4 - 1 ] + 1 ;
}
else {
var_2 [ var_3 ] [ var_4 ] = Math . max ( var_2 [ var_3 ] [ var_4 ] , var_2 [ var_3 - 1 ] [ var_4 ] ) ;
var_2 [ var_3 ] [ var_4 ] = Math . max ( var_2 [ var_3 ] [ var_4 ] , var_2 [ var_3 ] [ var_4 - 1 ] ) ;
}
}
}
return var_2 [ var_0 . length ( ) ] [ var_1 . length ( ) ] ;
}
| 2 | 0<SEP>1 |