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
⌀ |
|---|---|---|---|---|---|
412 | <awangdev>Walls and Gates_5.java | private boolean validateCoordinate(int[][] rooms, int x, int y) {
return x < 0 || x >= rooms.length || y < 0 || y >= rooms[0].length || rooms[x][y] == -1 || rooms[x][y] == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 < 0 || var_2 >= var_1 . length || var_3 < 0 || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] == - 1 || var_1 [ var_2 ] [ var_3 ] == 0 ;
}
| 2 | 0<SEP>1 |
413 | <awangdev>724. Find Pivot Index_1.java | public int pivotIndex(int[] nums) {
if (nums == null || nums.length == 0) return -1;
int n = nums.length;
for (int i = 1; i < n; i++) nums[i] += nums[i - 1];
if (nums[n-1] - nums[0] == 0) return 0;
for (int i = 1; i < n; i++) {
if (nums[i - 1] == nums[n - 1] - nums[i]) return i;
}
return -1;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return - 1 ;
int var_1 = var_0 . length ;
for ( int var_2 = 1 ;
var_2 < var_1 ;
var_2 ++ ) var_0 [ var_2 ] += var_0 [ var_2 - 1 ] ;
if ( var_0 [ var_1 - 1 ] - var_0 [ 0 ] == 0 ) return 0 ;
for ( int var_2 = 1 ;
var_2 < var_1 ;
var_2 ++ ) {
if ( var_0 [ var_2 - 1 ] == var_0 [ var_1 - 1 ] - var_0 [ var_2 ] ) return var_2 ;
}
return - 1 ;
}
| 2 | 0<SEP>1 |
415 | <awangdev>727. Minimum Window Subsequence_1.java | private int backtrack(char[] ss, char[] tt, int index) {
for (int i = tt.length - 1; i >= 0; i--) {
while(ss[index--] != tt[i]);
}
return index + 1;
} | private int sample_funcname ( char [ ] var_0 , char [ ] var_1 , int var_2 ) {
for ( int var_3 = var_1 . length - 1 ;
var_3 >= 0 ;
var_3 -- ) {
while ( var_0 [ var_2 -- ] != var_1 [ var_3 ] ) ;
}
return var_2 + 1 ;
}
| 2 | 1<SEP>0 |
416 | <awangdev>139. Word Break_2.java | private boolean dfs(Set<String> dict, Set<String> set, String s) {
if (dict.contains(s)) return true;
StringBuffer sb = new StringBuffer();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
sb.append(c);
if (dict.contains(sb.toString())) {
String sub = s.substring(i + 1);
if (set.contains(sub)) continue;
if (dfs(dict, set, sub)) return true;
set.add(sub);
}
}
return false;
} | private boolean sample_funcname ( Set < String > dict , Set < String > set , String s ) {
if ( dict . contains ( s ) ) return true ;
StringBuffer sb = new StringBuffer ( ) ;
for ( int i = 0 ;
i < s . length ( ) ;
i ++ ) {
char c = s . charAt ( i ) ;
sb . append ( c ) ;
if ( dict . contains ( sb . toString ( ) ) ) {
String sub = s . substring ( i + 1 ) ;
if ( set . contains ( sub ) ) continue ;
if ( dfs ( dict , set , sub ) ) return true ;
set . add ( sub ) ;
}
}
return false ;
}
| 2 | 0<SEP>1 |
417 | <awangdev>57. Insert Interval_3.java | private int[][] convert(List<int[]> list) {
int[][] rst = new int[list.size()][2];
for (int i = 0; i < list.size(); i++) {
rst[i][0] = list.get(i)[0];
rst[i][1] = list.get(i)[1];
}
return rst;
} | private int [ ] [ ] sample_funcname ( List < int [ ] > var_0 ) {
int [ ] [ ] var_1 = new int [ var_0 . size ( ) ] [ 2 ] ;
for ( int var_2 = 0 ;
var_2 < var_0 . size ( ) ;
var_2 ++ ) {
var_1 [ var_2 ] [ 0 ] = var_0 . get ( var_2 ) [ 0 ] ;
var_1 [ var_2 ] [ 1 ] = var_0 . get ( var_2 ) [ 1 ] ;
}
return var_1 ;
}
| 3 | 0<SEP>1<SEP>2 |
418 | <awangdev>Add Digits_1.java | public int addDigits(int num) {
if (num < 10) {
return num;
}
while (num > 9) {
int temp = 0;
while (num != 0) {
temp += num % 10;
num = num / 10;
}
num = temp;
}
return num;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 < 10 ) {
return var_0 ;
}
while ( var_0 > 9 ) {
int var_1 = 0 ;
while ( var_0 != 0 ) {
var_1 += var_0 % 10 ;
var_0 = var_0 / 10 ;
}
var_0 = var_1 ;
}
return var_0 ;
}
| 3 | 10<SEP>0<SEP>9 |
419 | <awangdev>896. Monotonic Array_1.java | private boolean validate(int a, int b, boolean incline) {
if (incline) return a <= b;
return a >= b;
} | private boolean var_0 ( int var_1 , int var_2 , boolean var_3 ) {
if ( var_3 ) return var_1 <= var_2 ;
return var_1 >= var_2 ;
}
| 0 | null |
420 | <awangdev>739. Daily Temperatures_2.java | public int[] dailyTemperatures(int[] T) {
int n = T.length;
int[] rst = new int[n];
Integer[] tempIndex = new Integer[101];
for (int i = n - 1; i >= 0; i--) {
int num = T[i], warmerIndex = Integer.MAX_VALUE;;
for (int t = num + 1; t <= 100; t++) {
if (tempIndex[t] != null && tempIndex[t] < warmerIndex) warmerIndex = tempIndex[t];
}
if (warmerIndex < Integer.MAX_VALUE) rst[i] = warmerIndex - i;
tempIndex[num] = i;
}
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
int var_1 = var_0 . length ;
int [ ] var_2 = new int [ var_1 ] ;
Integer [ ] var_3 = new Integer [ 101 ] ;
for ( int var_4 = var_1 - 1 ;
var_4 >= 0 ;
var_4 -- ) {
int var_5 = var_0 [ var_4 ] , var_6 = Integer . MAX_VALUE ;
;
for ( int var_7 = var_5 + 1 ;
var_7 <= 100 ;
var_7 ++ ) {
if ( var_3 [ var_7 ] != null && var_3 [ var_7 ] < var_6 ) var_6 = var_3 [ var_7 ] ;
}
if ( var_6 < Integer . MAX_VALUE ) var_2 [ var_4 ] = var_6 - var_4 ;
var_3 [ var_5 ] = var_4 ;
}
return var_2 ;
}
| 4 | 1<SEP>0<SEP>100<SEP>101 |
421 | <awangdev>1021. Remove Outermost Parentheses_1.java | private boolean isPair(char a, char b) {
return a == '(' && b ==')';
} | private boolean var_0 ( char var_1 , char var_2 ) {
return var_1 == '(' && var_2 == ')' ;
}
| 2 | <S_QUOTE>)<S_QUOTE><SEP><S_QUOTE>(<S_QUOTE> |
422 | <awangdev>Contains Duplicate III_1.java | public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
if (nums == null || nums.length == 0 || k <= 0 || t < 0) {
return false;
}
TreeSet<Long> treeSet = new TreeSet<>();
for (int i = 0; i < nums.length; i++) {
Long target = treeSet.ceiling((long)nums[i] - t);
if (target != null && target <= (long)nums[i] + t) {
return true;
}
if (i >= k) {
treeSet.remove((long)nums[i - k]);
}
treeSet.add((long)nums[i]);
}
return false;
} | public boolean var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
if ( var_1 == null || var_1 . length == 0 || var_2 <= 0 || var_3 < 0 ) {
return false ;
}
TreeSet < Long > var_4 = new TreeSet < > ( ) ;
for ( int var_5 = 0 ;
var_5 < var_1 . length ;
var_5 ++ ) {
Long var_6 = var_4 . ceiling ( ( long ) var_1 [ var_5 ] - var_3 ) ;
if ( var_6 != null && var_6 <= ( long ) var_1 [ var_5 ] + var_3 ) {
return true ;
}
if ( var_5 >= var_2 ) {
var_4 . remove ( ( long ) var_1 [ var_5 - var_2 ] ) ;
}
var_4 . add ( ( long ) var_1 [ var_5 ] ) ;
}
return false ;
}
| 1 | 0 |
423 | <awangdev>239. Sliding Window Maximum_3.java | private void inQueue(Deque<Integer> deque, int num) {
while (!deque.isEmpty() && deque.peekLast() < num) {
deque.pollLast();
}
deque.offerLast(num);
} | private void var_0 ( Deque < Integer > var_1 , int var_2 ) {
while ( ! var_1 . isEmpty ( ) && var_1 . peekLast ( ) < var_2 ) {
var_1 . pollLast ( ) ;
}
var_1 . offerLast ( var_2 ) ;
}
| 0 | null |
424 | <awangdev>Search Insert Position_1.java | public int searchInsert(int[] A, int target) {
if (A == null || A.length == 0) {
return 0;
}
int start = 0;
int end = A.length - 1;
int mid = start + (end - start)/2;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
return mid;
} else if (A[mid] > target) {
end = mid;
} else {
start = mid;
}
}
if (A[start] >= target) {
return start;
} else if (A[start] < target && target <= A[end]) {
return end;
} else {
return end + 1;
}
} | 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 = var_0 . length - 1 ;
int var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
while ( var_2 + 1 < var_3 ) {
var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
if ( var_0 [ var_4 ] == var_1 ) {
return var_4 ;
}
else if ( var_0 [ var_4 ] > var_1 ) {
var_3 = var_4 ;
}
else {
var_2 = var_4 ;
}
}
if ( var_0 [ var_2 ] >= var_1 ) {
return var_2 ;
}
else if ( var_0 [ var_2 ] < var_1 && var_1 <= var_0 [ var_3 ] ) {
return var_3 ;
}
else {
return var_3 + 1 ;
}
}
| 3 | 2<SEP>0<SEP>1 |
425 | <awangdev>788. Rotated Digits_1.java | private int[] freq(int num) {
int[] count = new int[10];
while (num != 0) {
count[num%10]++;
num /= 10;
}
return count;
} | private int [ ] sample_funcname ( int var_0 ) {
int [ ] var_1 = new int [ 10 ] ;
while ( var_0 != 0 ) {
var_1 [ var_0 % 10 ] ++ ;
var_0 /= 10 ;
}
return var_1 ;
}
| 2 | 10<SEP>0 |
426 | <awangdev>Reverse Words in a String II_2.java | public void reverseWords(char[] s) {
if (s == null || s.length == 0) {
return;
}
int len = s.length;
for (int i = 0; i < len / 2; i++) {
char temp = s[i];
s[i] = s[len - 1 - i];
s[len - 1 - i] = temp;
}
int start = 0;
int mid = 0;
int end = 0;
for (int i = 0; i < len; i++) {
if (s[i] == ' ') {
mid = start + (end - start) / 2;
for (int j = start; j <= mid; j++) {
char temp = s[j];
s[j] = s[end - (j - start)];
s[end - (j - start)] = temp;
}
start = i + 1;
} else {
end = i;
}
}
mid = start + (end - start) / 2;
for (int j = start; j <= mid; j++) {
char temp = s[j];
s[j] = s[end - (j - start)];
s[end - (j - start)] = temp;
}
} | public void var_0 ( char [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return ;
}
int var_2 = var_1 . length ;
for ( int var_3 = 0 ;
var_3 < var_2 / 2 ;
var_3 ++ ) {
char var_4 = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_1 [ var_2 - 1 - var_3 ] ;
var_1 [ var_2 - 1 - var_3 ] = var_4 ;
}
int var_5 = 0 ;
int var_6 = 0 ;
int var_7 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_2 ;
var_3 ++ ) {
if ( var_1 [ var_3 ] == ' ' ) {
var_6 = var_5 + ( var_7 - var_5 ) / 2 ;
for ( int var_8 = var_5 ;
var_8 <= var_6 ;
var_8 ++ ) {
char var_4 = var_1 [ var_8 ] ;
var_1 [ var_8 ] = var_1 [ var_7 - ( var_8 - var_5 ) ] ;
var_1 [ var_7 - ( var_8 - var_5 ) ] = var_4 ;
}
var_5 = var_3 + 1 ;
}
else {
var_7 = var_3 ;
}
}
var_6 = var_5 + ( var_7 - var_5 ) / 2 ;
for ( int var_8 = var_5 ;
var_8 <= var_6 ;
var_8 ++ ) {
char var_4 = var_1 [ var_8 ] ;
var_1 [ var_8 ] = var_1 [ var_7 - ( var_8 - var_5 ) ] ;
var_1 [ var_7 - ( var_8 - var_5 ) ] = var_4 ;
}
}
| 4 | 0<SEP><S_QUOTE> <S_QUOTE><SEP>1<SEP>2 |
427 | <awangdev>Largest Number_1.java | public String largestNumber(int[] num) {
if (num == null || num.length == 0) {
return "";
}
String[] strs = new String[num.length];
for (int i = 0; i < num.length; i++) {
strs[i] = num[i] + "";
}
Arrays.sort(strs, new Comparator<String>() {
public int compare(String s1, String s2) {
return (s2 + s1).compareTo(s1 + s2);
}
});
StringBuffer sb = new StringBuffer();
for (int i = 0; i < num.length; i++) {
sb.append(strs[i]);
}
String rst = sb.toString();
if (rst.charAt(0) == '0') {
return "0";
}
return rst;
} | public String var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return "" ;
}
String [ ] var_2 = new String [ var_1 . length ] ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
var_2 [ var_3 ] = var_1 [ var_3 ] + "" ;
}
Arrays . sort ( var_2 , new Comparator < String > ( ) {
public int compare ( String var_4 , String var_5 ) {
return ( var_5 + var_4 ) . compareTo ( var_4 + var_5 ) ;
}
}
) ;
StringBuffer var_6 = new StringBuffer ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
var_6 . append ( var_2 [ var_3 ] ) ;
}
String var_7 = var_6 . toString ( ) ;
if ( var_7 . charAt ( 0 ) == '0' ) {
return "0" ;
}
return var_7 ;
}
| 4 | <S_QUOTE>0<S_QUOTE><SEP><D_QUOTE>0<D_QUOTE><SEP>0<SEP><D_QUOTE><D_QUOTE> |
428 | <awangdev>Majority Number III_1.java | public int majorityNumber(ArrayList<Integer> nums, int k) {
if (nums == null || nums.size() == 0) {
return -1;
}
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
for (Integer num : nums) {
if (map.containsKey(num)) {
map.put(num, map.get(num) + 1);
} else {
if (map.size() == k) {
Iterator<Map.Entry<Integer, Integer>> iter = map.entrySet().iterator();
while (iter.hasNext()) {
Map.Entry<Integer, Integer> entry = iter.next();
if (entry.getValue() - 1 == 0) {
iter.remove();
} else {
map.put(entry.getKey(), entry.getValue() - 1);
}
}
} else {
map.put(num, 1);
}
}
}
int result = 0;
int max = 0;
for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
if (entry.getValue() > max) {
max = entry.getValue();
result = entry.getKey();
}
}
return result;
} | public int sample_funcname ( ArrayList < Integer > var_0 , int var_1 ) {
if ( var_0 == null || var_0 . size ( ) == 0 ) {
return - 1 ;
}
HashMap < Integer , Integer > var_2 = new HashMap < Integer , Integer > ( ) ;
for ( Integer var_3 : var_0 ) {
if ( var_2 . containsKey ( var_3 ) ) {
var_2 . put ( var_3 , var_2 . get ( var_3 ) + 1 ) ;
}
else {
if ( var_2 . size ( ) == var_1 ) {
Iterator < Map . Entry < Integer , Integer >> var_4 = var_2 . entrySet ( ) . iterator ( ) ;
while ( var_4 . hasNext ( ) ) {
Map . Entry < Integer , Integer > var_5 = var_4 . next ( ) ;
if ( var_5 . getValue ( ) - 1 == 0 ) {
var_4 . remove ( ) ;
}
else {
var_2 . put ( var_5 . getKey ( ) , var_5 . getValue ( ) - 1 ) ;
}
}
}
else {
var_2 . put ( var_3 , 1 ) ;
}
}
}
int var_6 = 0 ;
int var_7 = 0 ;
for ( Map . Entry < Integer , Integer > var_5 : var_2 . entrySet ( ) ) {
if ( var_5 . getValue ( ) > var_7 ) {
var_7 = var_5 . getValue ( ) ;
var_6 = var_5 . getKey ( ) ;
}
}
return var_6 ;
}
| 2 | 0<SEP>1 |
429 | <awangdev>Number Of Corner Rectangles_1.java | private boolean validate(int[][] grid) {
return grid == null || grid.length == 0 || grid[0] == null || grid[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
| 1 | 0 |
430 | <awangdev>Subarray Sum Closest_1.java | public int compare(int[] a, int[] b) {
return Integer.compare(a[0], b[0]);
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
return Integer . compare ( var_0 [ 0 ] , var_1 [ 0 ] ) ;
}
| 1 | 0 |
431 | <awangdev>Distinct Subsequences_1.java | public int numDistinct(String s, String t) {
if (s == null || t == null || t.length() > s.length()) {
return 0;
} else if (s.equals(t)) {
return 1;
}
int m = s.length();
int n = t.length();
int[][] dp = new int[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (j == 0) {
dp[i][j] = 1;
continue;
}
if (i == 0) {
dp[i][j] = 0;
continue;
}
dp[i][j] = dp[i - 1][j];
if (s.charAt(i - 1) == t.charAt(j - 1)) {
dp[i][j] += 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 || var_1 . length ( ) > var_0 . length ( ) ) {
return 0 ;
}
else if ( var_0 . equals ( var_1 ) ) {
return 1 ;
}
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 ++ ) {
for ( int var_6 = 0 ;
var_6 <= var_3 ;
var_6 ++ ) {
if ( var_6 == 0 ) {
var_4 [ var_5 ] [ var_6 ] = 1 ;
continue ;
}
if ( var_5 == 0 ) {
var_4 [ var_5 ] [ var_6 ] = 0 ;
continue ;
}
var_4 [ var_5 ] [ var_6 ] = var_4 [ var_5 - 1 ] [ 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 ] ;
}
}
}
return var_4 [ var_2 ] [ var_3 ] ;
}
| 2 | 0<SEP>1 |
432 | <awangdev>140. Word Break II_1.java | private String output(List<String> list) {
StringBuffer sb = new StringBuffer();
for (String s : list) sb.append(s).append(" ");
return sb.toString().trim();
} | private String var_0 ( List < String > var_1 ) {
StringBuffer var_2 = new StringBuffer ( ) ;
for ( String var_3 : var_1 ) var_2 . append ( var_3 ) . append ( " " ) ;
return var_2 . toString ( ) . trim ( ) ;
}
| 1 | <D_QUOTE> <D_QUOTE> |
433 | <awangdev>689. Maximum Sum of 3 Non-Overlapping Subarrays_1.java | private int[] calcLeft(int[] nums, int[] presum, int k) {
int n = nums.length;
int[] left = new int[n];
for (int i = k, total = presum[k] - presum[0]; i < n; i++) {
int sum = presum[i + 1] - presum[i + 1 - k];
if (sum > total) {
left[i] = i + 1 - k;
total = sum;
} else left[i] = left[i - 1];
}
return left;
} | private int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
int var_3 = var_0 . length ;
int [ ] var_4 = new int [ var_3 ] ;
for ( int var_5 = var_2 , var_6 = var_1 [ var_2 ] - var_1 [ 0 ] ;
var_5 < var_3 ;
var_5 ++ ) {
int var_7 = var_1 [ var_5 + 1 ] - var_1 [ var_5 + 1 - var_2 ] ;
if ( var_7 > var_6 ) {
var_4 [ var_5 ] = var_5 + 1 - var_2 ;
var_6 = var_7 ;
}
else var_4 [ var_5 ] = var_4 [ var_5 - 1 ] ;
}
return var_4 ;
}
| 2 | 0<SEP>1 |
434 | <awangdev>Counting Bits_2.java | public int[] countBits(int num) {
if (num < 0) {
return null;
}
int[] dp = new int[num + 1];
dp[0] = 0;
for (int i = 1; i <= num; i++) {
int prevNum = i >> 1;
dp[i] = dp[prevNum] + (i & 1);
}
return dp;
} | public int [ ] sample_funcname ( int var_0 ) {
if ( var_0 < 0 ) {
return null ;
}
int [ ] var_1 = new int [ var_0 + 1 ] ;
var_1 [ 0 ] = 0 ;
for ( int var_2 = 1 ;
var_2 <= var_0 ;
var_2 ++ ) {
int var_3 = var_2 >> 1 ;
var_1 [ var_2 ] = var_1 [ var_3 ] + ( var_2 & 1 ) ;
}
return var_1 ;
}
| 2 | 0<SEP>1 |
435 | <awangdev>301. Remove Invalid Parentheses_1.java | private void dfs(List<String> rst, String s, int i, int j, char open, char close) {
for (int count = 0; i < s.length(); i++) {
count += s.charAt(i) == open ? 1 : 0;
count -= s.charAt(i) == close ? 1 : 0;
if (count < 0) {
int init = j;
for (; j <= i; j++) {
if (s.charAt(j) == close && (j == init || s.charAt(j) != s.charAt(j - 1))) {
dfs(rst, s.substring(0, j) + s.substring(j + 1), i, j, open, close);
}
}
return;
}
}
String reversed = new StringBuffer(s).reverse().toString();
if (open == '(') {
dfs(rst, reversed, 0, 0, close, open);
} else {
rst.add(reversed);
}
} | private void sample_funcname ( List < String > rst , String s , int i , int j , char open , char close ) {
for ( int count = 0 ;
i < s . length ( ) ;
i ++ ) {
count += s . charAt ( i ) == open ? 1 : 0 ;
count -= s . charAt ( i ) == close ? 1 : 0 ;
if ( count < 0 ) {
int init = j ;
for ( ;
j <= i ;
j ++ ) {
if ( s . charAt ( j ) == close && ( j == init || s . charAt ( j ) != s . charAt ( j - 1 ) ) ) {
dfs ( rst , s . substring ( 0 , j ) + s . substring ( j + 1 ) , i , j , open , close ) ;
}
}
return ;
}
}
String reversed = new StringBuffer ( s ) . reverse ( ) . toString ( ) ;
if ( open == '(' ) {
dfs ( rst , reversed , 0 , 0 , close , open ) ;
}
else {
rst . add ( reversed ) ;
}
}
| 3 | 0<SEP><S_QUOTE>(<S_QUOTE><SEP>1 |
436 | <awangdev>43. Multiply Strings_4.java | private int toInt(String s, int x) {
return s.charAt(x) - '0';
} | private int sample_funcname ( String var_0 , int var_1 ) {
return var_0 . charAt ( var_1 ) - '0' ;
}
| 1 | <S_QUOTE>0<S_QUOTE> |
437 | <awangdev>Coins in a Line_1.java | public boolean firstWillWin(int n) {
if (n <= 0) {
return false;
}
boolean[] dp = new boolean[n + 1];
dp[0] = false;
dp[1] = true;
for (int i = 2; i <= n; i++) {
dp[i] = !dp[i - 2] || !dp[i - 1];
}
return dp[n];
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
boolean [ ] var_2 = new boolean [ var_1 + 1 ] ;
var_2 [ 0 ] = false ;
var_2 [ 1 ] = true ;
for ( int var_3 = 2 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] = ! var_2 [ var_3 - 2 ] || ! var_2 [ var_3 - 1 ] ;
}
return var_2 [ var_1 ] ;
}
| 3 | 2<SEP>0<SEP>1 |
438 | <awangdev>785. Is Graph Bipartite_2.java | public boolean isBipartite(int[][] graph) {
int n = graph.length;
Boolean[] states = new Boolean[n];
for (int i = 0; i < n; i++) {
if (states[i] != null) continue;
Queue<Integer> queue = new LinkedList<Integer>();
queue.offer(i);
states[i] = true;
while (!queue.isEmpty()) {
int curr = queue.poll();
for (int next : graph[curr]) {
if (states[next] != null) {
if (states[next] == states[curr]) return false;
continue;
}
states[next] = !states[curr];
queue.offer(next);
}
}
}
return true;
} | public boolean var_0 ( int [ ] [ ] var_1 ) {
int var_2 = var_1 . length ;
Boolean [ ] var_3 = new Boolean [ var_2 ] ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
if ( var_3 [ var_4 ] != null ) continue ;
Queue < Integer > var_5 = new LinkedList < Integer > ( ) ;
var_5 . offer ( var_4 ) ;
var_3 [ var_4 ] = true ;
while ( ! var_5 . isEmpty ( ) ) {
int var_6 = var_5 . poll ( ) ;
for ( int var_7 : var_1 [ var_6 ] ) {
if ( var_3 [ var_7 ] != null ) {
if ( var_3 [ var_7 ] == var_3 [ var_6 ] ) return false ;
continue ;
}
var_3 [ var_7 ] = ! var_3 [ var_6 ] ;
var_5 . offer ( var_7 ) ;
}
}
}
return true ;
}
| 1 | 0 |
439 | <awangdev>Trapping Rain Water II_3.java | public int trapRainWater(int[][] heightMap) {
if (heightMap == null || heightMap.length == 0 || heightMap[0] == null || heightMap[0].length == 0) {
return 0;
}
int m = heightMap.length;
int n = heightMap[0].length;
int[][] maxLeft = new int[m][n];
int[][] maxRight = new int[m][n];
int[][] maxUp = new int[m][n];
int[][] maxDown = new int[m][n];
for (int i = 0; i < m; i++) {
maxLeft[i][0] = heightMap[i][0];
maxRight[i][n - 1] = heightMap[i][n - 1];
}
for (int j = 0; j < n; j++) {
maxUp[0][j] = heightMap[0][j];
maxDown[m - 1][j] = heightMap[m - 1][j];
}
for (int i = 0; i < m; i++) {
for (int j = 1; j < n; j++) {
maxLeft[i][j] = Math.max(maxLeft[i][j - 1], heightMap[i][j]);
maxRight[i][n - j - 1] = Math.max(maxRight[i][n - j], heightMap[i][n - j - 1]);
}
}
for (int j = 0; j < n; j++) {
for (int i = 1; i < m; i++) {
maxUp[i][j] = Math.max(maxUp[i - 1][j], heightMap[i][j]);
maxDown[m - i - 1][j] = Math.max(maxDown[m - i][j], heightMap[m - i - 1][j]);
}
}
int total = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int lowestHeight = Math.min(Math.min(maxLeft[i][j], maxRight[i][j]), Math.min(maxUp[i][j], maxDown[i][j]));
total += lowestHeight > heightMap[i][j] ? lowestHeight - heightMap[i][j] : 0;
}
}
return total;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) {
return 0 ;
}
int var_1 = var_0 . length ;
int var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 ] [ var_2 ] ;
int [ ] [ ] var_4 = new int [ var_1 ] [ var_2 ] ;
int [ ] [ ] var_5 = new int [ var_1 ] [ var_2 ] ;
int [ ] [ ] var_6 = new int [ var_1 ] [ var_2 ] ;
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
var_3 [ var_7 ] [ 0 ] = var_0 [ var_7 ] [ 0 ] ;
var_4 [ var_7 ] [ var_2 - 1 ] = var_0 [ var_7 ] [ var_2 - 1 ] ;
}
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
var_5 [ 0 ] [ var_8 ] = var_0 [ 0 ] [ var_8 ] ;
var_6 [ var_1 - 1 ] [ var_8 ] = var_0 [ var_1 - 1 ] [ var_8 ] ;
}
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
for ( int var_8 = 1 ;
var_8 < var_2 ;
var_8 ++ ) {
var_3 [ var_7 ] [ var_8 ] = Math . max ( var_3 [ var_7 ] [ var_8 - 1 ] , var_0 [ var_7 ] [ var_8 ] ) ;
var_4 [ var_7 ] [ var_2 - var_8 - 1 ] = Math . max ( var_4 [ var_7 ] [ var_2 - var_8 ] , var_0 [ var_7 ] [ var_2 - var_8 - 1 ] ) ;
}
}
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
for ( int var_7 = 1 ;
var_7 < var_1 ;
var_7 ++ ) {
var_5 [ var_7 ] [ var_8 ] = Math . max ( var_5 [ var_7 - 1 ] [ var_8 ] , var_0 [ var_7 ] [ var_8 ] ) ;
var_6 [ var_1 - var_7 - 1 ] [ var_8 ] = Math . max ( var_6 [ var_1 - var_7 ] [ var_8 ] , var_0 [ var_1 - var_7 - 1 ] [ var_8 ] ) ;
}
}
int var_9 = 0 ;
for ( int var_7 = 0 ;
var_7 < var_1 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
int var_10 = Math . min ( Math . min ( var_3 [ var_7 ] [ var_8 ] , var_4 [ var_7 ] [ var_8 ] ) , Math . min ( var_5 [ var_7 ] [ var_8 ] , var_6 [ var_7 ] [ var_8 ] ) ) ;
var_9 += var_10 > var_0 [ var_7 ] [ var_8 ] ? var_10 - var_0 [ var_7 ] [ var_8 ] : 0 ;
}
}
return var_9 ;
}
| 2 | 0<SEP>1 |
440 | <awangdev>Permutation Index_1.java | public long permutationIndex(int[] A) {
if (A == null || A.length == 0) {
return 0;
}
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
int n = A.length;
long rst = 0;
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = i + 1; j < n; j++) {
if (A[j] < A[i]) {
count++;
}
}
map.put(A[i], count);
}
for (int i = 0; i < n; i++) {
long fact = 1;
for (int j = (n - i - 1); j >= 1; j--) {
fact *= j;
}
rst += map.get(A[i]) * fact;
}
return rst + 1;
} | public long sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
HashMap < Integer , Integer > var_1 = new HashMap < Integer , Integer > ( ) ;
int var_2 = var_0 . length ;
long var_3 = 0 ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
int var_5 = 0 ;
for ( int var_6 = var_4 + 1 ;
var_6 < var_2 ;
var_6 ++ ) {
if ( var_0 [ var_6 ] < var_0 [ var_4 ] ) {
var_5 ++ ;
}
}
var_1 . put ( var_0 [ var_4 ] , var_5 ) ;
}
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
long var_7 = 1 ;
for ( int var_6 = ( var_2 - var_4 - 1 ) ;
var_6 >= 1 ;
var_6 -- ) {
var_7 *= var_6 ;
}
var_3 += var_1 . get ( var_0 [ var_4 ] ) * var_7 ;
}
return var_3 + 1 ;
}
| 2 | 0<SEP>1 |
441 | <awangdev>1108. Defanging an IP Address_1.java | public String defangIPaddr(String address) {
StringBuffer sb = new StringBuffer();
for (char c : address.toCharArray()) {
if (c == '.') {
sb.append("[.]");
} else {
sb.append(c);
}
}
return sb.toString();
} | public String var_0 ( String var_1 ) {
StringBuffer var_2 = new StringBuffer ( ) ;
for ( char var_3 : var_1 . toCharArray ( ) ) {
if ( var_3 == '.' ) {
var_2 . append ( "[.]" ) ;
}
else {
var_2 . append ( var_3 ) ;
}
}
return var_2 . toString ( ) ;
}
| 2 | <D_QUOTE>[.]<D_QUOTE><SEP><S_QUOTE>.<S_QUOTE> |
442 | <awangdev>Trapping Rain Water II_2.java | private boolean isInvalid(int[][] heightMap) {
return heightMap == null || heightMap.length == 0 || heightMap[0] == null || heightMap[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
| 1 | 0 |
443 | <awangdev>63. Unique Paths II_1.java | public int uniquePathsWithObstacles(int[][] obstacleGrid) {
if (obstacleGrid == null || obstacleGrid.length == 0) return 0;
int m = obstacleGrid.length, n = obstacleGrid[0].length;
int[][] dp = new int[m][n];
for (int i = 0, j = 0; j < n; j++) {
if (obstacleGrid[i][j] == 1) break;
dp[i][j] = 1;
}
for (int i = 0, j = 0; i < m; i++) {
if (obstacleGrid[i][j] == 1) break;
dp[i][j] = 1;
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
if (obstacleGrid[i][j] == 1) continue;
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][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 , var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 ] [ var_2 ] ;
for ( int var_4 = 0 , var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
if ( var_0 [ var_4 ] [ var_5 ] == 1 ) break ;
var_3 [ var_4 ] [ var_5 ] = 1 ;
}
for ( int var_4 = 0 , var_5 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
if ( var_0 [ var_4 ] [ var_5 ] == 1 ) break ;
var_3 [ var_4 ] [ var_5 ] = 1 ;
}
for ( int var_4 = 1 ;
var_4 < var_1 ;
var_4 ++ ) {
for ( int var_5 = 1 ;
var_5 < var_2 ;
var_5 ++ ) {
if ( var_0 [ var_4 ] [ var_5 ] == 1 ) continue ;
var_3 [ var_4 ] [ var_5 ] = var_3 [ var_4 - 1 ] [ var_5 ] + var_3 [ var_4 ] [ var_5 - 1 ] ;
}
}
return var_3 [ var_1 - 1 ] [ var_2 - 1 ] ;
}
| 2 | 0<SEP>1 |
444 | <awangdev>322. Coin Change_1.java | public int coinChange(int[] coins, int amount) {
int[] dp = new int[amount + 1];
dp[0] = 0;
for (int i = 1; i <= amount; i++) {
dp[i] = Integer.MAX_VALUE;
for (int coin : coins) {
if (coin > i || dp[i - coin] == Integer.MAX_VALUE) continue;
dp[i] = Math.min(dp[i], dp[i - coin] + 1);
}
}
return dp[amount] == Integer.MAX_VALUE ? -1 : dp[amount];
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
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 ] = Integer . MAX_VALUE ;
for ( int var_4 : var_0 ) {
if ( var_4 > var_3 || var_2 [ var_3 - var_4 ] == Integer . MAX_VALUE ) continue ;
var_2 [ var_3 ] = Math . min ( var_2 [ var_3 ] , var_2 [ var_3 - var_4 ] + 1 ) ;
}
}
return var_2 [ var_1 ] == Integer . MAX_VALUE ? - 1 : var_2 [ var_1 ] ;
}
| 2 | 1<SEP>0 |
445 | <awangdev>Word Ladder II_2.java | public ArrayList<String> expand(String str, Set<String> dict) {
ArrayList<String> list = new ArrayList<String>();
for (int i = 0; i < str.length(); i++) {
for (int j = 0; j < 26; j++) {
if (str.charAt(i) != (char)('a' + j)) {
String newStr = str.substring(0, i) + (char)('a' + j) + str.substring(i + 1);
if (dict.contains(newStr)) {
list.add(newStr);
}
}
}
}
return list;
} | public ArrayList < String > var_0 ( String var_1 , Set < String > var_2 ) {
ArrayList < String > var_3 = new ArrayList < String > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < 26 ;
var_5 ++ ) {
if ( var_1 . charAt ( var_4 ) != ( char ) ( 'a' + var_5 ) ) {
String var_6 = var_1 . substring ( 0 , var_4 ) + ( char ) ( 'a' + var_5 ) + var_1 . substring ( var_4 + 1 ) ;
if ( var_2 . contains ( var_6 ) ) {
var_3 . add ( var_6 ) ;
}
}
}
}
return var_3 ;
}
| 4 | 0<SEP>26<SEP>1<SEP><S_QUOTE>a<S_QUOTE> |
446 | <awangdev>245. Shortest Word Distance III_2.java | public int shortestWordDistance(String[] words, String word1, String word2) {
Map<String, List<Integer>> map = new HashMap<>();
for (int i = 0; i < words.length; i++) {
map.putIfAbsent(words[i], new ArrayList<>());
map.get(words[i]).add(i);
}
List<Integer> list1 = map.get(word1), list2 = map.get(word2);
int min = Integer.MAX_VALUE;
int i = 0, j = 0, m = list1.size(), n = list2.size();
while (i < m && j < n) {
int p1 = list1.get(i), p2 = list2.get(j);
if (p1 == p2) {
if (i + 1 < m) i++;
else if (j + 1 <= n) j++;
continue;
}
min = Math.min(min, Math.abs(p1 - p2));
if (p1 < p2) i++;
else j++;
}
return min;
} | public int sample_funcname ( String [ ] var_0 , String var_1 , String var_2 ) {
Map < String , List < Integer >> var_3 = new HashMap < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
var_3 . putIfAbsent ( var_0 [ var_4 ] , new ArrayList < > ( ) ) ;
var_3 . get ( var_0 [ var_4 ] ) . add ( var_4 ) ;
}
List < Integer > var_5 = var_3 . get ( var_1 ) , var_6 = var_3 . get ( var_2 ) ;
int min = Integer . MAX_VALUE ;
int var_4 = 0 , var_7 = 0 , var_8 = var_5 . size ( ) , var_9 = var_6 . size ( ) ;
while ( var_4 < var_8 && var_7 < var_9 ) {
int var_10 = var_5 . get ( var_4 ) , var_11 = var_6 . get ( var_7 ) ;
if ( var_10 == var_11 ) {
if ( var_4 + 1 < var_8 ) var_4 ++ ;
else if ( var_7 + 1 <= var_9 ) var_7 ++ ;
continue ;
}
min = Math . min ( min , Math . abs ( var_10 - var_11 ) ) ;
if ( var_10 < var_11 ) var_4 ++ ;
else var_7 ++ ;
}
return min ;
}
| 2 | 0<SEP>1 |
447 | <awangdev>43. Multiply Strings_5.java | public String multiply(String num1, String num2) {
if (num1 == null || num2 == null) {
return "";
} else if (num1.length() == 0 || num2.length() == 0) {
return num1.length() == 0 ? num2 : num1;
} else if (num1.equals("0") || num2.equals("0")) {
return "0";
}
num1 = new StringBuffer(num1).reverse().toString();
num2 = new StringBuffer(num2).reverse().toString();
int[] product = new int[num1.length() + num2.length()];
for (int i = 0; i < num1.length(); i++) {
int a = num1.charAt(i) - '0';
for (int j = 0; j < num2.length(); j++) {
int b = num2.charAt(j) - '0';
product[i + j] += a * b;
}
}
StringBuffer sb = new StringBuffer();
for (int i = 0; i < product.length; i++) {
int number = product[i] % 10;
int carrier = product[i] / 10;
sb.append(number);
if (i < product.length - 1) {
product[i + 1] += carrier;
}
}
sb.reverse();
while (sb.length() > 0 && sb.charAt(0) == '0') {
sb.deleteCharAt(0);
}
return sb.toString();
} | public String var_0 ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null ) {
return "" ;
}
else if ( var_1 . length ( ) == 0 || var_2 . length ( ) == 0 ) {
return var_1 . length ( ) == 0 ? var_2 : var_1 ;
}
else if ( var_1 . equals ( "0" ) || var_2 . equals ( "0" ) ) {
return "0" ;
}
var_1 = new StringBuffer ( var_1 ) . reverse ( ) . toString ( ) ;
var_2 = new StringBuffer ( var_2 ) . reverse ( ) . toString ( ) ;
int [ ] var_3 = new int [ var_1 . length ( ) + var_2 . length ( ) ] ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ( ) ;
var_4 ++ ) {
int var_5 = var_1 . charAt ( var_4 ) - '0' ;
for ( int var_6 = 0 ;
var_6 < var_2 . length ( ) ;
var_6 ++ ) {
int var_7 = var_2 . charAt ( var_6 ) - '0' ;
var_3 [ var_4 + var_6 ] += var_5 * var_7 ;
}
}
StringBuffer var_8 = new StringBuffer ( ) ;
for ( int var_4 = 0 ;
var_4 < var_3 . length ;
var_4 ++ ) {
int var_9 = var_3 [ var_4 ] % 10 ;
int var_10 = var_3 [ var_4 ] / 10 ;
var_8 . append ( var_9 ) ;
if ( var_4 < var_3 . length - 1 ) {
var_3 [ var_4 + 1 ] += var_10 ;
}
}
var_8 . reverse ( ) ;
while ( var_8 . length ( ) > 0 && var_8 . charAt ( 0 ) == '0' ) {
var_8 . deleteCharAt ( 0 ) ;
}
return var_8 . toString ( ) ;
}
| 6 | 0<SEP>1<SEP>10<SEP><S_QUOTE>0<S_QUOTE><SEP><D_QUOTE>0<D_QUOTE><SEP><D_QUOTE><D_QUOTE> |
448 | <awangdev>373. Find K Pairs with Smallest Sums_2.java | private PriorityQueue<List<Integer>> initQueue(int k) {
return new PriorityQueue<>(k, new Comparator<List<Integer>>() {
public int compare(List<Integer> a, List<Integer> b) {
return b.get(0) + b.get(1) - a.get(0) - a.get(1);
}
});
} | private PriorityQueue < List < Integer >> var_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_3 . get ( 0 ) + var_3 . get ( 1 ) - var_2 . get ( 0 ) - var_2 . get ( 1 ) ;
}
}
) ;
}
| 2 | 0<SEP>1 |
449 | <awangdev>34. Find First and Last Position of Element in Sorted Array_2.java | private int binarySearch(int[] nums, int target, boolean isLeft) {
int n = nums.length, start = 0, end = n - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2, val = nums[mid];
if (val == target) {
if (isLeft && mid - 1 >= 0 && nums[mid - 1] == target) end = mid;
else if (!isLeft && mid + 1 <= n - 1 && nums[mid + 1] == target) start = mid;
else return 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_6 - 1 >= 0 && var_0 [ var_6 - 1 ] == var_1 ) var_5 = var_6 ;
else if ( ! var_2 && var_6 + 1 <= var_3 - 1 && var_0 [ var_6 + 1 ] == var_1 ) var_4 = var_6 ;
else return 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 |
450 | <awangdev>49. Group Anagrams_1.java | private String getKey(String s) {
int[] count = new int[26];
for (char c : s.toCharArray()) count[c - 'a']++;
StringBuilder sb = new StringBuilder();
for (int i = 0; i < 26; i++) sb.append(count[i]);
return sb.toString();
} | private String var_0 ( String var_1 ) {
int [ ] var_2 = new int [ 26 ] ;
for ( char var_3 : var_1 . toCharArray ( ) ) var_2 [ var_3 - 'a' ] ++ ;
StringBuilder var_4 = new StringBuilder ( ) ;
for ( int var_5 = 0 ;
var_5 < 26 ;
var_5 ++ ) var_4 . append ( var_2 [ var_5 ] ) ;
return var_4 . toString ( ) ;
}
| 3 | 0<SEP>26<SEP><S_QUOTE>a<S_QUOTE> |
451 | <awangdev>516. Longest Palindromic Subsequence_2.java | public int longestPalindromeSubseq(String s) {
char[] ss = s.toCharArray();
int n = s.length();
int[][] dp = new int[n][n];
for (int i = 0; i < n; i++) dp[i][i] = 1;
for (int i = 0; i < n - 1; i++) dp[i][i + 1] = ss[i] == ss[i + 1] ? 2 : 1;
for (int len = 3; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
int j = len + i - 1;
dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]);
if (ss[i] == ss[j]) dp[i][j] = Math.max(dp[i][j], dp[i + 1][j - 1] + 2);
}
}
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 = 0 ;
var_4 < var_2 ;
var_4 ++ ) var_3 [ var_4 ] [ var_4 ] = 1 ;
for ( int var_4 = 0 ;
var_4 < var_2 - 1 ;
var_4 ++ ) var_3 [ var_4 ] [ var_4 + 1 ] = var_1 [ var_4 ] == var_1 [ var_4 + 1 ] ? 2 : 1 ;
for ( int var_5 = 3 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_4 = 0 ;
var_4 <= var_2 - var_5 ;
var_4 ++ ) {
int var_6 = var_5 + var_4 - 1 ;
var_3 [ var_4 ] [ var_6 ] = Math . max ( var_3 [ var_4 + 1 ] [ var_6 ] , var_3 [ var_4 ] [ var_6 - 1 ] ) ;
if ( var_1 [ var_4 ] == var_1 [ var_6 ] ) var_3 [ var_4 ] [ var_6 ] = Math . max ( var_3 [ var_4 ] [ var_6 ] , var_3 [ var_4 + 1 ] [ var_6 - 1 ] + 2 ) ;
}
}
return var_3 [ 0 ] [ var_2 - 1 ] ;
}
| 4 | 2<SEP>0<SEP>3<SEP>1 |
452 | <awangdev>239. Sliding Window Maximum_2.java | private void outQueue(Deque<Integer> deque, int num) {
if (deque.peekFirst() == num) deque.pollFirst();
} | private void var_0 ( Deque < Integer > var_1 , int var_2 ) {
if ( var_1 . peekFirst ( ) == var_2 ) var_1 . pollFirst ( ) ;
}
| 0 | null |
453 | <awangdev>414. Third Maximum Number_1.java | public int thirdMax(int[] nums) {
PriorityQueue<Integer> pq = new PriorityQueue<>();
for (int num : nums) {
if (!pq.contains(num)) {
pq.offer(num);
if (pq.size() > 3) pq.poll();
}
}
if (pq.size() < 3) {
while (pq.size() > 1) pq.poll();
}
return pq.peek();
} | public int sample_funcname ( int [ ] var_0 ) {
PriorityQueue < Integer > var_1 = new PriorityQueue < > ( ) ;
for ( int var_2 : var_0 ) {
if ( ! var_1 . contains ( var_2 ) ) {
var_1 . offer ( var_2 ) ;
if ( var_1 . size ( ) > 3 ) var_1 . poll ( ) ;
}
}
if ( var_1 . size ( ) < 3 ) {
while ( var_1 . size ( ) > 1 ) var_1 . poll ( ) ;
}
return var_1 . peek ( ) ;
}
| 2 | 1<SEP>3 |
454 | <awangdev>Total Occurrence of Target_1.java | public int totalOccurrence(int[] A, int target) {
if (A == null || A.length == 0) {
return 0;
}
int start = 0;
int end = A.length - 1;
int mid = start + (end - start)/2;
int first = 0;
int last = 0;
while (start + 1 < end){
mid = start + (end - start)/2;
if (A[mid] == target) {
if (mid - 1 >= 0 && A[mid - 1] == target) {
end = mid;
} else {
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 0;
}
if (mid + 1 < A.length && A[mid + 1] != target) {
return 1;
}
start = first;
last = start + 1;
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;
} else {
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;
}
return last - first + 1;
} | 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 = var_0 . length - 1 ;
int var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
int var_5 = 0 ;
int var_6 = 0 ;
while ( var_2 + 1 < var_3 ) {
var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
if ( var_0 [ var_4 ] == var_1 ) {
if ( var_4 - 1 >= 0 && var_0 [ var_4 - 1 ] == var_1 ) {
var_3 = var_4 ;
}
else {
break ;
}
}
else if ( var_0 [ var_4 ] < var_1 ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
if ( var_0 [ var_2 ] == var_1 ) {
var_5 = var_2 ;
}
else if ( var_0 [ var_4 ] == var_1 ) {
var_5 = var_4 ;
}
else if ( var_0 [ var_3 ] == var_1 ) {
var_5 = var_3 ;
}
else {
return 0 ;
}
if ( var_4 + 1 < var_0 . length && var_0 [ var_4 + 1 ] != var_1 ) {
return 1 ;
}
var_2 = var_5 ;
var_6 = var_2 + 1 ;
var_3 = var_0 . length - 1 ;
while ( var_2 + 1 < var_3 ) {
var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
if ( var_0 [ var_4 ] == var_1 ) {
if ( var_4 + 1 < var_0 . length && var_0 [ var_4 + 1 ] == var_1 ) {
var_2 = var_4 ;
}
else {
break ;
}
}
else if ( var_0 [ var_4 ] < var_1 ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
if ( var_0 [ var_3 ] == var_1 ) {
var_6 = var_3 ;
}
else if ( var_0 [ var_4 ] == var_1 ) {
var_6 = var_4 ;
}
else if ( var_0 [ var_2 ] == var_1 ) {
var_6 = var_2 ;
}
return var_6 - var_5 + 1 ;
}
| 3 | 2<SEP>0<SEP>1 |
455 | <awangdev>Binary Gap_1.java | public int binaryGap(int N) {
if (N <= 0) return 0;
int max = 0, start = -1, end = 0;
while (N > 0) {
if ((N & 1) == 1) {
if (start == -1) start = end;
else {
max = Math.max(max, end - start);
start = end;
}
}
end++;
N = N >> 1;
}
return max;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 0 ) return 0 ;
int max = 0 , var_1 = - 1 , var_2 = 0 ;
while ( var_0 > 0 ) {
if ( ( var_0 & 1 ) == 1 ) {
if ( var_1 == - 1 ) var_1 = var_2 ;
else {
max = Math . max ( max , var_2 - var_1 ) ;
var_1 = var_2 ;
}
}
var_2 ++ ;
var_0 = var_0 >> 1 ;
}
return max ;
}
| 2 | 0<SEP>1 |
457 | <awangdev>274.H-Index_4.java | public int hIndex(int[] citations) {
if (citations == null || citations.length == 0) {
return 0;
}
int n = citations.length;
Arrays.sort(citations);
for (int i = 0; i < n; i++) {
int h = n - i;
if (citations[i] >= h) {
return h;
}
}
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 ;
Arrays . sort ( var_0 ) ;
for ( int var_2 = 0 ;
var_2 < var_1 ;
var_2 ++ ) {
int var_3 = var_1 - var_2 ;
if ( var_0 [ var_2 ] >= var_3 ) {
return var_3 ;
}
}
return 0 ;
}
| 1 | 0 |
458 | <awangdev>8. String to Integer (atoi)_1.java | private boolean isDigit(char c) {
return c >= '0' && c <= '9';
} | private boolean var_0 ( char var_1 ) {
return var_1 >= '0' && var_1 <= '9' ;
}
| 2 | <S_QUOTE>9<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE> |
459 | <awangdev>Best Time to Buy and Sell Stock III_1.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int profit = 0;
int n = prices.length;
int[][] dp = new int[n][5];
dp[0][0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j < 5; j++) {
int dailyDiff = prices[i] - prices[i - 1];
if (j % 2 == 0) {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - 1] + dailyDiff);
profit = Math.max(profit, dp[i][j]);
} else {
dp[i][j] = Math.max(dp[i - 1][j] + dailyDiff, dp[i - 1][j - 1]);
}
}
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = 0 ;
int var_2 = var_0 . length ;
int [ ] [ ] var_3 = new int [ var_2 ] [ 5 ] ;
var_3 [ 0 ] [ 0 ] = 0 ;
for ( int var_4 = 1 ;
var_4 < var_2 ;
var_4 ++ ) {
for ( int var_5 = 1 ;
var_5 < 5 ;
var_5 ++ ) {
int var_6 = var_0 [ var_4 ] - var_0 [ var_4 - 1 ] ;
if ( var_5 % 2 == 0 ) {
var_3 [ var_4 ] [ var_5 ] = Math . max ( var_3 [ var_4 - 1 ] [ var_5 ] , var_3 [ var_4 - 1 ] [ var_5 - 1 ] + var_6 ) ;
var_1 = Math . max ( var_1 , var_3 [ var_4 ] [ var_5 ] ) ;
}
else {
var_3 [ var_4 ] [ var_5 ] = Math . max ( var_3 [ var_4 - 1 ] [ var_5 ] + var_6 , var_3 [ var_4 - 1 ] [ var_5 - 1 ] ) ;
}
}
}
return var_1 ;
}
| 4 | 2<SEP>0<SEP>5<SEP>1 |
460 | <awangdev>Walls and Gates_4.java | private boolean validate(int[][] rooms) {
return rooms == null || rooms.length == 0 || rooms[0] == null || rooms[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
| 1 | 0 |
461 | <awangdev>57. Insert Interval_2.java | private int[][] convert(List<int[]> list) {
int[][] rst = new int[list.size()][2];
for (int i = 0; i < list.size(); i++) {
rst[i][0] = list.get(i)[0];
rst[i][1] = list.get(i)[1];
}
return rst;
} | private int [ ] [ ] sample_funcname ( List < int [ ] > var_0 ) {
int [ ] [ ] var_1 = new int [ var_0 . size ( ) ] [ 2 ] ;
for ( int var_2 = 0 ;
var_2 < var_0 . size ( ) ;
var_2 ++ ) {
var_1 [ var_2 ] [ 0 ] = var_0 . get ( var_2 ) [ 0 ] ;
var_1 [ var_2 ] [ 1 ] = var_0 . get ( var_2 ) [ 1 ] ;
}
return var_1 ;
}
| 3 | 0<SEP>1<SEP>2 |
462 | <awangdev>Palindrome Permutation II_1.java | public void permutateUnique(List<String> rst, String str, boolean[] visited, String s) {
if (str.length() == s.length()) {
rst.add(str);
return;
}
for (int i = 0; i < s.length(); i++) {
if (visited[i] || (i > 0 && !visited[i - 1] && s.charAt(i - 1) == s.charAt(i))) {
continue;
}
visited[i] = true;
permutateUnique(rst, str + s.charAt(i), visited, s);
visited[i] = false;
}
} | public void sample_funcname ( List < String > rst , String str , boolean [ ] visited , String s ) {
if ( str . length ( ) == s . length ( ) ) {
rst . add ( str ) ;
return ;
}
for ( int i = 0 ;
i < s . length ( ) ;
i ++ ) {
if ( visited [ i ] || ( i > 0 && ! visited [ i - 1 ] && s . charAt ( i - 1 ) == s . charAt ( i ) ) ) {
continue ;
}
visited [ i ] = true ;
permutateUnique ( rst , str + s . charAt ( i ) , visited , s ) ;
visited [ i ] = false ;
}
}
| 2 | 0<SEP>1 |
463 | <awangdev>207. Course Schedule_1.java | private boolean validateInput(int numCourses, int[][] prerequisites) {
return numCourses == 0 || prerequisites == null || prerequisites.length == 0
|| prerequisites[0] == null || prerequisites[0].length == 0;
} | private boolean var_0 ( int var_1 , int [ ] [ ] var_2 ) {
return var_1 == 0 || var_2 == null || var_2 . length == 0 || var_2 [ 0 ] == null || var_2 [ 0 ] . length == 0 ;
}
| 1 | 0 |
464 | <awangdev>Reshape the Matrix_1.java | public int[][] matrixReshape(int[][] nums, int r, int c) {
int totalElements = nums.length * nums[0].length;
if (totalElements != r * c || totalElements % r != 0) {
return nums;
}
final int[][] result = new int[r][c];
int newR = 0;
int newC = 0;
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums[i].length; j++) {
result[newR][newC] = nums[i][j];
newC++;
if (newC == c) {
newC = 0;
newR++;
}
}
}
return result;
} | public int [ ] [ ] sample_funcname ( int [ ] [ ] var_0 , int var_1 , int var_2 ) {
int var_3 = var_0 . length * var_0 [ 0 ] . length ;
if ( var_3 != var_1 * var_2 || var_3 % var_1 != 0 ) {
return var_0 ;
}
final int [ ] [ ] var_4 = new int [ var_1 ] [ var_2 ] ;
int var_5 = 0 ;
int var_6 = 0 ;
for ( int var_7 = 0 ;
var_7 < var_0 . length ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_0 [ var_7 ] . length ;
var_8 ++ ) {
var_4 [ var_5 ] [ var_6 ] = var_0 [ var_7 ] [ var_8 ] ;
var_6 ++ ;
if ( var_6 == var_2 ) {
var_6 = 0 ;
var_5 ++ ;
}
}
}
return var_4 ;
}
| 1 | 0 |
465 | <awangdev>159. Longest Substring with At Most Two Distinct Characters_2.java | public int lengthOfLongestSubstringTwoDistinct(String s) {
if (s == null || s.length() == 0) return 0;
int n = s.length();
Map<Character, Integer> lastOccurMap = new HashMap<>();
int left = 0, right = 0, max = 0;
while (right < n) {
if (lastOccurMap.size() <= 2) {
lastOccurMap.put(s.charAt(right), right++);
}
if (lastOccurMap.size() > 2) {
int leftMost = right;
for (int index : lastOccurMap.values()) {
leftMost = Math.min(leftMost, index);
}
lastOccurMap.remove(s.charAt(leftMost));
left = leftMost + 1;
}
max = Math.max(max, right - left);
}
return max;
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) return 0 ;
int var_1 = var_0 . length ( ) ;
Map < Character , Integer > var_2 = new HashMap < > ( ) ;
int var_3 = 0 , var_4 = 0 , max = 0 ;
while ( var_4 < var_1 ) {
if ( var_2 . size ( ) <= 2 ) {
var_2 . put ( var_0 . charAt ( var_4 ) , var_4 ++ ) ;
}
if ( var_2 . size ( ) > 2 ) {
int var_5 = var_4 ;
for ( int var_6 : var_2 . values ( ) ) {
var_5 = Math . min ( var_5 , var_6 ) ;
}
var_2 . remove ( var_0 . charAt ( var_5 ) ) ;
var_3 = var_5 + 1 ;
}
max = Math . max ( max , var_4 - var_3 ) ;
}
return max ;
}
| 3 | 0<SEP>1<SEP>2 |
466 | <awangdev>Permutation Sequence_1.java | public String getPermutation(int n, int k) {
if (n <= 0 || k <= 0) {
return "";
}
StringBuffer sb = new StringBuffer();
boolean[] visited = new boolean[n];
int factorio = 1;
for (int i = 1; i < n; i++) {
factorio *= i;
}
k = k - 1;
for (int i = 0; i < n; i++) {
int index = k / factorio;
k = k % factorio;
for (int j = 0; j < n; j++) {
if (!visited[j]) {
if (index == 0) {
visited[j] = true;
sb.append((char)('0' + j + 1));
break;
} else {
index--;
}
}
}
if (i < n - 1) {
factorio = factorio / (n - i - 1);
}
}
return sb.toString();
} | public String var_0 ( int var_1 , int var_2 ) {
if ( var_1 <= 0 || var_2 <= 0 ) {
return "" ;
}
StringBuffer var_3 = new StringBuffer ( ) ;
boolean [ ] var_4 = new boolean [ var_1 ] ;
int var_5 = 1 ;
for ( int var_6 = 1 ;
var_6 < var_1 ;
var_6 ++ ) {
var_5 *= var_6 ;
}
var_2 = var_2 - 1 ;
for ( int var_6 = 0 ;
var_6 < var_1 ;
var_6 ++ ) {
int var_7 = var_2 / var_5 ;
var_2 = var_2 % var_5 ;
for ( int var_8 = 0 ;
var_8 < var_1 ;
var_8 ++ ) {
if ( ! var_4 [ var_8 ] ) {
if ( var_7 == 0 ) {
var_4 [ var_8 ] = true ;
var_3 . append ( ( char ) ( '0' + var_8 + 1 ) ) ;
break ;
}
else {
var_7 -- ;
}
}
}
if ( var_6 < var_1 - 1 ) {
var_5 = var_5 / ( var_1 - var_6 - 1 ) ;
}
}
return var_3 . toString ( ) ;
}
| 4 | <S_QUOTE>0<S_QUOTE><SEP>0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
467 | <awangdev>Bricks Falling When Hit_2.java | private int flip(int[][] grid, Set<String> visited) {
int count = 0;
for (String s : visited) {
String[] ss = s.split("@");
int i = Integer.parseInt(ss[0]), j = Integer.parseInt(ss[1]);
if (grid[i][j] > 0) {
grid[i][j] = 0;
count++;
}
}
return count;
} | private int sample_funcname ( int [ ] [ ] var_0 , Set < String > var_1 ) {
int var_2 = 0 ;
for ( String var_3 : var_1 ) {
String [ ] var_4 = var_3 . split ( "@" ) ;
int var_5 = Integer . parseInt ( var_4 [ 0 ] ) , var_6 = Integer . parseInt ( var_4 [ 1 ] ) ;
if ( var_0 [ var_5 ] [ var_6 ] > 0 ) {
var_0 [ var_5 ] [ var_6 ] = 0 ;
var_2 ++ ;
}
}
return var_2 ;
}
| 3 | <D_QUOTE>@<D_QUOTE><SEP>0<SEP>1 |
468 | <awangdev>743. Network Delay Time_2.java | private Map<Integer, List<int[]>> buildGraph(int[][] times) {
Map<Integer, List<int[]>> graph = new HashMap<>();
for (int[] record : times) {
graph.putIfAbsent(record[0], new ArrayList<>());
graph.get(record[0]).add(record);
}
return graph;
} | private Map < Integer , List < int [ ] >> var_0 ( int [ ] [ ] var_1 ) {
Map < Integer , List < int [ ] >> var_2 = new HashMap < > ( ) ;
for ( int [ ] var_3 : var_1 ) {
var_2 . putIfAbsent ( var_3 [ 0 ] , new ArrayList < > ( ) ) ;
var_2 . get ( var_3 [ 0 ] ) . add ( var_3 ) ;
}
return var_2 ;
}
| 1 | 0 |
469 | <awangdev>Backpack III_5.java | public int backPackIII(int[] A, int[] V, int m) {
if (A == null || V == null || A.length != V.length) {
return 0;
}
int n = A.length;
int[][] dp = new int[n + 1][m + 1];
for (int j = 0; j <= m; j++) {
dp[0][j] = -1;
}
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
dp[i][j] = dp[i - 1][j];
if (j - A[i - 1] >= 0) {
dp[i][j] = Math.max(dp[i][j], dp[i][j - A[i - 1]] + V[i - 1]);
}
}
}
int rst = 0;
for (int j = 0; j <= m; j++) {
rst = Math.max(rst, dp[n][j]);
}
return rst;
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
if ( var_0 == null || var_1 == null || var_0 . length != var_1 . length ) {
return 0 ;
}
int var_3 = var_0 . length ;
int [ ] [ ] var_4 = new int [ var_3 + 1 ] [ var_2 + 1 ] ;
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
var_4 [ 0 ] [ var_5 ] = - 1 ;
}
var_4 [ 0 ] [ 0 ] = 0 ;
for ( int var_6 = 1 ;
var_6 <= var_3 ;
var_6 ++ ) {
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
var_4 [ var_6 ] [ var_5 ] = var_4 [ var_6 - 1 ] [ var_5 ] ;
if ( var_5 - var_0 [ var_6 - 1 ] >= 0 ) {
var_4 [ var_6 ] [ var_5 ] = Math . max ( var_4 [ var_6 ] [ var_5 ] , var_4 [ var_6 ] [ var_5 - var_0 [ var_6 - 1 ] ] + var_1 [ var_6 - 1 ] ) ;
}
}
}
int var_7 = 0 ;
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
var_7 = Math . max ( var_7 , var_4 [ var_3 ] [ var_5 ] ) ;
}
return var_7 ;
}
| 2 | 0<SEP>1 |
470 | <awangdev>Cracking the Safe_1.java | public String crackSafe(int n, int k) {
Set<String> set = new HashSet<>();
StringBuffer sb = new StringBuffer();
for (int i = 0; i < n; i++) sb.append("0");
set.add(sb.toString());
for (int i = 0; i < Math.pow(k, n); i++) {
String tail = sb.substring(sb.length() - n + 1);
for (int j = k - 1; j >= 0; j--) {
String newStr = tail + j;
if (!set.contains(newStr)) {
set.add(newStr);
sb.append(j);
break;
}
}
}
return sb.toString();
} | public String var_0 ( int var_1 , int var_2 ) {
Set < String > var_3 = new HashSet < > ( ) ;
StringBuffer var_4 = new StringBuffer ( ) ;
for ( int var_5 = 0 ;
var_5 < var_1 ;
var_5 ++ ) var_4 . append ( "0" ) ;
var_3 . add ( var_4 . toString ( ) ) ;
for ( int var_5 = 0 ;
var_5 < Math . pow ( var_2 , var_1 ) ;
var_5 ++ ) {
String var_6 = var_4 . substring ( var_4 . length ( ) - var_1 + 1 ) ;
for ( int var_7 = var_2 - 1 ;
var_7 >= 0 ;
var_7 -- ) {
String var_8 = var_6 + var_7 ;
if ( ! var_3 . contains ( var_8 ) ) {
var_3 . add ( var_8 ) ;
var_4 . append ( var_7 ) ;
break ;
}
}
}
return var_4 . toString ( ) ;
}
| 3 | <D_QUOTE>0<D_QUOTE><SEP>0<SEP>1 |
471 | <awangdev>Scramble String_2.java | public boolean isScramble(String s1, String s2) {
if (s1 == null || s2 == null || s1.length() != s2.length()) {
return false;
}
int n = s1.length();
boolean[][][] dp = new boolean[n][n][n + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j][1] = s1.charAt(i) == s2.charAt(j);
}
}
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
for (int j = 0; j <= n - len; j++) {
for (int w = 1; w < len; w++) {
dp[i][j][len] |= (dp[i][j][w] && dp[i + w][j + w][len - w]);
dp[i][j][len] |= (dp[i][j + len - w][w] && dp[i + w][j][len - w]);
}
}
}
}
return dp[0][0][n];
} | 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 ;
}
int var_3 = var_1 . length ( ) ;
boolean [ ] [ ] [ ] var_4 = new boolean [ var_3 ] [ var_3 ] [ var_3 + 1 ] ;
for ( int var_5 = 0 ;
var_5 < var_3 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 < var_3 ;
var_6 ++ ) {
var_4 [ var_5 ] [ var_6 ] [ 1 ] = var_1 . charAt ( var_5 ) == var_2 . charAt ( var_6 ) ;
}
}
for ( int var_7 = 2 ;
var_7 <= var_3 ;
var_7 ++ ) {
for ( int var_5 = 0 ;
var_5 <= var_3 - var_7 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 <= var_3 - var_7 ;
var_6 ++ ) {
for ( int var_8 = 1 ;
var_8 < var_7 ;
var_8 ++ ) {
var_4 [ var_5 ] [ var_6 ] [ var_7 ] |= ( var_4 [ var_5 ] [ var_6 ] [ var_8 ] && var_4 [ var_5 + var_8 ] [ var_6 + var_8 ] [ var_7 - var_8 ] ) ;
var_4 [ var_5 ] [ var_6 ] [ var_7 ] |= ( var_4 [ var_5 ] [ var_6 + var_7 - var_8 ] [ var_8 ] && var_4 [ var_5 + var_8 ] [ var_6 ] [ var_7 - var_8 ] ) ;
}
}
}
}
return var_4 [ 0 ] [ 0 ] [ var_3 ] ;
}
| 3 | 1<SEP>0<SEP>2 |
472 | <awangdev>76. Minimum Window Substring_2.java | public String minWindow(String s, String t) {
int end = 0, start = 0, head = 0, counter = t.length();
int minLength = Integer.MAX_VALUE, n = s.length();
String rst = "";
int[] map = new int[256];
for (char c : t.toCharArray()) map[c]++;
while (end < n) {
if (map[s.charAt(end++)]-- > 0) counter--;
while (counter == 0) {
int len = end - start;
if (len < minLength) {
minLength = len;
head = start;
}
if (map[s.charAt(start++)]++ == 0) counter++;
}
}
return minLength == Integer.MAX_VALUE ? "" : s.substring(head, head + minLength);
} | public String var_0 ( String var_1 , String var_2 ) {
int var_3 = 0 , var_4 = 0 , var_5 = 0 , var_6 = var_2 . length ( ) ;
int var_7 = Integer . MAX_VALUE , var_8 = var_1 . length ( ) ;
String var_9 = "" ;
int [ ] var_10 = new int [ 256 ] ;
for ( char var_11 : var_2 . toCharArray ( ) ) var_10 [ var_11 ] ++ ;
while ( var_3 < var_8 ) {
if ( var_10 [ var_1 . charAt ( var_3 ++ ) ] -- > 0 ) var_6 -- ;
while ( var_6 == 0 ) {
int var_12 = var_3 - var_4 ;
if ( var_12 < var_7 ) {
var_7 = var_12 ;
var_5 = var_4 ;
}
if ( var_10 [ var_1 . charAt ( var_4 ++ ) ] ++ == 0 ) var_6 ++ ;
}
}
return var_7 == Integer . MAX_VALUE ? "" : var_1 . substring ( var_5 , var_5 + var_7 ) ;
}
| 3 | 0<SEP>256<SEP><D_QUOTE><D_QUOTE> |
473 | <awangdev>Kth Largest Element in an Array_3.java | public void swap( ArrayList<Integer>nums, int x, int y){
int temp = nums.get(x);
nums.set(x, nums.get(y));
nums.set(y, temp);
} | public void var_0 ( ArrayList < Integer > var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 . get ( var_2 ) ;
var_1 . set ( var_2 , var_1 . get ( var_3 ) ) ;
var_1 . set ( var_3 , var_4 ) ;
}
| 0 | null |
474 | <awangdev>Sort Colors II_1.java | private void swap(int[] nums, int x, int y){
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
| 0 | null |
475 | <awangdev>151. Reverse Words in a String_2.java | private void reverse(String[] strs) {
int i = 0, j = strs.length - 1;
while (i < j) {
String temp = strs[i];
strs[i++] = strs[j];
strs[j--] = temp;
}
} | private void var_0 ( String [ ] var_1 ) {
int var_2 = 0 , var_3 = var_1 . length - 1 ;
while ( var_2 < var_3 ) {
String var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ++ ] = var_1 [ var_3 ] ;
var_1 [ var_3 -- ] = var_4 ;
}
}
| 2 | 0<SEP>1 |
476 | <awangdev>210. Course Schedule II_1.java | public int[] findOrder(int numCourses, int[][] prerequisites) {
if (numCourses == 0 || prerequisites == null) {
return new int[numCourses];
}
List[] inDegreeEdges = new ArrayList[numCourses];
int[] dependencyCount = new int[numCourses];
for (int i = 0; i < numCourses; i++) inDegreeEdges[i] = new ArrayList<>();
for (int[] prerequisite : prerequisites) {
inDegreeEdges[prerequisite[1]].add(prerequisite[0]);
dependencyCount[prerequisite[0]]++;
}
Queue<Integer> queue = new LinkedList<>();
for (int i = 0; i < numCourses; i++) {
if (dependencyCount[i] == 0) queue.add(i);
}
List<Integer> sortedList = new ArrayList<>();
while (!queue.isEmpty()) {
int leafNode = queue.poll();
sortedList.add(leafNode);
List<Integer> dependencies = inDegreeEdges[leafNode];
for (int node : dependencies) {
if (--dependencyCount[node] == 0) queue.add(node);
}
}
if (sortedList.size() != numCourses) {
return new int[0];
}
int[] rst = new int[sortedList.size()];
for (int i = 0; i < sortedList.size(); i++) {
rst[i] = sortedList.get(i);
}
return rst;
} | public int [ ] sample_funcname ( int var_0 , int [ ] [ ] var_1 ) {
if ( var_0 == 0 || var_1 == null ) {
return new int [ var_0 ] ;
}
List [ ] var_2 = new ArrayList [ var_0 ] ;
int [ ] var_3 = new int [ var_0 ] ;
for ( int var_4 = 0 ;
var_4 < var_0 ;
var_4 ++ ) var_2 [ var_4 ] = new ArrayList < > ( ) ;
for ( int [ ] var_5 : var_1 ) {
var_2 [ var_5 [ 1 ] ] . add ( var_5 [ 0 ] ) ;
var_3 [ var_5 [ 0 ] ] ++ ;
}
Queue < Integer > var_6 = new LinkedList < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_0 ;
var_4 ++ ) {
if ( var_3 [ var_4 ] == 0 ) var_6 . add ( var_4 ) ;
}
List < Integer > var_7 = new ArrayList < > ( ) ;
while ( ! var_6 . isEmpty ( ) ) {
int var_8 = var_6 . poll ( ) ;
var_7 . add ( var_8 ) ;
List < Integer > var_9 = var_2 [ var_8 ] ;
for ( int var_10 : var_9 ) {
if ( -- var_3 [ var_10 ] == 0 ) var_6 . add ( var_10 ) ;
}
}
if ( var_7 . size ( ) != var_0 ) {
return new int [ 0 ] ;
}
int [ ] var_11 = new int [ var_7 . size ( ) ] ;
for ( int var_4 = 0 ;
var_4 < var_7 . size ( ) ;
var_4 ++ ) {
var_11 [ var_4 ] = var_7 . get ( var_4 ) ;
}
return var_11 ;
}
| 2 | 0<SEP>1 |
477 | <awangdev>611. Valid Triangle Number_2.java | public int triangleNumber(int[] nums) {
Arrays.sort(nums);
int n = nums.length, count = 0;
for (int i = 0; i <= n - 3; i++) {
if (nums[i] == 0) continue;
int k = i + 2;
for (int j = i + 1; j <= n - 2; j++) {
while (k < n && nums[i] + nums[j] > nums[k]) k++;
count += k - j - 1;
}
}
return count;
} | public int sample_funcname ( int [ ] var_0 ) {
Arrays . sort ( var_0 ) ;
int var_1 = var_0 . length , var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 <= var_1 - 3 ;
var_3 ++ ) {
if ( var_0 [ var_3 ] == 0 ) continue ;
int var_4 = var_3 + 2 ;
for ( int var_5 = var_3 + 1 ;
var_5 <= var_1 - 2 ;
var_5 ++ ) {
while ( var_4 < var_1 && var_0 [ var_3 ] + var_0 [ var_5 ] > var_0 [ var_4 ] ) var_4 ++ ;
var_2 += var_4 - var_5 - 1 ;
}
}
return var_2 ;
}
| 4 | 0<SEP>3<SEP>1<SEP>2 |
478 | <awangdev>217. Contains Duplicate_2.java | public boolean containsDuplicate(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
Arrays.sort(nums);
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] == nums[i + 1]) {
return true;
}
}
return false;
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
Arrays . sort ( var_1 ) ;
for ( int var_2 = 0 ;
var_2 < var_1 . length - 1 ;
var_2 ++ ) {
if ( var_1 [ var_2 ] == var_1 [ var_2 + 1 ] ) {
return true ;
}
}
return false ;
}
| 2 | 0<SEP>1 |
480 | <awangdev>Container With Most Water_1.java | public int maxArea(int[] heights) {
if (heights == null || heights.length == 0) {
return 0;
}
int left = 0;
int right = heights.length - 1;
int maxWater = Integer.MIN_VALUE;
while (left < right) {
int lowWall = heights[left] < heights[right] ? heights[left] : heights[right];
maxWater = Math.max(maxWater, (right - left) * lowWall);
if (heights[left] < heights[right]) {
left++;
} else {
right--;
}
}
return maxWater;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = 0 ;
int var_2 = var_0 . length - 1 ;
int var_3 = Integer . MIN_VALUE ;
while ( var_1 < var_2 ) {
int var_4 = var_0 [ var_1 ] < var_0 [ var_2 ] ? var_0 [ var_1 ] : var_0 [ var_2 ] ;
var_3 = Math . max ( var_3 , ( var_2 - var_1 ) * var_4 ) ;
if ( var_0 [ var_1 ] < var_0 [ var_2 ] ) {
var_1 ++ ;
}
else {
var_2 -- ;
}
}
return var_3 ;
}
| 2 | 0<SEP>1 |
481 | <awangdev>Max Area of Island_1.java | private boolean validate(int[][] grid, int x, int y) {
return x >= 0 && x < grid.length && y >= 0 && y < grid[0].length && grid[x][y] == 1;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 >= 0 && var_2 < var_1 . length && var_3 >= 0 && var_3 < var_1 [ 0 ] . length && var_1 [ var_2 ] [ var_3 ] == 1 ;
}
| 2 | 0<SEP>1 |
482 | <awangdev>Sliding Puzzle_2.java | private boolean evaluate(int[] nums) {
for (int i = 0; i < nums.length; i++) {
if (i + 1 != nums[i]) {
if (i == 5 && nums[i] == 0) continue;
return false;
}
}
return true;
} | private boolean var_0 ( int [ ] var_1 ) {
for ( int var_2 = 0 ;
var_2 < var_1 . length ;
var_2 ++ ) {
if ( var_2 + 1 != var_1 [ var_2 ] ) {
if ( var_2 == 5 && var_1 [ var_2 ] == 0 ) continue ;
return false ;
}
}
return true ;
}
| 3 | 0<SEP>5<SEP>1 |
483 | <awangdev>58. Length of Last Word_2.java | public int lengthOfLastWord(String s) {
if (s == null || s.length() == 0) {
return 0;
}
String[] arr = s.split("\\ ");
String lastWord = arr[arr.length - 1];
return lastWord.length();
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
String [ ] var_1 = var_0 . split ( "\\ " ) ;
String var_2 = var_1 [ var_1 . length - 1 ] ;
return var_2 . length ( ) ;
}
| 3 | <D_QUOTE>\\ <D_QUOTE><SEP>0<SEP>1 |
484 | <awangdev>686. Repeated String Match_1.java | private boolean validate(String A, String B) {
boolean[] checkA = new boolean[256];
boolean[] checkB = new boolean[256];
for (char c : A.toCharArray()) {
checkA[c] = true;
}
for (char c : B.toCharArray()) {
checkB[c] = true;
}
for (int i = 0; i < 256; i++) {
if (checkB[i] && !checkA[i]) {
return false;
}
}
return true;
} | private boolean var_0 ( String var_1 , String var_2 ) {
boolean [ ] var_3 = new boolean [ 256 ] ;
boolean [ ] var_4 = new boolean [ 256 ] ;
for ( char var_5 : var_1 . toCharArray ( ) ) {
var_3 [ var_5 ] = true ;
}
for ( char var_5 : var_2 . toCharArray ( ) ) {
var_4 [ var_5 ] = true ;
}
for ( int var_6 = 0 ;
var_6 < 256 ;
var_6 ++ ) {
if ( var_4 [ var_6 ] && ! var_3 [ var_6 ] ) {
return false ;
}
}
return true ;
}
| 2 | 0<SEP>256 |
485 | <awangdev>Perfect Squares_4.java | public int numSquares(int n) {
if (n <= 0) {
return 0;
}
int[] dp = new int[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
int maxSqrNum = (int)Math.floor(Math.sqrt(i));
int min = Integer.MAX_VALUE;
for (int j = 1; j <= maxSqrNum; j++) {
min = Math.min(min, dp[i - j * j] + 1);
}
dp[i] = min;
}
return dp[n];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 0 ) {
return 0 ;
}
int [ ] var_1 = new int [ var_0 + 1 ] ;
var_1 [ 0 ] = 0 ;
for ( int var_2 = 1 ;
var_2 <= var_0 ;
var_2 ++ ) {
int var_3 = ( int ) Math . floor ( Math . sqrt ( var_2 ) ) ;
int min = Integer . MAX_VALUE ;
for ( int var_4 = 1 ;
var_4 <= var_3 ;
var_4 ++ ) {
min = Math . min ( min , var_1 [ var_2 - var_4 * var_4 ] + 1 ) ;
}
var_1 [ var_2 ] = min ;
}
return var_1 [ var_0 ] ;
}
| 2 | 0<SEP>1 |
486 | <awangdev>408. Valid Word Abbreviation_1.java | private boolean isInt(char c) {
return c >= '0' && c <= '9';
} | private boolean var_0 ( char var_1 ) {
return var_1 >= '0' && var_1 <= '9' ;
}
| 2 | <S_QUOTE>9<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE> |
487 | <awangdev>Word Search II_2.java | public boolean search(char[][] board, String word, int i, int j, int start) {
if (start == word.length()) {
return true;
}
if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != word.charAt(start)) {
return false;
}
board[i][j] = '#';
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 |
488 | <awangdev>Backpack_3.java | public int backPack(int m, int[] A) {
if (A == null || A.length < 0) {
return 0;
}
int n = A.length;
boolean[][] dp = new boolean[n + 1][m + 1];
dp[0][0] = true;
for (int j = 1; j <= m; j++) {
dp[0][j] = false;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
dp[i][j] = dp[i - 1][j];
if (j - A[i - 1] >= 0) {
dp[i][j] |= dp[i - 1][j - A[i - 1]];
}
}
}
for (int j = m; j >= 0; j--) {
if (dp[n][j]) {
return j;
}
}
return 0;
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length < 0 ) {
return 0 ;
}
int var_2 = var_1 . length ;
boolean [ ] [ ] var_3 = new boolean [ var_2 + 1 ] [ var_0 + 1 ] ;
var_3 [ 0 ] [ 0 ] = true ;
for ( int var_4 = 1 ;
var_4 <= var_0 ;
var_4 ++ ) {
var_3 [ 0 ] [ var_4 ] = false ;
}
for ( int var_5 = 1 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_4 = 0 ;
var_4 <= var_0 ;
var_4 ++ ) {
var_3 [ var_5 ] [ var_4 ] = var_3 [ var_5 - 1 ] [ var_4 ] ;
if ( var_4 - var_1 [ var_5 - 1 ] >= 0 ) {
var_3 [ var_5 ] [ var_4 ] |= var_3 [ var_5 - 1 ] [ var_4 - var_1 [ var_5 - 1 ] ] ;
}
}
}
for ( int var_4 = var_0 ;
var_4 >= 0 ;
var_4 -- ) {
if ( var_3 [ var_2 ] [ var_4 ] ) {
return var_4 ;
}
}
return 0 ;
}
| 2 | 0<SEP>1 |
490 | <awangdev>Largest Rectangle in Histogram_1.java | public int largestRectangleArea(int[] heights) {
if (heights == null || heights.length == 0) {
return 0;
}
int n = heights.length;
int max = 0;
Stack<Integer> stack = new Stack<>();
for (int i = 0; i <= n; i++) {
int currHeight = i == n ? -1 : heights[i];
while (!stack.isEmpty() && currHeight <= heights[stack.peek()]) {
int currPeekHeight = heights[stack.pop()];
int width = stack.isEmpty() ? i : i - stack.peek() - 1;
max = Math.max(max, currPeekHeight * width);
}
stack.push(i);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = var_0 . length ;
int max = 0 ;
Stack < Integer > var_2 = new Stack < > ( ) ;
for ( int var_3 = 0 ;
var_3 <= var_1 ;
var_3 ++ ) {
int var_4 = var_3 == var_1 ? - 1 : var_0 [ var_3 ] ;
while ( ! var_2 . isEmpty ( ) && var_4 <= var_0 [ var_2 . peek ( ) ] ) {
int var_5 = var_0 [ var_2 . pop ( ) ] ;
int var_6 = var_2 . isEmpty ( ) ? var_3 : var_3 - var_2 . peek ( ) - 1 ;
max = Math . max ( max , var_5 * var_6 ) ;
}
var_2 . push ( var_3 ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
491 | <awangdev>399. Evaluate Division_1.java | private String getKey(String a, String b) {
return String.format("%s->%s", a, b);
} | private String var_0 ( String var_1 , String var_2 ) {
return String . format ( "%s->%s" , var_1 , var_2 ) ;
}
| 1 | <D_QUOTE>%s->%s<D_QUOTE> |
492 | <awangdev>64. Minimum Path Sum_3.java | public int minPathSum(int[][] grid) {
if (grid == null || grid.length == 0 || grid[0] == null || grid[0].length == 0) return 0;
int m = grid.length, n = grid[0].length;
int[][] dp = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = grid[i][j];
if (i == 0 && j == 0) continue;
if (i == 0 && j > 0) dp[i][j] += dp[i][j - 1];
else if (i > 0 && j == 0) dp[i][j] += dp[i - 1][j];
else dp[i][j] += Math.min(dp[i - 1][j], dp[i][j - 1]);
}
}
return dp[m - 1][n - 1];
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) return 0 ;
int var_1 = var_0 . length , var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 ] [ var_2 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
var_3 [ var_4 ] [ var_5 ] = var_0 [ var_4 ] [ var_5 ] ;
if ( var_4 == 0 && var_5 == 0 ) continue ;
if ( var_4 == 0 && var_5 > 0 ) var_3 [ var_4 ] [ var_5 ] += var_3 [ var_4 ] [ var_5 - 1 ] ;
else if ( var_4 > 0 && var_5 == 0 ) var_3 [ var_4 ] [ var_5 ] += var_3 [ var_4 - 1 ] [ var_5 ] ;
else var_3 [ var_4 ] [ var_5 ] += Math . min ( var_3 [ var_4 - 1 ] [ var_5 ] , var_3 [ var_4 ] [ var_5 - 1 ] ) ;
}
}
return var_3 [ var_1 - 1 ] [ var_2 - 1 ] ;
}
| 2 | 0<SEP>1 |
493 | <awangdev>311. Sparse Matrix Multiplication_1.java | private boolean validate(int[][] A, int[][] B) {
if (A == null || B == null) return true;
if (A[0].length != B.length) return true;
return false;
} | private boolean var_0 ( int [ ] [ ] var_1 , int [ ] [ ] var_2 ) {
if ( var_1 == null || var_2 == null ) return true ;
if ( var_1 [ 0 ] . length != var_2 . length ) return true ;
return false ;
}
| 1 | 0 |
494 | <awangdev>327. Count of Range Sum_1.java | private int mergeSort(long[] preSum, int lower, int upper, int start, int end) {
if (start + 1 >= end) return 0;
int mid = (start + end) / 2, count = 0;
count += mergeSort(preSum, lower, upper, start, mid);
count += mergeSort(preSum, lower, upper, mid, end);
int lo = mid, hi = mid;
for (int i = start; i < mid; i++) {
while (lo < end && preSum[lo] - preSum[i] < lower) lo++;
while (hi < end && preSum[hi] - preSum[i] <= upper) hi++;
count += hi - lo;
}
Arrays.sort(preSum, start, end);
return count;
} | private int sample_funcname ( long [ ] preSum , int lower , int upper , int start , int end ) {
if ( start + 1 >= end ) return 0 ;
int mid = ( start + end ) / 2 , count = 0 ;
count += mergeSort ( preSum , lower , upper , start , mid ) ;
count += mergeSort ( preSum , lower , upper , mid , end ) ;
int lo = mid , hi = mid ;
for ( int i = start ;
i < mid ;
i ++ ) {
while ( lo < end && preSum [ lo ] - preSum [ i ] < lower ) lo ++ ;
while ( hi < end && preSum [ hi ] - preSum [ i ] <= upper ) hi ++ ;
count += hi - lo ;
}
Arrays . sort ( preSum , start , end ) ;
return count ;
}
| 3 | 1<SEP>0<SEP>2 |
495 | <awangdev>Find Peak Element_4.java | public int findPeak(int[] A) {
int start = 1;
int end = A.length - 2;
int mid;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (A[mid] > A[mid - 1] && A[mid] > A[mid + 1]) {
return mid;
} else if (A[mid] > A[start] && A[mid] < A[mid + 1]) {
start = mid;
} else {
end = mid;
}
}
if (A[start] > A[start - 1] && A[start] > A[start + 1]) {
return start;
} else {
return end;
}
} | public int sample_funcname ( int [ ] var_0 ) {
int var_1 = 1 ;
int var_2 = var_0 . length - 2 ;
int var_3 ;
while ( var_1 + 1 < var_2 ) {
var_3 = var_1 + ( var_2 - var_1 ) / 2 ;
if ( var_0 [ var_3 ] > var_0 [ var_3 - 1 ] && var_0 [ var_3 ] > var_0 [ var_3 + 1 ] ) {
return var_3 ;
}
else if ( var_0 [ var_3 ] > var_0 [ var_1 ] && var_0 [ var_3 ] < var_0 [ var_3 + 1 ] ) {
var_1 = var_3 ;
}
else {
var_2 = var_3 ;
}
}
if ( var_0 [ var_1 ] > var_0 [ var_1 - 1 ] && var_0 [ var_1 ] > var_0 [ var_1 + 1 ] ) {
return var_1 ;
}
else {
return var_2 ;
}
}
| 2 | 1<SEP>2 |
496 | <awangdev>567. Permutation in String_1.java | private Integer[] countFreq(String s) {
Integer[] freq = new Integer[256];
for (char c : s.toCharArray()) freq[c] = freq[c] == null ? 1 : freq[c] + 1;
return freq;
} | private Integer [ ] var_0 ( String var_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 |
497 | <awangdev>Expression Evaluation_1.java | public int getWeight(int base, String s) {
if (s.equals("+") || s.equals("-")) {
return base + 1;
}
if (s.equals("*") || s.equals("/")) {
return base + 2;
}
return Integer.MAX_VALUE;
} | public int sample_funcname ( int var_0 , String var_1 ) {
if ( var_1 . equals ( "+" ) || var_1 . equals ( "-" ) ) {
return var_0 + 1 ;
}
if ( var_1 . equals ( "*" ) || var_1 . equals ( "/" ) ) {
return var_0 + 2 ;
}
return Integer . MAX_VALUE ;
}
| 6 | <D_QUOTE>-<D_QUOTE><SEP>2<SEP><D_QUOTE>/<D_QUOTE><SEP>1<SEP><D_QUOTE>+<D_QUOTE><SEP><D_QUOTE>*<D_QUOTE> |
498 | <awangdev>10. Regular Expression Matching_1.java | public boolean isMatch(String s, String p) {
if (s == null || p == null) return false;
int m = s.length(), n = p.length();
boolean[][] dp = new boolean[m + 1][n + 1];
char[] ss = s.toCharArray();
char[] pp = p.toCharArray();
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0 && j == 0) {
dp[i][j] = true;
continue;
}
if (j == 0) {
dp[i][j] = false;
continue;
}
dp[i][j] = false;
if (pp[j - 1] != '*') {
if (i >= 1 && (ss[i - 1] == pp[j - 1] || pp[j - 1] == '.')) {
dp[i][j] = dp[i - 1][j - 1];
}
} else {
if (j >= 2 ) {
dp[i][j] |= dp[i][j - 2];
}
if (j >= 2 && i >= 1 && (ss[i - 1] == pp[j - 2] || pp[j - 2] == '.')) {
dp[i][j] |= dp[i - 1][j];
}
}
}
}
return dp[m][n];
} | public boolean var_0 ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null ) return false ;
int var_3 = var_1 . length ( ) , var_4 = var_2 . length ( ) ;
boolean [ ] [ ] var_5 = new boolean [ var_3 + 1 ] [ var_4 + 1 ] ;
char [ ] var_6 = var_1 . toCharArray ( ) ;
char [ ] var_7 = var_2 . toCharArray ( ) ;
for ( int var_8 = 0 ;
var_8 <= var_3 ;
var_8 ++ ) {
for ( int var_9 = 0 ;
var_9 <= var_4 ;
var_9 ++ ) {
if ( var_8 == 0 && var_9 == 0 ) {
var_5 [ var_8 ] [ var_9 ] = true ;
continue ;
}
if ( var_9 == 0 ) {
var_5 [ var_8 ] [ var_9 ] = false ;
continue ;
}
var_5 [ var_8 ] [ var_9 ] = false ;
if ( var_7 [ var_9 - 1 ] != '*' ) {
if ( var_8 >= 1 && ( var_6 [ var_8 - 1 ] == var_7 [ var_9 - 1 ] || var_7 [ var_9 - 1 ] == '.' ) ) {
var_5 [ var_8 ] [ var_9 ] = var_5 [ var_8 - 1 ] [ var_9 - 1 ] ;
}
}
else {
if ( var_9 >= 2 ) {
var_5 [ var_8 ] [ var_9 ] |= var_5 [ var_8 ] [ var_9 - 2 ] ;
}
if ( var_9 >= 2 && var_8 >= 1 && ( var_6 [ var_8 - 1 ] == var_7 [ var_9 - 2 ] || var_7 [ var_9 - 2 ] == '.' ) ) {
var_5 [ var_8 ] [ var_9 ] |= var_5 [ var_8 - 1 ] [ var_9 ] ;
}
}
}
}
return var_5 [ var_3 ] [ var_4 ] ;
}
| 5 | 2<SEP>1<SEP>0<SEP><S_QUOTE>*<S_QUOTE><SEP><S_QUOTE>.<S_QUOTE> |
499 | <awangdev>91. Decode Ways_3.java | private boolean check(String s, int i) {
if (i + 1 >= s.length()) return false;
int twoDigit = (s.charAt(i) - '0') * 10 + (s.charAt(i + 1) - '0');
return twoDigit <= 26 && twoDigit >= 10;
} | private boolean var_0 ( String var_1 , int var_2 ) {
if ( var_2 + 1 >= var_1 . length ( ) ) return false ;
int var_3 = ( var_1 . charAt ( var_2 ) - '0' ) * 10 + ( var_1 . charAt ( var_2 + 1 ) - '0' ) ;
return var_3 <= 26 && var_3 >= 10 ;
}
| 4 | 10<SEP>1<SEP>26<SEP><S_QUOTE>0<S_QUOTE> |
500 | <awangdev>200. Number of Islands_3.java | private int convertToIndex(int x, int y, int rowLength) {
return x * rowLength + y;
} | private int sample_funcname ( int var_0 , int var_1 , int var_2 ) {
return var_0 * var_2 + var_1 ;
}
| 0 | null |
501 | <awangdev>46. Permutations_6.java | public List<List<Integer>> permute(int[] nums) {
List<List<Integer>> rst = new ArrayList<>();
if (nums == null || nums.length == 0) return rst;
List<Integer> numList = new ArrayList<>();
for (int num : nums) numList.add(num);
int n = nums.length;
Queue<List<Integer>> queue = new LinkedList<>();
queue.offer(new ArrayList<>());
while (!queue.isEmpty()) {
List<Integer> list = queue.poll();
if (list.size() == n) {
rst.add(new ArrayList<>(list));
continue;
}
List<Integer> candidates = new ArrayList<>(numList);
candidates.removeAll(list);
for (int num : candidates) {
list.add(num);
queue.offer(new ArrayList<>(list));
list.remove(list.size() - 1);
}
}
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 ;
List < Integer > var_3 = new ArrayList < > ( ) ;
for ( int var_4 : var_1 ) var_3 . add ( var_4 ) ;
int var_5 = var_1 . length ;
Queue < List < Integer >> var_6 = new LinkedList < > ( ) ;
var_6 . offer ( new ArrayList < > ( ) ) ;
while ( ! var_6 . isEmpty ( ) ) {
List < Integer > var_7 = var_6 . poll ( ) ;
if ( var_7 . size ( ) == var_5 ) {
var_2 . add ( new ArrayList < > ( var_7 ) ) ;
continue ;
}
List < Integer > var_8 = new ArrayList < > ( var_3 ) ;
var_8 . removeAll ( var_7 ) ;
for ( int var_4 : var_8 ) {
var_7 . add ( var_4 ) ;
var_6 . offer ( new ArrayList < > ( var_7 ) ) ;
var_7 . remove ( var_7 . size ( ) - 1 ) ;
}
}
return var_2 ;
}
| 2 | 0<SEP>1 |
502 | <awangdev>53. Maximum Subarray_7.java | private int findContinuousSum(int start, int left, int right, int offset, int[] nums) {
int continuousSum = 0, max = 0;
for (int i = start; i >= left && i <= right; i+=offset) {
continuousSum += nums[i];
max = Math.max(max, continuousSum);
}
return max;
} | private int sample_funcname ( int var_0 , int var_1 , int var_2 , int var_3 , int [ ] var_4 ) {
int var_5 = 0 , max = 0 ;
for ( int var_6 = var_0 ;
var_6 >= var_1 && var_6 <= var_2 ;
var_6 += var_3 ) {
var_5 += var_4 [ var_6 ] ;
max = Math . max ( max , var_5 ) ;
}
return max ;
}
| 1 | 0 |
503 | <awangdev>Longest Consecutive Sequence_3.java | public int longestConsecutive(int[] num) {
if (num == null || num.length == 0) {
return 0;
}
if (num.length == 1) {
return 1;
}
int count = 1;
int max = 1;
Arrays.sort(num);
for (int i = 1; i < num.length; i++) {
if (num[i - 1] == num[i]) {
continue;
} else if (num[i - 1] + 1 == num[i]) {
count++;
max = Math.max(count, max);
} else {
count = 1;
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
if ( var_0 . length == 1 ) {
return 1 ;
}
int var_1 = 1 ;
int max = 1 ;
Arrays . sort ( var_0 ) ;
for ( int var_2 = 1 ;
var_2 < var_0 . length ;
var_2 ++ ) {
if ( var_0 [ var_2 - 1 ] == var_0 [ var_2 ] ) {
continue ;
}
else if ( var_0 [ var_2 - 1 ] + 1 == var_0 [ var_2 ] ) {
var_1 ++ ;
max = Math . max ( var_1 , max ) ;
}
else {
var_1 = 1 ;
}
}
return max ;
}
| 2 | 0<SEP>1 |
504 | <awangdev>767. Reorganize String_1.java | public String reorganizeString(String S) {
if (S == null || S.length() == 0) return "";
Map<Character, Integer> map = new HashMap<>();
for (char c : S.toCharArray()) {
map.put(c, map.getOrDefault(c, 0) + 1);
}
PriorityQueue<Map.Entry<Character, Integer>> pq = new PriorityQueue<>((a, b) -> (b.getValue() - a.getValue()));
pq.addAll(map.entrySet());
StringBuilder sb = new StringBuilder();
Queue<Map.Entry<Character, Integer>> buffer = new LinkedList<>();
while (!pq.isEmpty()) {
Map.Entry<Character, Integer> entry = pq.poll();
sb.append(entry.getKey());
entry.setValue(entry.getValue() - 1);
buffer.offer(entry);
if (buffer.size() == 2) {
Map.Entry<Character, Integer> temp = buffer.poll();
if (temp.getValue() > 0) pq.offer(temp);
}
}
return sb.length() == S.length() ? sb.toString() : "";
} | public String var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) return "" ;
Map < Character , Integer > var_2 = new HashMap < > ( ) ;
for ( char var_3 : var_1 . toCharArray ( ) ) {
var_2 . put ( var_3 , var_2 . getOrDefault ( var_3 , 0 ) + 1 ) ;
}
PriorityQueue < Map . Entry < Character , Integer >> var_6 = new PriorityQueue < > ( ( var_5 , var_4 ) -> ( var_4 . getValue ( ) - var_5 . getValue ( ) ) ) ;
var_6 . addAll ( var_2 . entrySet ( ) ) ;
StringBuilder var_7 = new StringBuilder ( ) ;
Queue < Map . Entry < Character , Integer >> var_8 = new LinkedList < > ( ) ;
while ( ! var_6 . isEmpty ( ) ) {
Map . Entry < Character , Integer > var_9 = var_6 . poll ( ) ;
var_7 . append ( var_9 . getKey ( ) ) ;
var_9 . setValue ( var_9 . getValue ( ) - 1 ) ;
var_8 . offer ( var_9 ) ;
if ( var_8 . size ( ) == 2 ) {
Map . Entry < Character , Integer > var_10 = var_8 . poll ( ) ;
if ( var_10 . getValue ( ) > 0 ) var_6 . offer ( var_10 ) ;
}
}
return var_7 . length ( ) == var_1 . length ( ) ? var_7 . toString ( ) : "" ;
}
| 4 | 2<SEP>0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
505 | <awangdev>349. Intersection of Two Arrays_2.java | private boolean binarySearch(int[] nums, int target) {
int start = 0;
int end = nums.length - 1;
while(start <= end) {
int mid = (start + end) / 2;
if (nums[mid] < target) {
start = mid + 1;
} else if (nums[mid] > target) {
end = mid - 1;
} else {
return true;
}
}
return false;
} | private boolean var_0 ( int [ ] var_1 , int var_2 ) {
int var_3 = 0 ;
int var_4 = var_1 . length - 1 ;
while ( var_3 <= var_4 ) {
int var_5 = ( var_3 + var_4 ) / 2 ;
if ( var_1 [ var_5 ] < var_2 ) {
var_3 = var_5 + 1 ;
}
else if ( var_1 [ var_5 ] > var_2 ) {
var_4 = var_5 - 1 ;
}
else {
return true ;
}
}
return false ;
}
| 3 | 2<SEP>0<SEP>1 |
506 | <awangdev>680. Valid Palindrome II_2.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--)) {
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 -- ) ) {
continue ;
}
else if ( state ) {
return validate ( s , start - 1 , end , false ) || validate ( s , start , end + 1 , false ) ;
}
return false ;
}
return true ;
}
| 1 | 1 |
507 | <awangdev>605. Can Place Flowers_1.java | public boolean canPlaceFlowers(int[] flowerbed, int n) {
if (flowerbed.length == 0 || n <= 0) return true;
int m = flowerbed.length;
for (int i = 0; i < m; i++) {
if (flowerbed[i] == 1) continue;
int lastVal = i == 0 ? 0 : flowerbed[i-1];
int nextval = i == m-1? 0: flowerbed[i+1];
if (lastVal == 0 && nextval == 0) {
flowerbed[i] = 1;
n--;
}
if (n <= 0) return true;
}
return false;
} | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 . length == 0 || var_2 <= 0 ) return true ;
int var_3 = var_1 . length ;
for ( int var_4 = 0 ;
var_4 < var_3 ;
var_4 ++ ) {
if ( var_1 [ var_4 ] == 1 ) continue ;
int var_5 = var_4 == 0 ? 0 : var_1 [ var_4 - 1 ] ;
int var_6 = var_4 == var_3 - 1 ? 0 : var_1 [ var_4 + 1 ] ;
if ( var_5 == 0 && var_6 == 0 ) {
var_1 [ var_4 ] = 1 ;
var_2 -- ;
}
if ( var_2 <= 0 ) return true ;
}
return false ;
}
| 2 | 0<SEP>1 |
508 | <awangdev>493. Reverse Pairs_1.java | private int mergeSort(int[] nums, int start, int end) {
if (start >= end) return 0;
int mid = start + (end - start) / 2;
int count = mergeSort(nums, start, mid) + mergeSort(nums, mid + 1, end);
for (int i = start, j = mid + 1; i <= mid; i++) {
while (j <= end && nums[i] / 2.0 > nums[j]) j++;
count += j - (mid + 1);
}
Arrays.sort(nums, start, end + 1);
return count;
} | private int sample_funcname ( int [ ] nums , int start , int end ) {
if ( start >= end ) return 0 ;
int mid = start + ( end - start ) / 2 ;
int count = mergeSort ( nums , start , mid ) + mergeSort ( nums , mid + 1 , end ) ;
for ( int i = start , j = mid + 1 ;
i <= mid ;
i ++ ) {
while ( j <= end && nums [ i ] / 2.0 > nums [ j ] ) j ++ ;
count += j - ( mid + 1 ) ;
}
Arrays . sort ( nums , start , end + 1 ) ;
return count ;
}
| 4 | 2.0<SEP>0<SEP>1<SEP>2 |
509 | <awangdev>Missing Number_2.java | private void swap(int[] nums, int x, int y) {
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
| 0 | null |
510 | <awangdev>Trailing Zeros_1.java | public long trailingZeros(long n) {
if ( n < 5) {
return 0;
}
long count = 0;
for (long i = 5; n / i != 0; i *= 5) {
count += n / i;
}
return count;
} | public long sample_funcname ( long var_0 ) {
if ( var_0 < 5 ) {
return 0 ;
}
long var_1 = 0 ;
for ( long var_2 = 5 ;
var_0 / var_2 != 0 ;
var_2 *= 5 ) {
var_1 += var_0 / var_2 ;
}
return var_1 ;
}
| 2 | 0<SEP>5 |
511 | <awangdev>Russian Doll Envelopes_2.java | public int maxEnvelopes(int[][] envelopes) {
if (envelopes == null || envelopes.length == 0
|| envelopes[0] == null || envelopes[0].length == 0) {
return 0;
}
int n = 0, m = 0;
for (int[] envelope : envelopes) {
n = Math.max(n, envelope[0]);
m = Math.max(m, envelope[1]);
}
int[][] dp = new int[n + 1][m + 1];
for (int[] envelope : envelopes) {
dp[envelope[0]][envelope[1]] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int temp = dp[i][j] == 1 ? dp[i - 1][j - 1] + dp[i][j] : Math.max(dp[i - 1][j], dp[i][j - 1]);
dp[i][j] = Math.max(temp, dp[i][j]);
}
}
return dp[n][m];
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) {
return 0 ;
}
int var_1 = 0 , var_2 = 0 ;
for ( int [ ] var_3 : var_0 ) {
var_1 = Math . max ( var_1 , var_3 [ 0 ] ) ;
var_2 = Math . max ( var_2 , var_3 [ 1 ] ) ;
}
int [ ] [ ] var_4 = new int [ var_1 + 1 ] [ var_2 + 1 ] ;
for ( int [ ] var_3 : var_0 ) {
var_4 [ var_3 [ 0 ] ] [ var_3 [ 1 ] ] = 1 ;
}
for ( int var_5 = 1 ;
var_5 <= var_1 ;
var_5 ++ ) {
for ( int var_6 = 1 ;
var_6 <= var_2 ;
var_6 ++ ) {
int var_7 = var_4 [ var_5 ] [ var_6 ] == 1 ? var_4 [ var_5 - 1 ] [ var_6 - 1 ] + var_4 [ var_5 ] [ var_6 ] : Math . max ( var_4 [ var_5 - 1 ] [ var_6 ] , var_4 [ var_5 ] [ var_6 - 1 ] ) ;
var_4 [ var_5 ] [ var_6 ] = Math . max ( var_7 , var_4 [ var_5 ] [ var_6 ] ) ;
}
}
return var_4 [ var_1 ] [ var_2 ] ;
}
| 2 | 0<SEP>1 |
512 | <awangdev>977. Squares of a Sorted Array_1.java | public int findPos(int[] A) {
for (int i = 0; i < A.length; i++) {
if (A[i] >= 0) return i - 1;
}
return 0;
} | public int sample_funcname ( int [ ] var_0 ) {
for ( int var_1 = 0 ;
var_1 < var_0 . length ;
var_1 ++ ) {
if ( var_0 [ var_1 ] >= 0 ) return var_1 - 1 ;
}
return 0 ;
}
| 2 | 0<SEP>1 |
513 | <awangdev>1153. String Transforms Into Another String_1.java | public boolean canConvert(String str1, String str2) {
if (str1.equals(str2)) return true;
Map<Character, Character> map = new HashMap<>();
for (int i = 0; i < str1.length(); i++) {
char a = str1.charAt(i), b = str2.charAt(i);
map.putIfAbsent(a, b);
if (map.get(a) != b) return false;
}
return new HashSet<>(map.values()).size() < 26;
} | public boolean var_0 ( String var_1 , String var_2 ) {
if ( var_1 . equals ( var_2 ) ) return true ;
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 ) ;
var_3 . putIfAbsent ( var_5 , var_6 ) ;
if ( var_3 . get ( var_5 ) != var_6 ) return false ;
}
return new HashSet < > ( var_3 . values ( ) ) . size ( ) < 26 ;
}
| 2 | 0<SEP>26 |
514 | <awangdev>Sort Colors_2.java | private void swap(int[] nums, int x, int y){
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
| 0 | null |
515 | <awangdev>221. Maximal Square_2.java | public int maximalSquare(char[][] matrix) {
if (matrix == null || matrix.length == 0 || matrix[0] == null || matrix[0].length == 0) {
return 0;
}
int m = matrix.length;
int n = matrix[0].length;
int[][] dp = new int[m][n];
int maxLen = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = matrix[i][j] == '1' ? 1 : 0;
maxLen = Math.max(dp[i][j], maxLen);
}
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
if (matrix[i][j] == '1') {
dp[i][j] = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
maxLen = Math.max(dp[i][j], maxLen);
}
}
}
return maxLen * maxLen;
} | public int sample_funcname ( char [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) {
return 0 ;
}
int var_1 = var_0 . length ;
int var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 ] [ var_2 ] ;
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_1 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 < var_2 ;
var_6 ++ ) {
var_3 [ var_5 ] [ var_6 ] = var_0 [ var_5 ] [ var_6 ] == '1' ? 1 : 0 ;
var_4 = Math . max ( var_3 [ var_5 ] [ var_6 ] , var_4 ) ;
}
}
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 ] [ var_6 ] == '1' ) {
var_3 [ var_5 ] [ var_6 ] = Math . min ( Math . min ( var_3 [ var_5 - 1 ] [ var_6 ] , var_3 [ var_5 ] [ var_6 - 1 ] ) , var_3 [ var_5 - 1 ] [ var_6 - 1 ] ) + 1 ;
var_4 = Math . max ( var_3 [ var_5 ] [ var_6 ] , var_4 ) ;
}
}
}
return var_4 * var_4 ;
}
| 3 | 0<SEP><S_QUOTE>1<S_QUOTE><SEP>1 |