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
⌀ |
|---|---|---|---|---|---|
722 | <awangdev>Maximum Subarray III_1.java | public int maxSubArray(int[] nums, int k) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int[][] dp = new int[n + 1][k + 1];
for (int j = 1; j <= k; j++) {
for (int i = j; i <= n; i++) {
dp[i][j] = Integer.MIN_VALUE;
int endMax = 0;
int max = Integer.MIN_VALUE;
for (int x = i - 1; x >= j - 1; x--) {
endMax = Math.max(nums[x], nums[x] + endMax);
max = Math.max(max, endMax);
dp[i][j] = dp[i][j] < dp[x][j - 1] + max ? dp[x][j - 1] + max : dp[i][j];
}
}
}
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 ;
int [ ] [ ] var_3 = new int [ var_2 + 1 ] [ var_1 + 1 ] ;
for ( int var_4 = 1 ;
var_4 <= var_1 ;
var_4 ++ ) {
for ( int var_5 = var_4 ;
var_5 <= var_2 ;
var_5 ++ ) {
var_3 [ var_5 ] [ var_4 ] = Integer . MIN_VALUE ;
int var_6 = 0 ;
int max = Integer . MIN_VALUE ;
for ( int var_7 = var_5 - 1 ;
var_7 >= var_4 - 1 ;
var_7 -- ) {
var_6 = Math . max ( var_0 [ var_7 ] , var_0 [ var_7 ] + var_6 ) ;
max = Math . max ( max , var_6 ) ;
var_3 [ var_5 ] [ var_4 ] = var_3 [ var_5 ] [ var_4 ] < var_3 [ var_7 ] [ var_4 - 1 ] + max ? var_3 [ var_7 ] [ var_4 - 1 ] + max : var_3 [ var_5 ] [ var_4 ] ;
}
}
}
return var_3 [ var_2 ] [ var_1 ] ;
}
| 2 | 0<SEP>1 |
723 | <awangdev>72. Edit Distance_3.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[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
dp[i][0] = i;
}
for (int j = 0; j <= n; j++) {
dp[0][j] = j;
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
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 ( ) ;
int 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 ++ ) {
var_4 [ var_5 ] [ 0 ] = var_5 ;
}
for ( int var_6 = 0 ;
var_6 <= var_3 ;
var_6 ++ ) {
var_4 [ 0 ] [ var_6 ] = var_6 ;
}
for ( int var_5 = 1 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_6 = 1 ;
var_6 <= var_3 ;
var_6 ++ ) {
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 |
724 | <awangdev>Maximum Size Subarray Sum Equals k_1.java | public int maxSubArrayLen(int[] nums, int k) {
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];
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 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
Map < Integer , Integer > var_2 = new HashMap < > ( ) ;
var_2 . put ( 0 , - 1 ) ;
int var_3 = 0 , max = 0 ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
var_3 += var_0 [ var_4 ] ;
if ( var_2 . containsKey ( var_3 - var_1 ) ) {
max = Math . max ( max , var_4 - var_2 . get ( var_3 - var_1 ) ) ;
}
if ( ! var_2 . containsKey ( var_3 ) ) {
var_2 . put ( var_3 , var_4 ) ;
}
}
return max ;
}
| 2 | 0<SEP>1 |
725 | <awangdev>760. Find Anagram Mappings_1.java | public int[] anagramMappings(int[] A, int[] B) {
if (A == null || B == null || A.length == 0) {
return null;
}
int[] result = new int[A.length];
Map<Integer, ArrayList<Integer>> map = new HashMap<>();
for (int i = 0; i < B.length; i++) {
map.putIfAbsent(B[i], new ArrayList<>());
map.get(B[i]).add(i);
}
for (int i = 0; i < A.length; i++) {
ArrayList<Integer> list = map.get(A[i]);
result[i] = list.get(0);
list.remove(0);
}
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
if ( var_0 == null || var_1 == null || var_0 . length == 0 ) {
return null ;
}
int [ ] var_2 = new int [ var_0 . length ] ;
Map < Integer , ArrayList < Integer >> var_3 = new HashMap < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ;
var_4 ++ ) {
var_3 . putIfAbsent ( var_1 [ var_4 ] , new ArrayList < > ( ) ) ;
var_3 . get ( var_1 [ var_4 ] ) . add ( var_4 ) ;
}
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
ArrayList < Integer > var_5 = var_3 . get ( var_0 [ var_4 ] ) ;
var_2 [ var_4 ] = var_5 . get ( 0 ) ;
var_5 . remove ( 0 ) ;
}
return var_2 ;
}
| 1 | 0 |
726 | <awangdev>Maximum Subarray II_1.java | public int maxTwoSubArrays(List<Integer> nums) {
if (nums == null || nums.size() == 0) {
return 0;
}
int n = nums.size();
int[] dpLeft = new int[n + 1];
int[] dpRight = new int[n + 1];
dpLeft[0] = 0;
dpRight[n] = 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] = Math.max(dpLeft[i - 1] + nums.get(i - 1), nums.get(i - 1));
maxLeft[i] = Math.max(maxLeft[i - 1], dpLeft[i]);
}
for (int j = n - 1; j >= 0; j--) {
dpRight[j] = Math.max(dpRight[j + 1] + nums.get(j), nums.get(j));
maxRight[j] = Math.max(maxRight[j + 1], dpRight[j]);
}
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 [ var_1 + 1 ] ;
int [ ] var_3 = new int [ var_1 + 1 ] ;
var_2 [ 0 ] = 0 ;
var_3 [ var_1 ] = 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 ] = Math . max ( var_2 [ var_6 - 1 ] + 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 ] ) ;
}
for ( int var_7 = var_1 - 1 ;
var_7 >= 0 ;
var_7 -- ) {
var_3 [ var_7 ] = Math . max ( var_3 [ var_7 + 1 ] + 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 ] ) ;
}
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 ;
}
| 2 | 0<SEP>1 |
727 | <awangdev>198. House Robber_2.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length;
long[] dp = new long[2];
dp[0] = 0;
dp[1] = nums[0];
for (int i = 2; i <= n; i++) {
dp[i % 2] = Math.max(dp[(i - 1)%2], dp[(i - 2)%2] + nums[i - 1]);
}
return (int) dp[n % 2];
} | 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 [ 2 ] ;
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 % 2 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] , var_2 [ ( var_3 - 2 ) % 2 ] + var_0 [ var_3 - 1 ] ) ;
}
return ( int ) var_2 [ var_1 % 2 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
728 | <awangdev>[HackerRank]. Change to Anagram_1.java | public int validate(String str) {
if (str.length() % 2 == 1) {
return -1;
}
String sA = str.substring(0, str.length()/2);
String sB = str.substring(str.length()/2);
int[] arr = new int[26];
for (int i = 0; i < sA.length(); i++) {
char cA = sA.charAt(i);
char cB = sB.charAt(i);
if (cA < 'a' || cA > 'z' || cB < 'a' || cB > 'z') {
return -1;
}
arr[cA - 'a']++;
arr[cB - 'a']--;
}
int count = 0;
for (int num : arr) {
count += Math.abs(num);
}
return count/2;
} | public int sample_funcname ( String var_0 ) {
if ( var_0 . length ( ) % 2 == 1 ) {
return - 1 ;
}
String var_1 = var_0 . substring ( 0 , var_0 . length ( ) / 2 ) ;
String var_2 = var_0 . substring ( var_0 . length ( ) / 2 ) ;
int [ ] var_3 = new int [ 26 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
char var_5 = var_1 . charAt ( var_4 ) ;
char var_6 = var_2 . charAt ( var_4 ) ;
if ( var_5 < 'a' || var_5 > 'z' || var_6 < 'a' || var_6 > 'z' ) {
return - 1 ;
}
var_3 [ var_5 - 'a' ] ++ ;
var_3 [ var_6 - 'a' ] -- ;
}
int var_7 = 0 ;
for ( int var_8 : var_3 ) {
var_7 += Math . abs ( var_8 ) ;
}
return var_7 / 2 ;
}
| 6 | 2<SEP>1<SEP>0<SEP><S_QUOTE>z<S_QUOTE><SEP><S_QUOTE>a<S_QUOTE><SEP>26 |
729 | <awangdev>51. N-Queens_2.java | private List<String> createBoard(int[] columns){
int n = columns.length;
List<String> board = new ArrayList<>();
for (int row = 0; row < n; row++) {
StringBuffer sb = new StringBuffer();
int queenCol = columns[row];
for (int col = 0; col < n; col++) {
sb.append(queenCol == col ? "Q" : ".");
}
board.add(sb.toString());
}
return board;
} | private List < String > var_0 ( int [ ] var_1 ) {
int var_2 = var_1 . length ;
List < String > var_3 = new ArrayList < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
StringBuffer var_5 = new StringBuffer ( ) ;
int var_6 = var_1 [ var_4 ] ;
for ( int var_7 = 0 ;
var_7 < var_2 ;
var_7 ++ ) {
var_5 . append ( var_6 == var_7 ? "Q" : "." ) ;
}
var_3 . add ( var_5 . toString ( ) ) ;
}
return var_3 ;
}
| 3 | <D_QUOTE>.<D_QUOTE><SEP><D_QUOTE>Q<D_QUOTE><SEP>0 |
730 | <awangdev>415. Add Strings_2.java | private int[] convertToInt(String num) {
if (num == null || num.length() == 0) {
return new int[1];
}
int n = num.length();
int[] nums = new int[n + 1];
for (int i = 0; i < n; i++) {
nums[i] = num.charAt(n - i - 1) - '0';
}
return nums;
} | private int [ ] sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return new int [ 1 ] ;
}
int var_1 = var_0 . length ( ) ;
int [ ] var_2 = new int [ var_1 + 1 ] ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] = var_0 . charAt ( var_1 - var_3 - 1 ) - '0' ;
}
return var_2 ;
}
| 3 | 0<SEP><S_QUOTE>0<S_QUOTE><SEP>1 |
731 | <awangdev>1216. Valid Palindrome III_2.java | private String getKey(int left, int right, int k) {
return String.format("%s@%s@%s", left, right, k);
} | private String var_0 ( int var_1 , int var_2 , int var_3 ) {
return String . format ( "%s@%s@%s" , var_1 , var_2 , var_3 ) ;
}
| 1 | <D_QUOTE>%s@%s@%s<D_QUOTE> |
732 | <awangdev>Evaluate Reverse Polish Notation_2.java | private long eval(long a, long b, String s) {
long rst = 0;
char operator = s.charAt(0);
if (operator == '+') rst = a + b;
if (operator == '-') rst = a - b;
if (operator == '*') rst = a * b;
if (operator == '/') rst = a / b;
return rst;
} | private long sample_funcname ( long var_0 , long var_1 , String var_2 ) {
long var_3 = 0 ;
char var_4 = var_2 . charAt ( 0 ) ;
if ( var_4 == '+' ) var_3 = var_0 + var_1 ;
if ( var_4 == '-' ) var_3 = var_0 - var_1 ;
if ( var_4 == '*' ) var_3 = var_0 * var_1 ;
if ( var_4 == '/' ) var_3 = var_0 / var_1 ;
return var_3 ;
}
| 5 | <S_QUOTE>-<S_QUOTE><SEP>0<SEP><S_QUOTE>*<S_QUOTE><SEP><S_QUOTE>+<S_QUOTE><SEP><S_QUOTE>/<S_QUOTE> |
733 | <awangdev>Backpack II_2.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[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]] + V[i - 1]);
}
}
}
return dp[n % 2][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 [ 2 ] [ 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 % 2 ] [ var_6 ] = var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 ] ;
if ( var_6 - var_1 [ var_5 - 1 ] >= 0 ) {
var_4 [ var_5 % 2 ] [ var_6 ] = Math . max ( var_4 [ var_5 % 2 ] [ var_6 ] , var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 - var_1 [ var_5 - 1 ] ] + var_2 [ var_5 - 1 ] ) ;
}
}
}
return var_4 [ var_3 % 2 ] [ var_0 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
734 | <awangdev>39. Combination Sum_2.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 |
735 | <awangdev>986. Interval List Intersections_1.java | public int[][] intervalIntersection(int[][] A, int[][] B) {
List<int[]> list = new ArrayList<>();
int i = 0, j = 0;
int m = A.length, n = B.length;
while (i < m && j < n) {
int lo = Math.max(A[i][0], B[j][0]);
int hi = Math.min(A[i][1], B[j][1]);
if (lo <= hi) list.add(new int[]{lo, hi});
if (A[i][1] < B[j][1]) i++;
else j++;
}
int[][] rst = new int[list.size()][2];
for (int k = 0; k < list.size(); k++) {
rst[k] = list.get(k);
}
return rst;
} | public int [ ] [ ] sample_funcname ( int [ ] [ ] var_0 , int [ ] [ ] var_1 ) {
List < int [ ] > var_2 = new ArrayList < > ( ) ;
int var_3 = 0 , var_4 = 0 ;
int var_5 = var_0 . length , var_6 = var_1 . length ;
while ( var_3 < var_5 && var_4 < var_6 ) {
int var_7 = Math . max ( var_0 [ var_3 ] [ 0 ] , var_1 [ var_4 ] [ 0 ] ) ;
int var_8 = Math . min ( var_0 [ var_3 ] [ 1 ] , var_1 [ var_4 ] [ 1 ] ) ;
if ( var_7 <= var_8 ) var_2 . add ( new int [ ] {
var_7 , var_8 }
) ;
if ( var_0 [ var_3 ] [ 1 ] < var_1 [ var_4 ] [ 1 ] ) var_3 ++ ;
else var_4 ++ ;
}
int [ ] [ ] var_9 = new int [ var_2 . size ( ) ] [ 2 ] ;
for ( int var_10 = 0 ;
var_10 < var_2 . size ( ) ;
var_10 ++ ) {
var_9 [ var_10 ] = var_2 . get ( var_10 ) ;
}
return var_9 ;
}
| 3 | 2<SEP>0<SEP>1 |
736 | <awangdev>347. Top K Frequent Elements_2.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 |
737 | <awangdev>28. Implement strStr()_1.java | public int strStr(String haystack, String needle) {
if (needle == null || needle.length() == 0) {
return 0;
}
if (needle.length() > haystack.length()) {
return -1;
}
int n = haystack.length();
int m = needle.length();
for (int i = 0; i < n; i++) {
if (n - i < m) {
return -1;
}
if (haystack.charAt(i) != needle.charAt(0)) {
continue;
}
if (haystack.substring(i, i + m).equals(needle)) {
return i;
}
}
return -1;
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
if ( var_1 . length ( ) > var_0 . length ( ) ) {
return - 1 ;
}
int var_2 = var_0 . length ( ) ;
int var_3 = var_1 . length ( ) ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
if ( var_2 - var_4 < var_3 ) {
return - 1 ;
}
if ( var_0 . charAt ( var_4 ) != var_1 . charAt ( 0 ) ) {
continue ;
}
if ( var_0 . substring ( var_4 , var_4 + var_3 ) . equals ( var_1 ) ) {
return var_4 ;
}
}
return - 1 ;
}
| 2 | 0<SEP>1 |
738 | <awangdev>767. Reorganize String_3.java | private PriorityQueue<int[]> buildCharQueue (Map<Character, Integer> map) {
PriorityQueue<int[]> queue = new PriorityQueue<>((a,b) -> b[1] - a[1]);
for (char c : map.keySet()) {
queue.add(new int[]{c, map.get(c)});
}
return queue;
} | private PriorityQueue < int [ ] > var_0 ( Map < Character , Integer > var_1 ) {
PriorityQueue < int [ ] > var_4 = new PriorityQueue < > ( ( var_3 , var_2 ) -> var_2 [ 1 ] - var_3 [ 1 ] ) ;
for ( char var_5 : var_1 . keySet ( ) ) {
var_4 . add ( new int [ ] {
var_5 , var_1 . get ( var_5 ) }
) ;
}
return var_4 ;
}
| 1 | 1 |
739 | <awangdev>Longest Consecutive Sequence_1.java | public int longestConsecutive(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
Set<Integer> set = new HashSet<>();
for (int num : nums) {
set.add(num);
}
int longest = 0;
for (int num : nums) {
int start = num;
while (set.contains(start - 1)) {
start--;
set.remove(start);
}
int end = num;
while (set.contains(end + 1)) {
end++;
set.remove(end);
}
longest = Math.max(longest, end - start + 1);
}
return longest;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
Set < Integer > var_1 = new HashSet < > ( ) ;
for ( int var_2 : var_0 ) {
var_1 . add ( var_2 ) ;
}
int var_3 = 0 ;
for ( int var_2 : var_0 ) {
int var_4 = var_2 ;
while ( var_1 . contains ( var_4 - 1 ) ) {
var_4 -- ;
var_1 . remove ( var_4 ) ;
}
int var_5 = var_2 ;
while ( var_1 . contains ( var_5 + 1 ) ) {
var_5 ++ ;
var_1 . remove ( var_5 ) ;
}
var_3 = Math . max ( var_3 , var_5 - var_4 + 1 ) ;
}
return var_3 ;
}
| 2 | 0<SEP>1 |
740 | <awangdev>53. Maximum Subarray_5.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[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = nums[i - 1] + (dp[i - 1] >= 0 ? dp[i - 1] : 0);
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 , max = Integer . MIN_VALUE ;
int [ ] var_2 = new int [ var_1 + 1 ] ;
var_2 [ 0 ] = 0 ;
for ( int var_3 = 1 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] = var_0 [ var_3 - 1 ] + ( var_2 [ var_3 - 1 ] >= 0 ? var_2 [ var_3 - 1 ] : 0 ) ;
max = Math . max ( max , var_2 [ var_3 ] ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
741 | <awangdev>46. Permutations_4.java | public List<List<Integer>> permute(int[] nums) {
List<List<Integer>> rst = new ArrayList<>();
if (nums == null || nums.length == 0) return rst;
rst.add(new ArrayList<>());
for (int i = 0; i < nums.length; i++) {
int rstSize = rst.size();
for (int j = 0; j < rstSize; j++) {
List<Integer> baselist = rst.get(j);
for (int index = 0; index < baselist.size(); index++) {
baselist.add(index, nums[i]);
rst.add(new ArrayList<>(baselist));
baselist.remove(index);
}
baselist.add(nums[i]);
}
}
return rst;
} | public List < List < Integer >> var_0 ( int [ ] var_1 ) {
List < List < Integer >> var_2 = new ArrayList < > ( ) ;
if ( var_1 == null || var_1 . length == 0 ) return var_2 ;
var_2 . add ( new ArrayList < > ( ) ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
int var_4 = var_2 . size ( ) ;
for ( int var_5 = 0 ;
var_5 < var_4 ;
var_5 ++ ) {
List < Integer > var_6 = var_2 . get ( var_5 ) ;
for ( int var_7 = 0 ;
var_7 < var_6 . size ( ) ;
var_7 ++ ) {
var_6 . add ( var_7 , var_1 [ var_3 ] ) ;
var_2 . add ( new ArrayList < > ( var_6 ) ) ;
var_6 . remove ( var_7 ) ;
}
var_6 . add ( var_1 [ var_3 ] ) ;
}
}
return var_2 ;
}
| 1 | 0 |
742 | <awangdev>152. Maximum Product Subarray_2.java | public int maxProduct(int[] nums) {
int n = nums.length;
int[] maxProduct = new int[2], minProduct = new int[2];
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 % 2] = Math.max(num, maxProduct[(i - 1) % 2] * num);
minProduct[i % 2] = Math.min(num, minProduct[(i - 1) % 2] * num);
} else {
maxProduct[i % 2] = Math.max(num, minProduct[(i - 1) % 2] * num);
minProduct[i % 2] = Math.min(num, maxProduct[(i - 1) % 2] * num);
}
max = Math.max(max, maxProduct[i % 2]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_1 = var_0 . length ;
int [ ] var_2 = new int [ 2 ] , var_3 = new int [ 2 ] ;
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 % 2 ] = Math . max ( var_5 , var_2 [ ( var_4 - 1 ) % 2 ] * var_5 ) ;
var_3 [ var_4 % 2 ] = Math . min ( var_5 , var_3 [ ( var_4 - 1 ) % 2 ] * var_5 ) ;
}
else {
var_2 [ var_4 % 2 ] = Math . max ( var_5 , var_3 [ ( var_4 - 1 ) % 2 ] * var_5 ) ;
var_3 [ var_4 % 2 ] = Math . min ( var_5 , var_2 [ ( var_4 - 1 ) % 2 ] * var_5 ) ;
}
max = Math . max ( max , var_2 [ var_4 % 2 ] ) ;
}
return max ;
}
| 3 | 0<SEP>1<SEP>2 |
743 | <awangdev>200. Number of Islands_1.java | private boolean validateInput(char[][] 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 ( char [ ] [ ] 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' ;
}
| 2 | 0<SEP><S_QUOTE>0<S_QUOTE> |
744 | <awangdev>259. 3Sum Smaller_1.java | public int threeSumSmaller(int[] nums, int target) {
if (nums == null || nums.length <= 2) {
return 0;
}
Arrays.sort(nums);
int count = 0;
for (int i = 0; i < nums.length - 2; i++) {
int start = i + 1, end = nums.length - 1;
while (start < end) {
if (nums[i] + nums[start] + nums[end] < target) {
count += end - start;
start++;
} else {
end--;
}
}
}
return count;
} | 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 , 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_2 += var_5 - var_4 ;
var_4 ++ ;
}
else {
var_5 -- ;
}
}
}
return var_2 ;
}
| 3 | 0<SEP>1<SEP>2 |
745 | <awangdev>91. Decode Ways_1.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> |
746 | <awangdev>K Empty Slots_2.java | public int kEmptySlots(int[] flowers, int k) {
if (flowers == null || flowers.length == 0 || k < 0) {
return - 1;
}
int n = flowers.length;
int[] days = new int[n];
for (int i = 0; i < n; i++) {
days[flowers[i] - 1] = i + 1;
}
int left = 0, right = k + 1, result = Integer.MAX_VALUE;
for (int i = 0; right < n; i++) {
if (days[i] < days[left] || days[i] <= days[right]) {
if (i == right) {
result = Math.min(result, Math.max(days[left], days[right]));
}
left = i;
right = k + 1 + i;
}
}
return result == Integer.MAX_VALUE ? - 1 : result;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 < 0 ) {
return - 1 ;
}
int var_2 = var_0 . length ;
int [ ] var_3 = new int [ var_2 ] ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
var_3 [ var_0 [ var_4 ] - 1 ] = var_4 + 1 ;
}
int var_5 = 0 , var_6 = var_1 + 1 , var_7 = Integer . MAX_VALUE ;
for ( int var_4 = 0 ;
var_6 < var_2 ;
var_4 ++ ) {
if ( var_3 [ var_4 ] < var_3 [ var_5 ] || var_3 [ var_4 ] <= var_3 [ var_6 ] ) {
if ( var_4 == var_6 ) {
var_7 = Math . min ( var_7 , Math . max ( var_3 [ var_5 ] , var_3 [ var_6 ] ) ) ;
}
var_5 = var_4 ;
var_6 = var_1 + 1 + var_4 ;
}
}
return var_7 == Integer . MAX_VALUE ? - 1 : var_7 ;
}
| 2 | 0<SEP>1 |
747 | <awangdev>1. Two Sum_1.java | public int[] twoSum(int[] nums, int target) {
int[] rst = new int[2];
if (nums == null || nums.length <= 1) return rst;
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
if (map.containsKey(target - nums[i])) {
rst[0] = map.get(target - nums[i]);
rst[1] = i;
break;
}
map.put(nums[i], i);
}
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
int [ ] var_2 = new int [ 2 ] ;
if ( var_0 == null || var_0 . length <= 1 ) return var_2 ;
Map < Integer , Integer > var_3 = new HashMap < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
if ( var_3 . containsKey ( var_1 - var_0 [ var_4 ] ) ) {
var_2 [ 0 ] = var_3 . get ( var_1 - var_0 [ var_4 ] ) ;
var_2 [ 1 ] = var_4 ;
break ;
}
var_3 . put ( var_0 [ var_4 ] , var_4 ) ;
}
return var_2 ;
}
| 3 | 1<SEP>0<SEP>2 |
748 | <awangdev>Paint Fence_1.java | public int numWays(int n, int k) {
if (n <= 1 || k <= 0) {
return n * k;
}
int[] dp = new int[n + 1];
dp[0] = 0;
dp[1] = k;
dp[2] = k + k * (k - 1);
for (int i = 3; i <= n; i++) {
dp[i] = (k - 1) * (dp[i - 1] + dp[i - 2]);
}
return dp[n];
} | 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 [ var_0 + 1 ] ;
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 ] = ( var_1 - 1 ) * ( var_2 [ var_3 - 1 ] + var_2 [ var_3 - 2 ] ) ;
}
return var_2 [ var_0 ] ;
}
| 4 | 3<SEP>1<SEP>0<SEP>2 |
749 | <awangdev>121. Best Time to Buy and Sell Stock_4.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int n = prices.length;
int[] dp = new int[2];
dp[0] = Integer.MAX_VALUE;
int profit = 0;
for (int i = 1; i <= n; i++) {
dp[i % 2] = Math.min(dp[(i - 1) % 2], prices[i - 1]);
profit = Math.max(profit, prices[i - 1] - dp[i % 2]);
}
return profit;
} | 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 ] = Integer . MAX_VALUE ;
int var_3 = 0 ;
for ( int var_4 = 1 ;
var_4 <= var_1 ;
var_4 ++ ) {
var_2 [ var_4 % 2 ] = Math . min ( var_2 [ ( var_4 - 1 ) % 2 ] , var_0 [ var_4 - 1 ] ) ;
var_3 = Math . max ( var_3 , var_0 [ var_4 - 1 ] - var_2 [ var_4 % 2 ] ) ;
}
return var_3 ;
}
| 3 | 0<SEP>1<SEP>2 |
750 | <awangdev>567. Permutation in String_3.java | private boolean zeroCount(int[] count) {
for (int i = 0; i < 26; i++) {
if (count[i] != 0) return false;
}
return true;
} | private boolean var_0 ( int [ ] var_1 ) {
for ( int var_2 = 0 ;
var_2 < 26 ;
var_2 ++ ) {
if ( var_1 [ var_2 ] != 0 ) return false ;
}
return true ;
}
| 2 | 0<SEP>26 |
751 | <awangdev>1213. Intersection of Three Sorted Arrays_1.java | private Set<Integer> toSet(int[] nums) {
Set<Integer> set = new HashSet<>();
for (int num : nums) set.add(num);
return set;
} | private Set < Integer > var_0 ( int [ ] var_1 ) {
Set < Integer > var_2 = new HashSet < > ( ) ;
for ( int var_3 : var_1 ) var_2 . add ( var_3 ) ;
return var_2 ;
}
| 0 | null |
752 | <awangdev>Best Time to Buy and Sell Stock with Transaction Fee_2.java | public int maxProfit(int[] prices, int fee) {
if (prices == null || prices.length <= 1) return 0;
int n = prices.length;
int[][] dp = new int[2][2];
dp[0][0] = dp[0][1] = 0;
dp[1][1] = 0;
dp[1][0] = - prices[0];
for (int i = 2; i <= n; i++) {
dp[i%2][0] = Math.max(dp[(i - 1)%2][0], dp[(i - 1)%2][1] - prices[i - 1]);
dp[i%2][1] = Math.max(dp[(i - 1)%2][1], dp[(i - 1)%2][0] + prices[i - 1] - fee);
}
return dp[n%2][1];
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length <= 1 ) return 0 ;
int var_2 = var_0 . length ;
int [ ] [ ] var_3 = new int [ 2 ] [ 2 ] ;
var_3 [ 0 ] [ 0 ] = var_3 [ 0 ] [ 1 ] = 0 ;
var_3 [ 1 ] [ 1 ] = 0 ;
var_3 [ 1 ] [ 0 ] = - var_0 [ 0 ] ;
for ( int var_4 = 2 ;
var_4 <= var_2 ;
var_4 ++ ) {
var_3 [ var_4 % 2 ] [ 0 ] = Math . max ( var_3 [ ( var_4 - 1 ) % 2 ] [ 0 ] , var_3 [ ( var_4 - 1 ) % 2 ] [ 1 ] - var_0 [ var_4 - 1 ] ) ;
var_3 [ var_4 % 2 ] [ 1 ] = Math . max ( var_3 [ ( var_4 - 1 ) % 2 ] [ 1 ] , var_3 [ ( var_4 - 1 ) % 2 ] [ 0 ] + var_0 [ var_4 - 1 ] - var_1 ) ;
}
return var_3 [ var_2 % 2 ] [ 1 ] ;
}
| 3 | 1<SEP>0<SEP>2 |
753 | <awangdev>Coins in a Line_5.java | public boolean firstWillWin(int n) {
if (n <= 0) {
return false;
}
return n % 3 != 0;
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
return var_1 % 3 != 0 ;
}
| 2 | 0<SEP>3 |
754 | <awangdev>Count 1 in Binary_2.java | public int countOnes(int num) {
if (num < 0) {
return 0;
}
String bits = Integer.toBinaryString(num);
char[] bitArray = bits.toCharArray();
int sum = 0;
for (int i = 0; i < bitArray.length; i++) {
sum += Character.getNumericValue(bitArray[i]);
}
return sum;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 < 0 ) {
return 0 ;
}
String var_1 = Integer . toBinaryString ( var_0 ) ;
char [ ] var_2 = var_1 . toCharArray ( ) ;
int var_3 = 0 ;
for ( int var_4 = 0 ;
var_4 < var_2 . length ;
var_4 ++ ) {
var_3 += Character . getNumericValue ( var_2 [ var_4 ] ) ;
}
return var_3 ;
}
| 1 | 0 |
756 | <awangdev>402. Remove K Digits_1.java | public String removeKdigits(String num, int k) {
Stack<Character> stack = new Stack<>();
int i = 0, n = num.length();
while (i < n) {
char c = num.charAt(i++);
while (k > 0 && !stack.isEmpty() && stack.peek() > c) {
stack.pop();
k--;
}
stack.push(c);
}
while (k-- > 0) stack.pop();
StringBuffer sb = new StringBuffer();
while(!stack.isEmpty()) sb.append(stack.pop());
sb.reverse();
while(sb.length() > 0 && sb.charAt(0) == '0') sb.deleteCharAt(0);
return sb.length() == 0 ? "0" : sb.toString();
} | public String var_0 ( String var_1 , int var_2 ) {
Stack < Character > var_3 = new Stack < > ( ) ;
int var_4 = 0 , var_5 = var_1 . length ( ) ;
while ( var_4 < var_5 ) {
char var_6 = var_1 . charAt ( var_4 ++ ) ;
while ( var_2 > 0 && ! var_3 . isEmpty ( ) && var_3 . peek ( ) > var_6 ) {
var_3 . pop ( ) ;
var_2 -- ;
}
var_3 . push ( var_6 ) ;
}
while ( var_2 -- > 0 ) var_3 . pop ( ) ;
StringBuffer var_7 = new StringBuffer ( ) ;
while ( ! var_3 . isEmpty ( ) ) var_7 . append ( var_3 . pop ( ) ) ;
var_7 . reverse ( ) ;
while ( var_7 . length ( ) > 0 && var_7 . charAt ( 0 ) == '0' ) var_7 . deleteCharAt ( 0 ) ;
return var_7 . length ( ) == 0 ? "0" : var_7 . toString ( ) ;
}
| 3 | <D_QUOTE>0<D_QUOTE><SEP>0<SEP><S_QUOTE>0<S_QUOTE> |
757 | <awangdev>169. Majority Element_3.java | private int countInRange(int[] nums, int value, int lo, int hi) {
int count = 0;
for (int i = lo; i <= hi; i++) {
if (nums[i] == value) count++;
}
return count;
} | private int sample_funcname ( int [ ] var_0 , int var_1 , int var_2 , int var_3 ) {
int var_4 = 0 ;
for ( int var_5 = var_2 ;
var_5 <= var_3 ;
var_5 ++ ) {
if ( var_0 [ var_5 ] == var_1 ) var_4 ++ ;
}
return var_4 ;
}
| 1 | 0 |
758 | <awangdev>921. Minimum Add to Make Parentheses Valid_1.java | public int minAddToMakeValid(String s) {
if (s == null || s.length() == 0) {
return 0;
}
Stack<Character> stack = new Stack<>();
int count = 0;
for (char c : s.toCharArray()) {
if (c == '(') stack.push(c);
else if (stack.isEmpty()) count++;
else stack.pop();
}
return count + stack.size();
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
Stack < Character > var_1 = new Stack < > ( ) ;
int var_2 = 0 ;
for ( char var_3 : var_0 . toCharArray ( ) ) {
if ( var_3 == '(' ) var_1 . push ( var_3 ) ;
else if ( var_1 . isEmpty ( ) ) var_2 ++ ;
else var_1 . pop ( ) ;
}
return var_2 + var_1 . size ( ) ;
}
| 2 | 0<SEP><S_QUOTE>(<S_QUOTE> |
759 | <awangdev>Longest Common Subsequence_2.java | public int longestCommonSubsequence(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[2][n + 1];
int curr = 1;
int prev = 0;
for (int i = 1; i <= m; i++) {
prev = curr;
curr = 1 - prev;
for (int j = 1; j <= n; j++) {
if(i == 0 || j == 0) {
dp[i][j] = 0;
continue;
}
dp[curr][j] = Math.max(dp[prev][j], dp[curr][j - 1]);
if (A.charAt(i - 1) == B.charAt(j - 1)) {
dp[curr][j] = Math.max(dp[curr][j], dp[prev][j - 1] + 1);
}
}
}
return dp[curr][n];
} | 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 [ 2 ] [ var_3 + 1 ] ;
int var_5 = 1 ;
int var_6 = 0 ;
for ( int var_7 = 1 ;
var_7 <= var_2 ;
var_7 ++ ) {
var_6 = var_5 ;
var_5 = 1 - var_6 ;
for ( int var_8 = 1 ;
var_8 <= var_3 ;
var_8 ++ ) {
if ( var_7 == 0 || var_8 == 0 ) {
var_4 [ var_7 ] [ var_8 ] = 0 ;
continue ;
}
var_4 [ var_5 ] [ var_8 ] = Math . max ( var_4 [ var_6 ] [ var_8 ] , var_4 [ var_5 ] [ var_8 - 1 ] ) ;
if ( var_0 . charAt ( var_7 - 1 ) == var_1 . charAt ( var_8 - 1 ) ) {
var_4 [ var_5 ] [ var_8 ] = Math . max ( var_4 [ var_5 ] [ var_8 ] , var_4 [ var_6 ] [ var_8 - 1 ] + 1 ) ;
}
}
}
return var_4 [ var_5 ] [ var_3 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
760 | <awangdev>Power of Three_3.java | public boolean isPowerOfThree(int n) {
while (n/3>=1){
if (n%3!=0) return false;
n/=3;
}
return n==1;
} | public boolean var_0 ( int var_1 ) {
while ( var_1 / 3 >= 1 ) {
if ( var_1 % 3 != 0 ) return false ;
var_1 /= 3 ;
}
return var_1 == 1 ;
}
| 3 | 0<SEP>1<SEP>3 |
761 | <awangdev>274.H-Index_1.java | public int hIndex(int[] citations) {
if (citations == null || citations.length == 0) {
return 0;
}
int n = citations.length;
int[] bucket = new int[n + 1];
for (int i = 0; i < n; i++) {
int bucketSlot = citations[i];
if (bucketSlot <= n) bucket[bucketSlot]++;
else bucket[n]++;
}
int sum = 0;
for (int h = n; h >= 0; h--) {
sum += bucket[h];
if (sum >= h) return h;
}
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 = new int [ var_1 + 1 ] ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) {
int var_4 = var_0 [ var_3 ] ;
if ( var_4 <= var_1 ) var_2 [ var_4 ] ++ ;
else var_2 [ var_1 ] ++ ;
}
int var_5 = 0 ;
for ( int var_6 = var_1 ;
var_6 >= 0 ;
var_6 -- ) {
var_5 += var_2 [ var_6 ] ;
if ( var_5 >= var_6 ) return var_6 ;
}
return 0 ;
}
| 2 | 0<SEP>1 |
762 | <awangdev>[lint]. Recover Rotated Sorted Array_1.java | public void reverse(ArrayList<Integer> nums, int start, int end){
for (int i = start, j = end; i < j; i++,j--) {
int temp = nums.get(i);
nums.set(i, nums.get(j));
nums.set(j, temp);
}
} | public void var_0 ( ArrayList < Integer > var_1 , int var_2 , int var_3 ) {
for ( int var_4 = var_2 , var_5 = var_3 ;
var_4 < var_5 ;
var_4 ++ , var_5 -- ) {
int var_6 = var_1 . get ( var_4 ) ;
var_1 . set ( var_4 , var_1 . get ( var_5 ) ) ;
var_1 . set ( var_5 , var_6 ) ;
}
}
| 0 | null |
763 | <awangdev>Find Minimum in Rotated Sorted Array_2.java | public int findMin(int[] num) {
if (num == null || num.length == 0) {
return -1;
}
int start = 0;
int end = num.length - 1;
int mid = 0;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (num[mid] > num[end]) {
start = mid;
} else {
end = mid;
}
}
if (num[start] < num[end]) {
return num[start];
} else {
return num[end];
}
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_1 = 0 ;
int var_2 = var_0 . length - 1 ;
int var_3 = 0 ;
while ( var_1 + 1 < var_2 ) {
var_3 = var_1 + ( var_2 - var_1 ) / 2 ;
if ( var_0 [ var_3 ] > var_0 [ var_2 ] ) {
var_1 = var_3 ;
}
else {
var_2 = var_3 ;
}
}
if ( var_0 [ var_1 ] < var_0 [ var_2 ] ) {
return var_0 [ var_1 ] ;
}
else {
return var_0 [ var_2 ] ;
}
}
| 3 | 2<SEP>0<SEP>1 |
764 | <awangdev>Palindrome Partitioning II_3.java | public int minCut(String s) {
if (s == null || s.length() == 0) {
return 0;
}
int length = s.length();
boolean[][] isPal = new boolean[length][length];
int[] cut = new int[length];
for (int j = 0; j < length; j++) {
cut[j] = j;
for (int i = 0; i <= j; i++) {
if (s.charAt(i) == s.charAt(j) && (j - i <= 1 || isPal[i + 1][j - 1])) {
isPal[i][j] = true;
if (i > 0) {
cut[j] = Math.min(cut[j], cut[i - 1] + 1);
} else {
cut[j] = 0;
}
}
}
}
return cut[length - 1];
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
int length = var_0 . length ( ) ;
boolean [ ] [ ] var_1 = new boolean [ length ] [ length ] ;
int [ ] var_2 = new int [ length ] ;
for ( int var_3 = 0 ;
var_3 < length ;
var_3 ++ ) {
var_2 [ var_3 ] = var_3 ;
for ( int var_4 = 0 ;
var_4 <= var_3 ;
var_4 ++ ) {
if ( var_0 . charAt ( var_4 ) == var_0 . charAt ( var_3 ) && ( var_3 - var_4 <= 1 || var_1 [ var_4 + 1 ] [ var_3 - 1 ] ) ) {
var_1 [ var_4 ] [ var_3 ] = true ;
if ( var_4 > 0 ) {
var_2 [ var_3 ] = Math . min ( var_2 [ var_3 ] , var_2 [ var_4 - 1 ] + 1 ) ;
}
else {
var_2 [ var_3 ] = 0 ;
}
}
}
}
return var_2 [ length - 1 ] ;
}
| 2 | 0<SEP>1 |
765 | <awangdev>Walls and Gates_1.java | private boolean validateCoordinate(int[][] rooms, int x, int y) {
return x < 0 || x >= rooms.length || y < 0 || y >= rooms[0].length || rooms[x][y] == -1 || rooms[x][y] == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 < 0 || var_2 >= var_1 . length || var_3 < 0 || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] == - 1 || var_1 [ var_2 ] [ var_3 ] == 0 ;
}
| 2 | 0<SEP>1 |
766 | <awangdev>Search for a Range_1.java | public int[] searchRange(int[] A, int target) {
int[] rst = new int[]{-1, -1};
if (A == null || A.length == 0) {
return rst;
}
int start = 0;
int end = A.length - 1;
int mid = start + (end - start)/2;
int first = 0;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
if (mid - 1 >= 0 && A[mid - 1] == target) {
end = mid;
continue;
}
break;
} else if (A[mid] < target) {
start = mid;
} else {
end = mid;
}
}
if (A[start] == target) {
first = start;
} else if (A[mid] == target) {
first = mid;
} else if (A[end] == target) {
first = end;
} else {
return rst;
}
int last = first;
start = first;
end = A.length - 1;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
if (mid + 1 < A.length && A[mid + 1] == target) {
start = mid;
continue;
}
break;
} else if (A[mid] < target) {
start = mid;
} else {
end = mid;
}
}
if (A[end] == target) {
last = end;
} else if (A[mid] == target) {
last = mid;
} else if (A[start] == target) {
last = start;
}
rst[0] = first;
rst[1] = last;
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
int [ ] var_2 = new int [ ] {
- 1 , - 1 };
if ( var_0 == null || var_0 . length == 0 ) {
return var_2 ;
}
int var_3 = 0 ;
int var_4 = var_0 . length - 1 ;
int var_5 = var_3 + ( var_4 - var_3 ) / 2 ;
int var_6 = 0 ;
while ( var_3 + 1 < var_4 ) {
var_5 = var_3 + ( var_4 - var_3 ) / 2 ;
if ( var_0 [ var_5 ] == var_1 ) {
if ( var_5 - 1 >= 0 && var_0 [ var_5 - 1 ] == var_1 ) {
var_4 = var_5 ;
continue ;
}
break ;
}
else if ( var_0 [ var_5 ] < var_1 ) {
var_3 = var_5 ;
}
else {
var_4 = var_5 ;
}
}
if ( var_0 [ var_3 ] == var_1 ) {
var_6 = var_3 ;
}
else if ( var_0 [ var_5 ] == var_1 ) {
var_6 = var_5 ;
}
else if ( var_0 [ var_4 ] == var_1 ) {
var_6 = var_4 ;
}
else {
return var_2 ;
}
int var_7 = var_6 ;
var_3 = var_6 ;
var_4 = var_0 . length - 1 ;
while ( var_3 + 1 < var_4 ) {
var_5 = var_3 + ( var_4 - var_3 ) / 2 ;
if ( var_0 [ var_5 ] == var_1 ) {
if ( var_5 + 1 < var_0 . length && var_0 [ var_5 + 1 ] == var_1 ) {
var_3 = var_5 ;
continue ;
}
break ;
}
else if ( var_0 [ var_5 ] < var_1 ) {
var_3 = var_5 ;
}
else {
var_4 = var_5 ;
}
}
if ( var_0 [ var_4 ] == var_1 ) {
var_7 = var_4 ;
}
else if ( var_0 [ var_5 ] == var_1 ) {
var_7 = var_5 ;
}
else if ( var_0 [ var_3 ] == var_1 ) {
var_7 = var_3 ;
}
var_2 [ 0 ] = var_6 ;
var_2 [ 1 ] = var_7 ;
return var_2 ;
}
| 3 | 1<SEP>0<SEP>2 |
767 | <awangdev>Ugly Number II_2.java | private void populate(PriorityQueue<Long> candidate, HashSet<Long> set, long[] dp, long last, int factor) {
long nextCandidate = last * factor;
if (!set.contains(nextCandidate)) {
candidate.add(nextCandidate);
set.add(nextCandidate);
}
} | private void var_0 ( PriorityQueue < Long > var_1 , HashSet < Long > var_2 , long [ ] var_3 , long var_4 , int var_5 ) {
long var_6 = var_4 * var_5 ;
if ( ! var_2 . contains ( var_6 ) ) {
var_1 . add ( var_6 ) ;
var_2 . add ( var_6 ) ;
}
}
| 0 | null |
768 | <awangdev>Longest Increasing Continuous subsequence II_1.java | public int dfs(int[][] A, int[][] dp, int[][] flag, int i, int j, int n, int m) {
if (flag[i][j] == 1) {
return dp[i][j];
}
int ans = 1;
flag[i][j] = -1;
int[] dx = {0, 0, 1, -1};
int[] dy = {1, -1, 0, 0};
for (int k = 0; k < dx.length; k++) {
int id = i + dx[k];
int jd = j + dy[k];
if (id >= 0 && id < n && jd >= 0 && jd < m && A[i][j] < A[id][jd]) {
ans = Math.max(ans, dfs(A, dp, flag, id, jd, n, m) + 1);
}
}
flag[i][j] = 1;
dp[i][j] = ans;
return dp[i][j];
} | public int sample_funcname ( int [ ] [ ] A , int [ ] [ ] dp , int [ ] [ ] flag , int i , int j , int n , int m ) {
if ( flag [ i ] [ j ] == 1 ) {
return dp [ i ] [ j ] ;
}
int ans = 1 ;
flag [ i ] [ j ] = - 1 ;
int [ ] dx = {
0 , 0 , 1 , - 1 };
int [ ] dy = {
1 , - 1 , 0 , 0 };
for ( int k = 0 ;
k < dx . length ;
k ++ ) {
int id = i + dx [ k ] ;
int jd = j + dy [ k ] ;
if ( id >= 0 && id < n && jd >= 0 && jd < m && A [ i ] [ j ] < A [ id ] [ jd ] ) {
ans = Math . max ( ans , dfs ( A , dp , flag , id , jd , n , m ) + 1 ) ;
}
}
flag [ i ] [ j ] = 1 ;
dp [ i ] [ j ] = ans ;
return dp [ i ] [ j ] ;
}
| 2 | 1<SEP>0 |
769 | <awangdev>125. Valid Palindrome_3.java | public boolean isPalindrome(String s) {
if (s == null || s.length() == 0) {
return true;
}
StringBuffer sb = new StringBuffer();
s = s.toLowerCase();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if ((c <= 'z' && c >= 'a') || (c >= '0' && c <= '9')) {
sb.append(s.charAt(i));
}
}
s = sb.toString();
int start = 0;
int end = s.length() - 1;
while (start < end) {
if (s.charAt(start) != s.charAt(end)) {
return false;
}
start++;
end--;
}
return true;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return true ;
}
StringBuffer var_2 = new StringBuffer ( ) ;
var_1 = var_1 . toLowerCase ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ( ) ;
var_3 ++ ) {
char var_4 = var_1 . charAt ( var_3 ) ;
if ( ( var_4 <= 'z' && var_4 >= 'a' ) || ( var_4 >= '0' && var_4 <= '9' ) ) {
var_2 . append ( var_1 . charAt ( var_3 ) ) ;
}
}
var_1 = var_2 . toString ( ) ;
int var_5 = 0 ;
int var_6 = var_1 . length ( ) - 1 ;
while ( var_5 < var_6 ) {
if ( var_1 . charAt ( var_5 ) != var_1 . charAt ( var_6 ) ) {
return false ;
}
var_5 ++ ;
var_6 -- ;
}
return true ;
}
| 6 | <S_QUOTE>9<S_QUOTE><SEP>0<SEP>1<SEP><S_QUOTE>z<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP><S_QUOTE>a<S_QUOTE> |
770 | <awangdev>Sum of Two Integers_2.java | public int aplusb(int a, int b) {
int numA = a;
int numB = b;
int incompleteSum = 0;
while (numB != 0) {
incompleteSum = numA ^ numB;
numB = (numA & numB) << 1;
numA = incompleteSum;
}
return incompleteSum;
} | public int sample_funcname ( int var_0 , int var_1 ) {
int var_2 = var_0 ;
int var_3 = var_1 ;
int var_4 = 0 ;
while ( var_3 != 0 ) {
var_4 = var_2 ^ var_3 ;
var_3 = ( var_2 & var_3 ) << 1 ;
var_2 = var_4 ;
}
return var_4 ;
}
| 2 | 0<SEP>1 |
771 | <awangdev>204. Count Primes_2.java | public boolean isPrime(int num) {
if (num <= 1) return false;
for (int i = 2; i * i <= num; i++) {
if (num % i == 0) {
return false;
}
}
return true;
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 1 ) return false ;
for ( int var_2 = 2 ;
var_2 * var_2 <= var_1 ;
var_2 ++ ) {
if ( var_1 % var_2 == 0 ) {
return false ;
}
}
return true ;
}
| 3 | 1<SEP>0<SEP>2 |
772 | <awangdev>448. Find All Numbers Disappeared in an Array_2.java | public List<Integer> findDisappearedNumbers(int[] nums) {
final List<Integer> rst = new ArrayList<Integer>();
if (nums == null || nums.length == 0) return rst;
for (int i = 0; i < nums.length; i++) {
int desiredIndex = Math.abs(nums[i]) - 1;
nums[desiredIndex] = -Math.abs(nums[desiredIndex]);
}
for (int i = 0; i < nums.length; i++) {
if (nums[i] > 0) rst.add(i + 1);
}
return rst;
} | public List < Integer > var_0 ( int [ ] var_1 ) {
final List < Integer > var_2 = new ArrayList < Integer > ( ) ;
if ( var_1 == null || var_1 . length == 0 ) return var_2 ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
int var_4 = Math . abs ( var_1 [ var_3 ] ) - 1 ;
var_1 [ var_4 ] = - Math . abs ( var_1 [ var_4 ] ) ;
}
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
if ( var_1 [ var_3 ] > 0 ) var_2 . add ( var_3 + 1 ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
773 | <awangdev>Ugly Number_3.java | public long kthPrimeNumber(int k) {
if (k == 0) {
return 0;
}
ArrayList<Long> set = new ArrayList<Long>();
PriorityQueue<Long> queue = new PriorityQueue<Long>();
queue.offer((long)3);
queue.offer((long)5);
queue.offer((long)7);
set.add((long)3);
set.add((long)5);
set.add((long)7);
long num = 0;
for (int i = 0; i < k; i++) {
num = queue.poll();
if (!set.contains(num * 3)) {
queue.offer(num * 3);
set.add(num * 3);
}
if (!set.contains(num * 5)) {
queue.offer(num * 5);
set.add(num * 5);
}
if (!set.contains(num * 7)) {
queue.offer(num * 7);
set.add(num * 7);
}
}
return num;
} | public long sample_funcname ( int var_0 ) {
if ( var_0 == 0 ) {
return 0 ;
}
ArrayList < Long > var_1 = new ArrayList < Long > ( ) ;
PriorityQueue < Long > var_2 = new PriorityQueue < Long > ( ) ;
var_2 . offer ( ( long ) 3 ) ;
var_2 . offer ( ( long ) 5 ) ;
var_2 . offer ( ( long ) 7 ) ;
var_1 . add ( ( long ) 3 ) ;
var_1 . add ( ( long ) 5 ) ;
var_1 . add ( ( long ) 7 ) ;
long var_3 = 0 ;
for ( int var_4 = 0 ;
var_4 < var_0 ;
var_4 ++ ) {
var_3 = var_2 . poll ( ) ;
if ( ! var_1 . contains ( var_3 * 3 ) ) {
var_2 . offer ( var_3 * 3 ) ;
var_1 . add ( var_3 * 3 ) ;
}
if ( ! var_1 . contains ( var_3 * 5 ) ) {
var_2 . offer ( var_3 * 5 ) ;
var_1 . add ( var_3 * 5 ) ;
}
if ( ! var_1 . contains ( var_3 * 7 ) ) {
var_2 . offer ( var_3 * 7 ) ;
var_1 . add ( var_3 * 7 ) ;
}
}
return var_3 ;
}
| 4 | 7<SEP>0<SEP>3<SEP>5 |
774 | <awangdev>844. Backspace String Compare_1.java | private int backtrack(String s, int index) {
int i = index, count = 0;
while (i >= 0) {
if (s.charAt(i) == '#') {
count++;
i--;
} else if (count > 0) {
count--;
i--;
} else break;
}
return i;
} | private int sample_funcname ( String var_0 , int var_1 ) {
int var_2 = var_1 , var_3 = 0 ;
while ( var_2 >= 0 ) {
if ( var_0 . charAt ( var_2 ) == '#' ) {
var_3 ++ ;
var_2 -- ;
}
else if ( var_3 > 0 ) {
var_3 -- ;
var_2 -- ;
}
else break ;
}
return var_2 ;
}
| 2 | <S_QUOTE>#<S_QUOTE><SEP>0 |
775 | <awangdev>Longest Increasing Continuous subsequence_3.java | public int longestIncreasingContinuousSubsequence(int[] A) {
if (A == null || A.length == 0) {
return -1;
}
int maxLength1 = 0;
int maxLength2 = 0;
int track = 1;
for (int i = 1; i < A.length; i++) {
if (A[i] > A[i - 1]) {
track++;
} else {
maxLength1 = track > maxLength1 ? track : maxLength1;
track = 1;
}
}
maxLength1 = track > maxLength1 ? track : maxLength1;
track = 1;
for (int i = A.length - 2; i >= 0; i--) {
if (A[i] > A[i + 1]) {
track++;
} else {
maxLength2 = track > maxLength2 ? track : maxLength2;
track = 1;
}
}
maxLength2 = track > maxLength2 ? track : maxLength2;
return maxLength1 > maxLength2 ? maxLength1 : maxLength2;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_1 = 0 ;
int var_2 = 0 ;
int var_3 = 1 ;
for ( int var_4 = 1 ;
var_4 < var_0 . length ;
var_4 ++ ) {
if ( var_0 [ var_4 ] > var_0 [ var_4 - 1 ] ) {
var_3 ++ ;
}
else {
var_1 = var_3 > var_1 ? var_3 : var_1 ;
var_3 = 1 ;
}
}
var_1 = var_3 > var_1 ? var_3 : var_1 ;
var_3 = 1 ;
for ( int var_4 = var_0 . length - 2 ;
var_4 >= 0 ;
var_4 -- ) {
if ( var_0 [ var_4 ] > var_0 [ var_4 + 1 ] ) {
var_3 ++ ;
}
else {
var_2 = var_3 > var_2 ? var_3 : var_2 ;
var_3 = 1 ;
}
}
var_2 = var_3 > var_2 ? var_3 : var_2 ;
return var_1 > var_2 ? var_1 : var_2 ;
}
| 3 | 2<SEP>0<SEP>1 |
776 | <awangdev>Perfect Squares_1.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++) {
if (i >= j * j) {
dp[i] = Math.min(dp[i], dp[i - j * j] + 1);
} else {
break;
}
}
}
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 ++ ) {
if ( var_2 >= var_3 * var_3 ) {
var_1 [ var_2 ] = Math . min ( var_1 [ var_2 ] , var_1 [ var_2 - var_3 * var_3 ] + 1 ) ;
}
else {
break ;
}
}
}
return var_1 [ var_0 ] ;
}
| 2 | 1<SEP>0 |
777 | <awangdev>31. Next Permutation_3.java | private void swap(int[] nums, int a, int b) {
int temp = nums[a];
nums[a] = nums[b];
nums[b] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
| 0 | null |
778 | <awangdev>52. N-Queens II_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 |
779 | <awangdev>88. Merge Sorted Array_2.java | public void merge(int[] nums1, int m, int[] nums2, int n) {
m--; n--;
while (m >= 0 || n >= 0) {
if (m >= 0 && n >= 0) {
nums1[m + n + 1] = nums1[m] > nums2[n] ? nums1[m--] : nums2[n--];
} else if (m < 0) {
nums1[n] = nums2[n--];
} else if (n < 0) {
break;
}
}
} | public void var_0 ( int [ ] var_1 , int var_2 , int [ ] var_3 , int var_4 ) {
var_2 -- ;
var_4 -- ;
while ( var_2 >= 0 || var_4 >= 0 ) {
if ( var_2 >= 0 && var_4 >= 0 ) {
var_1 [ var_2 + var_4 + 1 ] = var_1 [ var_2 ] > var_3 [ var_4 ] ? var_1 [ var_2 -- ] : var_3 [ var_4 -- ] ;
}
else if ( var_2 < 0 ) {
var_1 [ var_4 ] = var_3 [ var_4 -- ] ;
}
else if ( var_4 < 0 ) {
break ;
}
}
}
| 2 | 0<SEP>1 |
780 | <awangdev>Classical Binary Search_1.java | public int findPosition(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return -1;
}
int start = 0;
int end = nums.length - 1;
while (start + 1 < end) {
int mid = start + ((end - start) >> 1);
if (nums[mid] == target) {
return mid;
} else if (nums[mid] < target) {
start = mid;
} else {
end = mid;
}
}
if (nums[start] == target) {
return start;
}
if (nums[end] == target) {
return end;
}
return -1;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_2 = 0 ;
int var_3 = var_0 . length - 1 ;
while ( var_2 + 1 < var_3 ) {
int var_4 = var_2 + ( ( var_3 - var_2 ) >> 1 ) ;
if ( var_0 [ var_4 ] == var_1 ) {
return var_4 ;
}
else if ( var_0 [ var_4 ] < var_1 ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
if ( var_0 [ var_2 ] == var_1 ) {
return var_2 ;
}
if ( var_0 [ var_3 ] == var_1 ) {
return var_3 ;
}
return - 1 ;
}
| 2 | 0<SEP>1 |
781 | <awangdev>Triangles_1.java | public int minimumTotal(List<List<Integer>> triangle) {
if (triangle == null || triangle.size() == 0) {
return 0;
}
int n = triangle.size();
int[][] dp = new int[n][n];
for (int j = 0; j < n; j++) {
dp[n - 1][j] = triangle.get(n - 1).get(j);
}
for (int i = n - 2; i >= 0; i--) {
for (int j = 0; j <= i; j++) {
dp[i][j] = Math.min(dp[i + 1][j], dp[i + 1][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 [ var_1 ] [ var_1 ] ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) {
var_2 [ var_1 - 1 ] [ 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 ] [ var_3 ] = Math . min ( var_2 [ var_4 + 1 ] [ var_3 ] , var_2 [ var_4 + 1 ] [ var_3 + 1 ] ) + var_0 . get ( var_4 ) . get ( var_3 ) ;
}
}
return var_2 [ 0 ] [ 0 ] ;
}
| 3 | 2<SEP>0<SEP>1 |
782 | <awangdev>QuickSort_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 |
783 | <awangdev>[tool]. MergeSort_1.java | private void merge(int[] nums, int[] temp, int start, int end) {
int leftEnd = start + (end - start) / 2;
int rightStart = leftEnd + 1;
int size = end - start + 1;
int i = start;
int j = rightStart;
int index = start;
while (i <= leftEnd && j <= end) {
if (nums[i] <= nums[j]) {
temp[index] = nums[i];
i++;
} else {
temp[index] = nums[j];
j++;
}
index++;
}
System.arraycopy(nums, i, temp, index, leftEnd - i + 1);
System.arraycopy(nums, j, temp, index, end - j + 1);
System.arraycopy(temp, start, nums, start, end - start + 1);
} | private void var_0 ( int [ ] var_1 , int [ ] var_2 , int var_3 , int var_4 ) {
int var_5 = var_3 + ( var_4 - var_3 ) / 2 ;
int var_6 = var_5 + 1 ;
int var_7 = var_4 - var_3 + 1 ;
int var_8 = var_3 ;
int var_9 = var_6 ;
int var_10 = var_3 ;
while ( var_8 <= var_5 && var_9 <= var_4 ) {
if ( var_1 [ var_8 ] <= var_1 [ var_9 ] ) {
var_2 [ var_10 ] = var_1 [ var_8 ] ;
var_8 ++ ;
}
else {
var_2 [ var_10 ] = var_1 [ var_9 ] ;
var_9 ++ ;
}
var_10 ++ ;
}
System . arraycopy ( var_1 , var_8 , var_2 , var_10 , var_5 - var_8 + 1 ) ;
System . arraycopy ( var_1 , var_9 , var_2 , var_10 , var_4 - var_9 + 1 ) ;
System . arraycopy ( var_2 , var_3 , var_1 , var_3 , var_4 - var_3 + 1 ) ;
}
| 2 | 1<SEP>2 |
784 | <awangdev>Backpack_6.java | public int backPack(int m, int[] A) {
if (A == null || m == 0) {
return 0;
}
boolean[] DP = new boolean[m + 1];
DP[0] = true;
for (int i = 1; i <= A.length; i++) {
for (int j = m; j >= 0; j--) {
if (j - A[i - 1] >= 0 && DP[j - A[i - 1]]) {
DP[j] = true;
}
}
}
for (int j = m; j >= 0; j--) {
if (DP[j]) {
return j;
}
}
return 0;
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_0 == 0 ) {
return 0 ;
}
boolean [ ] var_2 = new boolean [ var_0 + 1 ] ;
var_2 [ 0 ] = true ;
for ( int var_3 = 1 ;
var_3 <= var_1 . length ;
var_3 ++ ) {
for ( int var_4 = var_0 ;
var_4 >= 0 ;
var_4 -- ) {
if ( var_4 - var_1 [ var_3 - 1 ] >= 0 && var_2 [ var_4 - var_1 [ var_3 - 1 ] ] ) {
var_2 [ var_4 ] = true ;
}
}
}
for ( int var_4 = var_0 ;
var_4 >= 0 ;
var_4 -- ) {
if ( var_2 [ var_4 ] ) {
return var_4 ;
}
}
return 0 ;
}
| 2 | 0<SEP>1 |
785 | <awangdev>Number of Connected Components in an Undirected Graph_2.java | private void dfs(Map<Integer, List<Integer>> graph, boolean[] visited, int i) {
if (visited[i]) {
return;
}
visited[i] = true;
for (int j : graph.get(i)) {
dfs(graph, visited, j);
}
} | private void sample_funcname ( Map < Integer , List < Integer >> graph , boolean [ ] visited , int i ) {
if ( visited [ i ] ) {
return ;
}
visited [ i ] = true ;
for ( int j : graph . get ( i ) ) {
dfs ( graph , visited , j ) ;
}
}
| 0 | null |
786 | <awangdev>796. Rotate String_2.java | public void reverse(char[] A, int start, int end) {
for (int i = start, j = end; i < j; i++, j--) {
char temp = A[j];
A[j] = A[i];
A[i] = temp;
}
} | public void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
for ( int var_4 = var_2 , var_5 = var_3 ;
var_4 < var_5 ;
var_4 ++ , var_5 -- ) {
char var_6 = var_1 [ var_5 ] ;
var_1 [ var_5 ] = var_1 [ var_4 ] ;
var_1 [ var_4 ] = var_6 ;
}
}
| 0 | null |
787 | <awangdev>265. Paint House II_2.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[2][k];
for (int i = 1; i <= n; i++) {
for (int j = 0; j < k; j++) {
dp[i % 2][j] = Integer.MAX_VALUE;
for (int m = 0; m < k; m++) {
if (j == m) continue;
dp[i % 2][j] = Math.min(dp[i % 2][j], dp[(i - 1) % 2][m] + costs[i - 1][j]);
}
}
}
int min = Integer.MAX_VALUE;
for (int j = 0; j < k; j++) min = Math.min(min, dp[n % 2][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 [ 2 ] [ 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 % 2 ] [ 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 % 2 ] [ var_5 ] = Math . min ( var_3 [ var_4 % 2 ] [ var_5 ] , var_3 [ ( var_4 - 1 ) % 2 ] [ 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 % 2 ] [ var_5 ] ) ;
return min ;
}
| 3 | 2<SEP>0<SEP>1 |
788 | <awangdev>Longest Valid Parentheses_2.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 |
789 | <awangdev>Count and Say_2.java | public String countAndSay(int n) {
if (n <= 1) {
return n + "";
}
String str = "11";
int ind = 2;
while (ind < n) {
StringBuffer sb = new StringBuffer();
char[] arr = str.toCharArray();
int count = 1;
int type = Character.getNumericValue(arr[0]);
for (int i = 1; i < arr.length; i++) {
if (arr[i] == arr[i - 1]) {
count++;
} else {
sb.append(count + "" + type);
type = Character.getNumericValue(arr[i]);
count = 1;
}
}
ind++;
sb.append(count + "" + type);
str = sb.toString();
}
return str;
} | public String var_0 ( int var_1 ) {
if ( var_1 <= 1 ) {
return var_1 + "" ;
}
String var_2 = "11" ;
int var_3 = 2 ;
while ( var_3 < var_1 ) {
StringBuffer var_4 = new StringBuffer ( ) ;
char [ ] var_5 = var_2 . toCharArray ( ) ;
int var_6 = 1 ;
int var_7 = Character . getNumericValue ( var_5 [ 0 ] ) ;
for ( int var_8 = 1 ;
var_8 < var_5 . length ;
var_8 ++ ) {
if ( var_5 [ var_8 ] == var_5 [ var_8 - 1 ] ) {
var_6 ++ ;
}
else {
var_4 . append ( var_6 + "" + var_7 ) ;
var_7 = Character . getNumericValue ( var_5 [ var_8 ] ) ;
var_6 = 1 ;
}
}
var_3 ++ ;
var_4 . append ( var_6 + "" + var_7 ) ;
var_2 = var_4 . toString ( ) ;
}
return var_2 ;
}
| 5 | <D_QUOTE>11<D_QUOTE><SEP>2<SEP>1<SEP>0<SEP><D_QUOTE><D_QUOTE> |
790 | <awangdev>62. Unique Path_3.java | private String getKey(int x, int y) {
return x + "," + y;
} | private String var_0 ( int var_1 , int var_2 ) {
return var_1 + "," + var_2 ;
}
| 1 | <D_QUOTE>,<D_QUOTE> |
791 | <awangdev>Find Peak Element_1.java | public int findPeakElement(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[mid - 1] && nums[mid] > nums[mid + 1]) {
return mid;
} else if (nums[mid] > nums[mid - 1]) {
start = mid;
} else {
end = mid;
}
}
return nums[start] > nums[end] ? start : 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_4 - 1 ] && var_0 [ var_4 ] > var_0 [ var_4 + 1 ] ) {
return var_4 ;
}
else if ( var_0 [ var_4 ] > var_0 [ var_4 - 1 ] ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
return var_0 [ var_2 ] > var_0 [ var_3 ] ? var_2 : var_3 ;
}
| 2 | 0<SEP>1 |
792 | <awangdev>55. Jump Game_1.java | public boolean canJump(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
int farest = 0;
for (int i = 0; i < nums.length; i++) {
farest = Math.max(farest, i + nums[i]);
if (farest >= nums.length - 1) {
return true;
}
if (farest <= i) {
return false;
}
}
return true;
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
var_2 = Math . max ( var_2 , var_3 + var_1 [ var_3 ] ) ;
if ( var_2 >= var_1 . length - 1 ) {
return true ;
}
if ( var_2 <= var_3 ) {
return false ;
}
}
return true ;
}
| 2 | 0<SEP>1 |
793 | <awangdev>Heaters_1.java | public int findRadius(int[] houses, int[] heaters) {
int heaterIndex = 0;
int radius = 0;
int heatersLength = heaters.length;
Arrays.sort(houses);
Arrays.sort(heaters);
for (int i = 0; i < houses.length; i++) {
int housePos = houses[i];
while (heaterIndex < heatersLength - 1 && Math.abs(heaters[heaterIndex + 1] - housePos) <= Math.abs(heaters[heaterIndex] - housePos)) {
heaterIndex++;
}
radius = Math.max(radius, Math.abs(heaters[heaterIndex] - housePos));
}
return radius;
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
int var_2 = 0 ;
int var_3 = 0 ;
int var_4 = var_1 . length ;
Arrays . sort ( var_0 ) ;
Arrays . sort ( var_1 ) ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
int var_6 = var_0 [ var_5 ] ;
while ( var_2 < var_4 - 1 && Math . abs ( var_1 [ var_2 + 1 ] - var_6 ) <= Math . abs ( var_1 [ var_2 ] - var_6 ) ) {
var_2 ++ ;
}
var_3 = Math . max ( var_3 , Math . abs ( var_1 [ var_2 ] - var_6 ) ) ;
}
return var_3 ;
}
| 2 | 0<SEP>1 |
794 | <awangdev>Minimum Subarray_2.java | public int minSubArray(ArrayList<Integer> nums) {
if (nums == null || nums.size() == 0) {
return 0;
}
int curMin = nums.get(0);
int minRst = nums.get(0);
for (int i = 1; i < nums.size(); i++) {
curMin = Math.min(nums.get(i), curMin + nums.get(i));
minRst = Math.min(curMin, minRst);
}
return minRst;
} | public int sample_funcname ( ArrayList < Integer > var_0 ) {
if ( var_0 == null || var_0 . size ( ) == 0 ) {
return 0 ;
}
int var_1 = var_0 . get ( 0 ) ;
int var_2 = var_0 . get ( 0 ) ;
for ( int var_3 = 1 ;
var_3 < var_0 . size ( ) ;
var_3 ++ ) {
var_1 = Math . min ( var_0 . get ( var_3 ) , var_1 + var_0 . get ( var_3 ) ) ;
var_2 = Math . min ( var_1 , var_2 ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
795 | <awangdev>Two Sum II - Input array is sorted_1.java | public int[] twoSum(int[] numbers, int target) {
if (numbers == null || numbers.length == 0) {
return numbers;
}
final int[] result = new int[2];
int start = 0;
int end = numbers.length - 1;
while (start < end) {
long sum = (long)(numbers[start] + numbers[end]);
if (sum == target) {
result[0] = start + 1;
result[1] = end + 1;
break;
} else if (sum < target) {
start++;
} else {
end--;
}
}
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return var_0 ;
}
final int [ ] var_2 = new int [ 2 ] ;
int var_3 = 0 ;
int var_4 = var_0 . length - 1 ;
while ( var_3 < var_4 ) {
long var_5 = ( long ) ( var_0 [ var_3 ] + var_0 [ var_4 ] ) ;
if ( var_5 == var_1 ) {
var_2 [ 0 ] = var_3 + 1 ;
var_2 [ 1 ] = var_4 + 1 ;
break ;
}
else if ( var_5 < var_1 ) {
var_3 ++ ;
}
else {
var_4 -- ;
}
}
return var_2 ;
}
| 3 | 0<SEP>1<SEP>2 |
796 | <awangdev>Excel Sheet Column Number_2.java | public int titleToNumber(String s) {
if (s == null || s.length() == 0) {
return 0;
}
int num = 0;
for (int i = s.length() - 1; i >= 0; i--) {
int digit = s.charAt(i) - 'A' + 1;
num += digit * Math.pow(26, s.length() - i - 1);
}
return num;
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
int var_1 = 0 ;
for ( int var_2 = var_0 . length ( ) - 1 ;
var_2 >= 0 ;
var_2 -- ) {
int var_3 = var_0 . charAt ( var_2 ) - 'A' + 1 ;
var_1 += var_3 * Math . pow ( 26 , var_0 . length ( ) - var_2 - 1 ) ;
}
return var_1 ;
}
| 4 | <S_QUOTE>A<S_QUOTE><SEP>0<SEP>26<SEP>1 |
797 | <awangdev>Shortest Palindrome_1.java | private boolean validateSubstring(String s, int i, int j) {
String end = s.substring(j).toString();
String front = new StringBuffer(s.substring(0, i + 1)).reverse().toString();
if (front.length() <= end.length() && end.indexOf(front) == 0) {
return true;
}
return false;
} | private boolean var_0 ( String var_1 , int var_2 , int var_3 ) {
String var_4 = var_1 . substring ( var_3 ) . toString ( ) ;
String var_5 = new StringBuffer ( var_1 . substring ( 0 , var_2 + 1 ) ) . reverse ( ) . toString ( ) ;
if ( var_5 . length ( ) <= var_4 . length ( ) && var_4 . indexOf ( var_5 ) == 0 ) {
return true ;
}
return false ;
}
| 2 | 0<SEP>1 |
798 | <awangdev>Maximum Average Subarray II_1.java | private boolean check(int[] nums, int k, double midAvg) {
double preSum = 0;
double sum = 0;
double minPreSum = 0;
for (int i = 0; i < k; i++) {
sum += nums[i] - midAvg;
}
if (sum >= 0) {
return true;
}
for (int i = k; i < nums.length; i++) {
sum += nums[i] - midAvg;
preSum += nums[i - k] - midAvg;
minPreSum = Math.min(preSum, minPreSum);
if (sum >= minPreSum) {
return true;
}
}
return false;
} | private boolean var_0 ( int [ ] var_1 , int var_2 , double var_3 ) {
double var_4 = 0 ;
double var_5 = 0 ;
double var_6 = 0 ;
for ( int var_7 = 0 ;
var_7 < var_2 ;
var_7 ++ ) {
var_5 += var_1 [ var_7 ] - var_3 ;
}
if ( var_5 >= 0 ) {
return true ;
}
for ( int var_7 = var_2 ;
var_7 < var_1 . length ;
var_7 ++ ) {
var_5 += var_1 [ var_7 ] - var_3 ;
var_4 += var_1 [ var_7 - var_2 ] - var_3 ;
var_6 = Math . min ( var_4 , var_6 ) ;
if ( var_5 >= var_6 ) {
return true ;
}
}
return false ;
}
| 1 | 0 |
799 | <awangdev>121. Best Time to Buy and Sell Stock_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];
dp[0] = Integer.MAX_VALUE;
int profit = 0;
for (int i = 1; i <= n; i++) {
dp[i] = Math.min(dp[i - 1], prices[i - 1]);
profit = Math.max(profit, prices[i - 1] - dp[i]);
}
return profit;
} | 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 ] ;
var_2 [ 0 ] = Integer . MAX_VALUE ;
int var_3 = 0 ;
for ( int var_4 = 1 ;
var_4 <= var_1 ;
var_4 ++ ) {
var_2 [ var_4 ] = Math . min ( var_2 [ var_4 - 1 ] , var_0 [ var_4 - 1 ] ) ;
var_3 = Math . max ( var_3 , var_0 [ var_4 - 1 ] - var_2 [ var_4 ] ) ;
}
return var_3 ;
}
| 2 | 0<SEP>1 |
800 | <awangdev>523. Continuous Subarray Sum_2.java | public boolean checkSubarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) return false;
int n = nums.length;
int[] dp = new int[n];
dp[0] = nums[0];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + nums[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int sum = dp[j] - dp[i] + nums[i];
if (sum == k || (k != 0 && sum % k == 0)) {
return true;
}
}
}
return false;
} | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 ) return false ;
int var_3 = var_1 . length ;
int [ ] var_4 = new int [ var_3 ] ;
var_4 [ 0 ] = var_1 [ 0 ] ;
for ( int var_5 = 1 ;
var_5 < var_3 ;
var_5 ++ ) {
var_4 [ var_5 ] = var_4 [ var_5 - 1 ] + var_1 [ var_5 ] ;
}
for ( int var_5 = 0 ;
var_5 < var_3 ;
var_5 ++ ) {
for ( int var_6 = var_5 + 1 ;
var_6 < var_3 ;
var_6 ++ ) {
int var_7 = var_4 [ var_6 ] - var_4 [ var_5 ] + var_1 [ var_5 ] ;
if ( var_7 == var_2 || ( var_2 != 0 && var_7 % var_2 == 0 ) ) {
return true ;
}
}
}
return false ;
}
| 2 | 0<SEP>1 |
801 | <awangdev>46. Permutations_3.java | private void dfs(List<List<Integer>> result, List<Integer> list, int[] nums, boolean[] visited) {
if (list.size() == nums.length) {
result.add(new ArrayList<>(list));
return;
}
for (int i = 0; i < nums.length; i++) {
if (visited[i]) continue;
list.add(nums[i]);
visited[i] = true;
dfs(result, list, nums, visited);
list.remove(list.size() - 1);
visited[i] = false;
}
} | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] nums , boolean [ ] visited ) {
if ( list . size ( ) == nums . length ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
for ( int i = 0 ;
i < nums . length ;
i ++ ) {
if ( visited [ i ] ) continue ;
list . add ( nums [ i ] ) ;
visited [ i ] = true ;
dfs ( result , list , nums , visited ) ;
list . remove ( list . size ( ) - 1 ) ;
visited [ i ] = false ;
}
}
| 2 | 0<SEP>1 |
802 | <awangdev>53. Maximum Subarray_2.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 |
803 | <awangdev>1094. Car Pooling_1.java | public boolean carPooling(int[][] trips, int capacity) {
if (trips == null || trips.length == 0) return true;
int[] bucket = new int[1000];
for (int[] trip : trips) {
bucket[trip[1]] += trip[0];
bucket[trip[2]] += -trip[0];
}
int cap = 0;
for (int num : bucket) {
cap += num;
if (cap > capacity) return false;
}
return true;
} | public boolean var_0 ( int [ ] [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 ) return true ;
int [ ] var_3 = new int [ 1000 ] ;
for ( int [ ] var_4 : var_1 ) {
var_3 [ var_4 [ 1 ] ] += var_4 [ 0 ] ;
var_3 [ var_4 [ 2 ] ] += - var_4 [ 0 ] ;
}
int var_5 = 0 ;
for ( int var_6 : var_3 ) {
var_5 += var_6 ;
if ( var_5 > var_2 ) return false ;
}
return true ;
}
| 4 | 2<SEP>1000<SEP>0<SEP>1 |
804 | <awangdev>205. Isomorphic Strings_1.java | public boolean isIsomorphic(String s, String t) {
if (s == null || t == null || s.length() != t.length()) return false;
Map<Character, Character> map = new HashMap<>();
for (int i = 0; i < s.length(); i++) {
char charS = s.charAt(i), charT = t.charAt(i);
if (map.containsKey(charS)) {
if (map.get(charS) != charT) return false;
} else {
if (map.containsValue(charT)) return false;
map.put(charS, charT);
}
}
return true;
} | 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 ;
Map < Character , Character > var_3 = new HashMap < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
char var_5 = var_1 . charAt ( var_4 ) , var_6 = var_2 . charAt ( var_4 ) ;
if ( var_3 . containsKey ( var_5 ) ) {
if ( var_3 . get ( var_5 ) != var_6 ) return false ;
}
else {
if ( var_3 . containsValue ( var_6 ) ) return false ;
var_3 . put ( var_5 , var_6 ) ;
}
}
return true ;
}
| 1 | 0 |
805 | <awangdev>[tool] Quick Select - Median_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 |
806 | <awangdev>315. Count of Smaller Numbers After Self_1.java | private int search(List<Integer> list, int target) {
if (list.size() == 0) return 0;
int start = 0, end = list.size() - 1;
if (target <= list.get(start)) return start;
if (target > list.get(end)) return end + 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
int num = list.get(mid);
if (num < target) start = mid;
else end = mid;
}
if (target <= list.get(start)) return start;
return end;
} | private int sample_funcname ( List < Integer > var_0 , int var_1 ) {
if ( var_0 . size ( ) == 0 ) return 0 ;
int var_2 = 0 , var_3 = var_0 . size ( ) - 1 ;
if ( var_1 <= var_0 . get ( var_2 ) ) return var_2 ;
if ( var_1 > var_0 . get ( var_3 ) ) return var_3 + 1 ;
while ( var_2 + 1 < var_3 ) {
int var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
int var_5 = var_0 . get ( var_4 ) ;
if ( var_5 < var_1 ) var_2 = var_4 ;
else var_3 = var_4 ;
}
if ( var_1 <= var_0 . get ( var_2 ) ) return var_2 ;
return var_3 ;
}
| 3 | 2<SEP>0<SEP>1 |
807 | <awangdev>1060. Missing Element in Sorted Array_2.java | public int missingElement(int[] nums, int k) {
int start = 0, end = nums.length - 1;
int count = nums[end] - nums[0] - end;
if (count < k) {
return nums[end] + k - count;
}
while (start + 1 < end) {
int mid = start + (end - start) / 2;
count = nums[mid] - nums[start] - (mid - start);
if (count >= k) {
end = mid;
} else {
start = mid;
k -= count;
}
}
return nums[start] + k;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_2 = 0 , var_3 = var_0 . length - 1 ;
int var_4 = var_0 [ var_3 ] - var_0 [ 0 ] - var_3 ;
if ( var_4 < var_1 ) {
return var_0 [ var_3 ] + var_1 - var_4 ;
}
while ( var_2 + 1 < var_3 ) {
int var_5 = var_2 + ( var_3 - var_2 ) / 2 ;
var_4 = var_0 [ var_5 ] - var_0 [ var_2 ] - ( var_5 - var_2 ) ;
if ( var_4 >= var_1 ) {
var_3 = var_5 ;
}
else {
var_2 = var_5 ;
var_1 -= var_4 ;
}
}
return var_0 [ var_2 ] + var_1 ;
}
| 3 | 2<SEP>0<SEP>1 |
808 | <awangdev>Backpack II_5.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];
dp[0][0] = 0;
for (int j = 0; j <= m; j++) {
dp[0][j] = 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][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 ] ;
var_4 [ 0 ] [ 0 ] = 0 ;
for ( int var_5 = 0 ;
var_5 <= var_0 ;
var_5 ++ ) {
var_4 [ 0 ] [ var_5 ] = 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 ] [ 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 ] ) ;
}
}
}
return var_4 [ var_3 ] [ var_0 ] ;
}
| 2 | 0<SEP>1 |
809 | <awangdev>Coins in a Line III_3.java | private void search(int i, int j, int[][] dp, int[][] sum, int[] values) {
if (dp[i][j] > 0) {
return;
}
if (i == j) {
dp[i][j] = values[i];
} else if (i > j) {
dp[i][j] = 0;
} else if (i + 1 == j) {
dp[i][j] = Math.max(values[i], values[j]);
} else {
search(i + 1, j, dp, sum, values);
search(i, j - 1, dp, sum, values);
dp[i][j] = sum[i][j] - Math.min(dp[i + 1][j], dp[i][j - 1]);
}
} | private void sample_funcname ( int i , int j , int [ ] [ ] dp , int [ ] [ ] sum , int [ ] values ) {
if ( dp [ i ] [ j ] > 0 ) {
return ;
}
if ( i == j ) {
dp [ i ] [ j ] = values [ i ] ;
}
else if ( i > j ) {
dp [ i ] [ j ] = 0 ;
}
else if ( i + 1 == j ) {
dp [ i ] [ j ] = Math . max ( values [ i ] , values [ j ] ) ;
}
else {
search ( i + 1 , j , dp , sum , values ) ;
search ( i , j - 1 , dp , sum , values ) ;
dp [ i ] [ j ] = sum [ i ] [ j ] - Math . min ( dp [ i + 1 ] [ j ] , dp [ i ] [ j - 1 ] ) ;
}
}
| 2 | 0<SEP>1 |
810 | <awangdev>Perfect Rectangle_1.java | private String buildKey(int x, int y) {
return x + "@" + y;
} | private String var_0 ( int var_1 , int var_2 ) {
return var_1 + "@" + var_2 ;
}
| 1 | <D_QUOTE>@<D_QUOTE> |
811 | <awangdev>Two Strings Are Anagrams_1.java | public boolean anagram(String s, String t) {
if (s == null || t == null) {
return false;
} else if (s.length() != t.length()) {
return false;
} else if (s.length() == 0 && t.length() == 0) {
return true;
}
int[] count = new int[256];
for (int i = 0; i < s.length(); i++) {
count[s.charAt(i)]++;
count[t.charAt(i)]--;
}
for (int num : count) {
if (num != 0) {
return false;
}
}
return true;
} | public boolean var_0 ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null ) {
return false ;
}
else if ( var_1 . length ( ) != var_2 . length ( ) ) {
return false ;
}
else if ( var_1 . length ( ) == 0 && var_2 . length ( ) == 0 ) {
return true ;
}
int [ ] var_3 = new int [ 256 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
var_3 [ var_1 . charAt ( var_4 ) ] ++ ;
var_3 [ var_2 . charAt ( var_4 ) ] -- ;
}
for ( int var_5 : var_3 ) {
if ( var_5 != 0 ) {
return false ;
}
}
return true ;
}
| 2 | 0<SEP>256 |
812 | <awangdev>33. Search in Rotated Sorted Array_2.java | public int search(int[] A, int target) {
if (A == null || A.length == 0) {
return -1;
}
int p1 = 0;
int p2 = A.length - 1;
int start = p1;
int end = p2;
int mid = start + (end - start)/2;
int breakPoint = 0;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
return mid;
} else if (A[mid] >= A[p1]) {
start = mid;
} else {
end = mid;
}
}
if (A[start] > A[end]) {
breakPoint = start;
} else {
breakPoint = end;
}
if (A[p1] <= target && target <= A[breakPoint]) {
start = p1;
end = breakPoint;
} else {
start = breakPoint + 1;
end = p2;
}
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
return mid;
} else if (A[mid] > target) {
end = mid;
} else {
start = mid;
}
}
if (A[start] == target) {
return start;
} else if (A[end] == target) {
return end;
}
return -1;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_2 = 0 ;
int var_3 = var_0 . length - 1 ;
int var_4 = var_2 ;
int var_5 = var_3 ;
int var_6 = var_4 + ( var_5 - var_4 ) / 2 ;
int var_7 = 0 ;
while ( var_4 + 1 < var_5 ) {
var_6 = var_4 + ( var_5 - var_4 ) / 2 ;
if ( var_0 [ var_6 ] == var_1 ) {
return var_6 ;
}
else if ( var_0 [ var_6 ] >= var_0 [ var_2 ] ) {
var_4 = var_6 ;
}
else {
var_5 = var_6 ;
}
}
if ( var_0 [ var_4 ] > var_0 [ var_5 ] ) {
var_7 = var_4 ;
}
else {
var_7 = var_5 ;
}
if ( var_0 [ var_2 ] <= var_1 && var_1 <= var_0 [ var_7 ] ) {
var_4 = var_2 ;
var_5 = var_7 ;
}
else {
var_4 = var_7 + 1 ;
var_5 = var_3 ;
}
while ( var_4 + 1 < var_5 ) {
var_6 = var_4 + ( var_5 - var_4 ) / 2 ;
if ( var_0 [ var_6 ] == var_1 ) {
return var_6 ;
}
else if ( var_0 [ var_6 ] > var_1 ) {
var_5 = var_6 ;
}
else {
var_4 = var_6 ;
}
}
if ( var_0 [ var_4 ] == var_1 ) {
return var_4 ;
}
else if ( var_0 [ var_5 ] == var_1 ) {
return var_5 ;
}
return - 1 ;
}
| 3 | 2<SEP>0<SEP>1 |
813 | <awangdev>Backpack V_1.java | public int backPackV(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int[][] dp = new int[n + 1][target + 1];
dp[0][0] = 1;
for (int j = 1; j <= target; j++) {
dp[0][j] = 0;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= target; j++) {
dp[i][j] = dp[i - 1][j];
if (j - nums[i - 1] >= 0) {
dp[i][j] += dp[i - 1][j - nums[i - 1]];
}
}
}
return dp[n][target];
} | 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 ;
int [ ] [ ] var_3 = new int [ var_2 + 1 ] [ var_1 + 1 ] ;
var_3 [ 0 ] [ 0 ] = 1 ;
for ( int var_4 = 1 ;
var_4 <= var_1 ;
var_4 ++ ) {
var_3 [ 0 ] [ var_4 ] = 0 ;
}
for ( int var_5 = 1 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_4 = 0 ;
var_4 <= var_1 ;
var_4 ++ ) {
var_3 [ var_5 ] [ var_4 ] = var_3 [ var_5 - 1 ] [ var_4 ] ;
if ( var_4 - var_0 [ var_5 - 1 ] >= 0 ) {
var_3 [ var_5 ] [ var_4 ] += var_3 [ var_5 - 1 ] [ var_4 - var_0 [ var_5 - 1 ] ] ;
}
}
}
return var_3 [ var_2 ] [ var_1 ] ;
}
| 2 | 0<SEP>1 |
814 | <awangdev>Compare Version Numbers_1.java | public int compareVersion(String version1, String version2) {
if (version1.equals(version2)) {
return 0;
}
String[] subVersion1 = version1.split("\\.");
String[] subVersion2 = version2.split("\\.");
int size = Math.max(subVersion1.length, subVersion2.length);
int rst = 0;
for (int i = 0; i < size; i++) {
if (i >= subVersion1.length) {
rst = Integer.parseInt(subVersion2[i]) == 0 ? 0 : -1;
} else if (i >= subVersion2.length) {
rst = Integer.parseInt(subVersion1[i]) == 0 ? 0 : 1;
} else {
if (Integer.parseInt(subVersion1[i]) != Integer.parseInt(subVersion2[i])) {
rst = Integer.parseInt(subVersion1[i]) < Integer.parseInt(subVersion2[i]) ? -1 : 1;
}
}
if (rst != 0) {
return rst;
}
}
return rst;
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_0 . equals ( var_1 ) ) {
return 0 ;
}
String [ ] var_2 = var_0 . split ( "\\." ) ;
String [ ] var_3 = var_1 . split ( "\\." ) ;
int var_4 = Math . max ( var_2 . length , var_3 . length ) ;
int var_5 = 0 ;
for ( int var_6 = 0 ;
var_6 < var_4 ;
var_6 ++ ) {
if ( var_6 >= var_2 . length ) {
var_5 = Integer . parseInt ( var_3 [ var_6 ] ) == 0 ? 0 : - 1 ;
}
else if ( var_6 >= var_3 . length ) {
var_5 = Integer . parseInt ( var_2 [ var_6 ] ) == 0 ? 0 : 1 ;
}
else {
if ( Integer . parseInt ( var_2 [ var_6 ] ) != Integer . parseInt ( var_3 [ var_6 ] ) ) {
var_5 = Integer . parseInt ( var_2 [ var_6 ] ) < Integer . parseInt ( var_3 [ var_6 ] ) ? - 1 : 1 ;
}
}
if ( var_5 != 0 ) {
return var_5 ;
}
}
return var_5 ;
}
| 3 | <D_QUOTE>\\.<D_QUOTE><SEP>0<SEP>1 |
815 | <awangdev>215. Kth Largest Element in an Array_1.java | public int findKthLargest(int[] nums, int k) {
if (nums == null || nums.length == 0) return -1;
PriorityQueue<Integer> queue = new PriorityQueue<>();
for (int i = 0; i < nums.length; i++) {
if (i < k || nums[i] > queue.peek()) queue.offer(nums[i]);
if (queue.size() > k) queue.poll();
}
return queue.poll();
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) return - 1 ;
PriorityQueue < Integer > var_2 = new PriorityQueue < > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
if ( var_3 < var_1 || var_0 [ var_3 ] > var_2 . peek ( ) ) var_2 . offer ( var_0 [ var_3 ] ) ;
if ( var_2 . size ( ) > var_1 ) var_2 . poll ( ) ;
}
return var_2 . poll ( ) ;
}
| 2 | 0<SEP>1 |
816 | <awangdev>1033. Moving Stones Until Consecutive_2.java | private int calDist(int start, int end) {
return end - start - 1;
} | private int sample_funcname ( int var_0 , int var_1 ) {
return var_1 - var_0 - 1 ;
}
| 1 | 1 |
817 | <awangdev>Remove Duplicate Letters_1.java | String removeDuplicateLetters(String s) {
if (s == null || s.length() <= 1) {
return s;
}
char[] arr = s.toCharArray();
int[] count = new int[256];
boolean[] visited = new boolean[256];
for (char c : arr) {
count[c]++;
}
StringBuffer sb = new StringBuffer("0");
for (char c : arr) {
count[c]--;
if (visited[c]) {
continue;
}
char lastChar = sb.charAt(sb.length() - 1);
while (c < lastChar && count[lastChar] > 0) {
sb.deleteCharAt(sb.length() - 1);
visited[lastChar] = false;
lastChar = sb.charAt(sb.length() - 1);
}
sb.append((char)(c));
visited[c] = true;
}
return sb.substring(1).toString();
} | String var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) <= 1 ) {
return var_1 ;
}
char [ ] var_2 = var_1 . toCharArray ( ) ;
int [ ] var_3 = new int [ 256 ] ;
boolean [ ] var_4 = new boolean [ 256 ] ;
for ( char var_5 : var_2 ) {
var_3 [ var_5 ] ++ ;
}
StringBuffer var_6 = new StringBuffer ( "0" ) ;
for ( char var_5 : var_2 ) {
var_3 [ var_5 ] -- ;
if ( var_4 [ var_5 ] ) {
continue ;
}
char var_7 = var_6 . charAt ( var_6 . length ( ) - 1 ) ;
while ( var_5 < var_7 && var_3 [ var_7 ] > 0 ) {
var_6 . deleteCharAt ( var_6 . length ( ) - 1 ) ;
var_4 [ var_7 ] = false ;
var_7 = var_6 . charAt ( var_6 . length ( ) - 1 ) ;
}
var_6 . append ( ( char ) ( var_5 ) ) ;
var_4 [ var_5 ] = true ;
}
return var_6 . substring ( 1 ) . toString ( ) ;
}
| 4 | <D_QUOTE>0<D_QUOTE><SEP>1<SEP>0<SEP>256 |
818 | <awangdev>12. Integer to Roman_1.java | private String repeat(String curr, int num) {
StringBuffer sb = new StringBuffer();
while (num-- > 0) {
sb.append(curr);
}
return sb.toString();
} | private String var_0 ( String var_1 , int var_2 ) {
StringBuffer var_3 = new StringBuffer ( ) ;
while ( var_2 -- > 0 ) {
var_3 . append ( var_1 ) ;
}
return var_3 . toString ( ) ;
}
| 1 | 0 |
819 | <awangdev>256. Paint House_1.java | public int minCost(int[][] costs) {
int n = costs.length;
int[][] dp = new int[2][3];
for (int i = 1; i <= n; i++) {
int last = (i - 1) % 2, curr = i % 2;
for (int j = 0; j < 3; j++) {
dp[curr][j] = Math.min(dp[last][(j + 1) % 3], dp[last][(j + 2) % 3]) + costs[i-1][j];
}
}
return Math.min(Math.min(dp[n%2][0], dp[n%2][1]), dp[n%2][2]);
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
int var_1 = var_0 . length ;
int [ ] [ ] var_2 = new int [ 2 ] [ 3 ] ;
for ( int var_3 = 1 ;
var_3 <= var_1 ;
var_3 ++ ) {
int var_4 = ( var_3 - 1 ) % 2 , var_5 = var_3 % 2 ;
for ( int var_6 = 0 ;
var_6 < 3 ;
var_6 ++ ) {
var_2 [ var_5 ] [ var_6 ] = Math . min ( var_2 [ var_4 ] [ ( var_6 + 1 ) % 3 ] , var_2 [ var_4 ] [ ( var_6 + 2 ) % 3 ] ) + var_0 [ var_3 - 1 ] [ var_6 ] ;
}
}
return Math . min ( Math . min ( var_2 [ var_1 % 2 ] [ 0 ] , var_2 [ var_1 % 2 ] [ 1 ] ) , var_2 [ var_1 % 2 ] [ 2 ] ) ;
}
| 4 | 0<SEP>1<SEP>3<SEP>2 |
820 | <awangdev>717. 1-bit and 2-bit Characters_2.java | public boolean isOneBitCharacter(int[] bits) {
if (bits == null || bits.length == 0) {
return false;
}
int n = bits.length;
if (n == 1) {
return bits[0] == 0;
}
if (bits[n - 1] != 0) {
return false;
}
boolean[] dp = new boolean[n];
dp[0] = bits[0] == 0;
dp[1] = bits[0] != 0 || bits[1] != 1;
for (int i = 2; i < n - 1; i++) {
if (bits[i] == 0) {
dp[i] = dp[i - 2] || dp[i - 1];
} else if (bits[i] == 1) {
dp[i] = dp[i - 2] && bits[i - 1] == 1;
}
}
return dp[n - 2];
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
int var_2 = var_1 . length ;
if ( var_2 == 1 ) {
return var_1 [ 0 ] == 0 ;
}
if ( var_1 [ var_2 - 1 ] != 0 ) {
return false ;
}
boolean [ ] var_3 = new boolean [ var_2 ] ;
var_3 [ 0 ] = var_1 [ 0 ] == 0 ;
var_3 [ 1 ] = var_1 [ 0 ] != 0 || var_1 [ 1 ] != 1 ;
for ( int var_4 = 2 ;
var_4 < var_2 - 1 ;
var_4 ++ ) {
if ( var_1 [ var_4 ] == 0 ) {
var_3 [ var_4 ] = var_3 [ var_4 - 2 ] || var_3 [ var_4 - 1 ] ;
}
else if ( var_1 [ var_4 ] == 1 ) {
var_3 [ var_4 ] = var_3 [ var_4 - 2 ] && var_1 [ var_4 - 1 ] == 1 ;
}
}
return var_3 [ var_2 - 2 ] ;
}
| 3 | 2<SEP>0<SEP>1 |
821 | <awangdev>Interleaving Positive and Negative Numbers_2.java | public void rerange(int[] A) {
if (A == null || A.length <= 1) {
return;
}
List<Integer> positive = new ArrayList<>();
List<Integer> negative = new ArrayList<>();
for (int num : A) {
if (num >= 0) {
positive.add(num);
} else {
negative.add(num);
}
}
int extraPositive = positive.size() > negative.size() ? 0 : 1;
for (int i = 0; i < A.length; i++) {
if (i % 2 == extraPositive) {
A[i] = positive.get(0);
positive.remove(0);
} else {
A[i] = negative.get(0);
negative.remove(0);
}
System.out.println(A[i]);
}
} | public void var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length <= 1 ) {
return ;
}
List < Integer > var_2 = new ArrayList < > ( ) ;
List < Integer > var_3 = new ArrayList < > ( ) ;
for ( int var_4 : var_1 ) {
if ( var_4 >= 0 ) {
var_2 . add ( var_4 ) ;
}
else {
var_3 . add ( var_4 ) ;
}
}
int var_5 = var_2 . size ( ) > var_3 . size ( ) ? 0 : 1 ;
for ( int var_6 = 0 ;
var_6 < var_1 . length ;
var_6 ++ ) {
if ( var_6 % 2 == var_5 ) {
var_1 [ var_6 ] = var_2 . get ( 0 ) ;
var_2 . remove ( 0 ) ;
}
else {
var_1 [ var_6 ] = var_3 . get ( 0 ) ;
var_3 . remove ( 0 ) ;
}
System . out . println ( var_1 [ var_6 ] ) ;
}
}
| 3 | 1<SEP>0<SEP>2 |
822 | <awangdev>Minimum Size Subarray Sum_2.java | public int minSubArrayLen(int s, int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int result = Integer.MAX_VALUE;
for (int i = 0; i < nums.length - 1; i++) {
int sum = nums[i];
if (sum >= s) {
result = 1;
break;
}
for (int j = i + 1; j < nums.length; j++) {
if (j - i >= result) {
break;
}
sum += nums[j];
if (sum >= s) {
result = Math.min(result, j - i + 1);
break;
}
}
}
return result == Integer.MAX_VALUE ? 0 : result;
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return 0 ;
}
int var_2 = Integer . MAX_VALUE ;
for ( int var_3 = 0 ;
var_3 < var_1 . length - 1 ;
var_3 ++ ) {
int var_4 = var_1 [ var_3 ] ;
if ( var_4 >= var_0 ) {
var_2 = 1 ;
break ;
}
for ( int var_5 = var_3 + 1 ;
var_5 < var_1 . length ;
var_5 ++ ) {
if ( var_5 - var_3 >= var_2 ) {
break ;
}
var_4 += var_1 [ var_5 ] ;
if ( var_4 >= var_0 ) {
var_2 = Math . min ( var_2 , var_5 - var_3 + 1 ) ;
break ;
}
}
}
return var_2 == Integer . MAX_VALUE ? 0 : var_2 ;
}
| 2 | 0<SEP>1 |
Subsets and Splits