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
⌀ |
|---|---|---|---|---|---|
823 | <awangdev>387. First Unique Character in a String_2.java | public int firstUniqChar(String s) {
if (s == null || s.length() == 0) return -1;
for (int i = 0; i < s.length(); i++) {
if (s.indexOf(s.charAt(i)) == s.lastIndexOf(s.charAt(i))) {
return i;
}
}
return -1;
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) return - 1 ;
for ( int var_1 = 0 ;
var_1 < var_0 . length ( ) ;
var_1 ++ ) {
if ( var_0 . indexOf ( var_0 . charAt ( var_1 ) ) == var_0 . lastIndexOf ( var_0 . charAt ( var_1 ) ) ) {
return var_1 ;
}
}
return - 1 ;
}
| 2 | 0<SEP>1 |
824 | <awangdev>4Sum_1.java | private String buildKey(List<Integer> list) {
StringBuffer sb = new StringBuffer();
for (int num : list) sb.append(num + "@");
return sb.toString();
} | private String var_0 ( List < Integer > var_1 ) {
StringBuffer var_2 = new StringBuffer ( ) ;
for ( int var_3 : var_1 ) var_2 . append ( var_3 + "@" ) ;
return var_2 . toString ( ) ;
}
| 1 | <D_QUOTE>@<D_QUOTE> |
825 | <awangdev>68. Text Justification_1.java | private int getRowLength(List<String> list, int width) {
return width + (list.size() - 1);
} | private int sample_funcname ( List < String > var_0 , int var_1 ) {
return var_1 + ( var_0 . size ( ) - 1 ) ;
}
| 1 | 1 |
826 | <awangdev>Ones and Zeroes_1.java | public int findMaxForm(String[] strs, int m, int n) {
if (strs == null || strs.length == 0 || (m == 0 && n == 0)) {
return 0;
}
int len = strs.length;
int[][][] dp = new int[m + 1][n + 1][len + 1];
int[] ones = new int[len];
int[] zeros = new int[len];
for (int k = 0; k < len; k++) {
char[] ss = strs[k].toCharArray();
for (char c : ss) {
ones[k] += c == '1' ? 1 : 0;
zeros[k] += c == '0' ? 1 : 0;
}
}
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k <= len; k++) {
if (k == 0 || (i == 0 && j == 0)) {
dp[i][j][k] = 0;
continue;
}
dp[i][j][k] = dp[i][j][k - 1];
int countZero = zeros[k - 1];
int countOne = ones[k - 1];
if (i >= countZero && j >= countOne) {
dp[i][j][k] = Math.max(dp[i][j][k], dp[i - countZero][j - countOne][k - 1] + 1);
}
}
}
}
return dp[m][n][len];
} | public int sample_funcname ( String [ ] var_0 , int var_1 , int var_2 ) {
if ( var_0 == null || var_0 . length == 0 || ( var_1 == 0 && var_2 == 0 ) ) {
return 0 ;
}
int var_3 = var_0 . length ;
int [ ] [ ] [ ] var_4 = new int [ var_1 + 1 ] [ var_2 + 1 ] [ var_3 + 1 ] ;
int [ ] var_5 = new int [ var_3 ] ;
int [ ] var_6 = new int [ var_3 ] ;
for ( int var_7 = 0 ;
var_7 < var_3 ;
var_7 ++ ) {
char [ ] var_8 = var_0 [ var_7 ] . toCharArray ( ) ;
for ( char var_9 : var_8 ) {
var_5 [ var_7 ] += var_9 == '1' ? 1 : 0 ;
var_6 [ var_7 ] += var_9 == '0' ? 1 : 0 ;
}
}
for ( int var_10 = 0 ;
var_10 <= var_1 ;
var_10 ++ ) {
for ( int var_11 = 0 ;
var_11 <= var_2 ;
var_11 ++ ) {
for ( int var_7 = 0 ;
var_7 <= var_3 ;
var_7 ++ ) {
if ( var_7 == 0 || ( var_10 == 0 && var_11 == 0 ) ) {
var_4 [ var_10 ] [ var_11 ] [ var_7 ] = 0 ;
continue ;
}
var_4 [ var_10 ] [ var_11 ] [ var_7 ] = var_4 [ var_10 ] [ var_11 ] [ var_7 - 1 ] ;
int var_12 = var_6 [ var_7 - 1 ] ;
int var_13 = var_5 [ var_7 - 1 ] ;
if ( var_10 >= var_12 && var_11 >= var_13 ) {
var_4 [ var_10 ] [ var_11 ] [ var_7 ] = Math . max ( var_4 [ var_10 ] [ var_11 ] [ var_7 ] , var_4 [ var_10 - var_12 ] [ var_11 - var_13 ] [ var_7 - 1 ] + 1 ) ;
}
}
}
}
return var_4 [ var_1 ] [ var_2 ] [ var_3 ] ;
}
| 4 | 0<SEP><S_QUOTE>1<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP>1 |
827 | <awangdev>720. Longest Word in Dictionary_1.java | public String longestWord(String[] words) {
if (words == null || words.length == 0) {
return null;
}
String result = "";
Arrays.sort(words);
Set<String> set = new HashSet<>();
set.add(result);
for (String word : words) {
if (set.contains(word.substring(0, word.length() - 1))) {
if (word.length() > result.length()) {
result = word;
}
set.add(word);
}
}
return result;
} | public String var_0 ( String [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return null ;
}
String var_2 = "" ;
Arrays . sort ( var_1 ) ;
Set < String > var_3 = new HashSet < > ( ) ;
var_3 . add ( var_2 ) ;
for ( String var_4 : var_1 ) {
if ( var_3 . contains ( var_4 . substring ( 0 , var_4 . length ( ) - 1 ) ) ) {
if ( var_4 . length ( ) > var_2 . length ( ) ) {
var_2 = var_4 ;
}
var_3 . add ( var_4 ) ;
}
}
return var_2 ;
}
| 3 | 0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
828 | <awangdev>69. Sqrt(x)_3.java | public double mySqrt(double x) {
double start = 0;
double end = x;
double eps = 1e-12;
while (end - start > eps) {
double mid = start + (end - start) / 2;
if (mid * mid < x) {
start = mid;
} else {
end = mid;
}
}
if (end * end <= x) {
return end;
} else {
return start;
}
} | public double sample_funcname ( double var_0 ) {
double var_1 = 0 ;
double var_2 = var_0 ;
double var_3 = 1e-12 ;
while ( var_2 - var_1 > var_3 ) {
double var_4 = var_1 + ( var_2 - var_1 ) / 2 ;
if ( var_4 * var_4 < var_0 ) {
var_1 = var_4 ;
}
else {
var_2 = var_4 ;
}
}
if ( var_2 * var_2 <= var_0 ) {
return var_2 ;
}
else {
return var_1 ;
}
}
| 3 | 2<SEP>0<SEP>1e-12 |
829 | <awangdev>72. Edit Distance_4.java | public int minDistance(String word1, String word2) {
if (word1 == null && word2 == null) {
return 0;
}
char[] words1 = word1 == null ? new char[0] : word1.toCharArray();
char[] words2 = word2 == null ? new char[0] : word2.toCharArray();
int m = word1.length();
int n = word2.length();
int[][] dp = new int[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0) {
dp[i][j] = j;
continue;
}
if (j == 0) {
dp[i][j] = i;
continue;
}
dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1;
if (words1[i - 1] == words2[j - 1]) {
dp[i][j] = Math.min(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 ) {
return 0 ;
}
char [ ] var_2 = var_0 == null ? new char [ 0 ] : var_0 . toCharArray ( ) ;
char [ ] var_3 = var_1 == null ? new char [ 0 ] : var_1 . toCharArray ( ) ;
int var_4 = var_0 . length ( ) ;
int var_5 = var_1 . length ( ) ;
int [ ] [ ] var_6 = new int [ var_4 + 1 ] [ var_5 + 1 ] ;
for ( int var_7 = 0 ;
var_7 <= var_4 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 <= var_5 ;
var_8 ++ ) {
if ( var_7 == 0 ) {
var_6 [ var_7 ] [ var_8 ] = var_8 ;
continue ;
}
if ( var_8 == 0 ) {
var_6 [ var_7 ] [ var_8 ] = var_7 ;
continue ;
}
var_6 [ var_7 ] [ var_8 ] = Math . min ( var_6 [ var_7 - 1 ] [ var_8 - 1 ] , Math . min ( var_6 [ var_7 ] [ var_8 - 1 ] , var_6 [ var_7 - 1 ] [ var_8 ] ) ) + 1 ;
if ( var_2 [ var_7 - 1 ] == var_3 [ var_8 - 1 ] ) {
var_6 [ var_7 ] [ var_8 ] = Math . min ( var_6 [ var_7 ] [ var_8 ] , var_6 [ var_7 - 1 ] [ var_8 - 1 ] ) ;
}
}
}
return var_6 [ var_4 ] [ var_5 ] ;
}
| 2 | 0<SEP>1 |
830 | <awangdev>Sort Letters by Case_3.java | private void swap(char[] chars, int x, int y) {
char temp = chars[x];
chars[x] = chars[y];
chars[y] = temp;
} | private void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
char var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
| 0 | null |
831 | <awangdev>218. The Skyline Problem_3.java | int parent(int id) {
if (id == 0) {
return -1;
}
return (id - 1) / 2;
} | int sample_funcname ( int var_0 ) {
if ( var_0 == 0 ) {
return - 1 ;
}
return ( var_0 - 1 ) / 2 ;
}
| 3 | 2<SEP>0<SEP>1 |
832 | <awangdev>88. Search in Rotated Sorted Array II_1.java | public boolean search(int[] nums, int target) {
if (nums == null || nums.length == 0) return false;
int start = 0, end = nums.length - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
if (nums[mid] == target) return true;
if (nums[start] < nums[mid]) {
if (nums[start] <= target && target <= nums[mid]) end = mid;
else start = mid;
} else if (nums[start] > nums[mid]) {
if (nums[mid] <= target && target <= nums[end]) start = mid;
else end = mid;
} else start++;
}
return nums[start] == target || nums[end] == target;
} | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 ) return false ;
int var_3 = 0 , var_4 = var_1 . length - 1 ;
while ( var_3 + 1 < var_4 ) {
int var_5 = var_3 + ( var_4 - var_3 ) / 2 ;
if ( var_1 [ var_5 ] == var_2 ) return true ;
if ( var_1 [ var_3 ] < var_1 [ var_5 ] ) {
if ( var_1 [ var_3 ] <= var_2 && var_2 <= var_1 [ var_5 ] ) var_4 = var_5 ;
else var_3 = var_5 ;
}
else if ( var_1 [ var_3 ] > var_1 [ var_5 ] ) {
if ( var_1 [ var_5 ] <= var_2 && var_2 <= var_1 [ var_4 ] ) var_3 = var_5 ;
else var_4 = var_5 ;
}
else var_3 ++ ;
}
return var_1 [ var_3 ] == var_2 || var_1 [ var_4 ] == var_2 ;
}
| 3 | 2<SEP>0<SEP>1 |
833 | <awangdev>299. Bulls and Cows_1.java | public String getHint(String secret, String guess) {
if (secret == null || guess == null || secret.length() == 0 || guess.length() == 0) {
return "0A0B";
}
int[] nums = new int[10];
int bulls = 0, cows = 0;
for (int i = 0; i < secret.length(); i++) {
int s = Character.getNumericValue(secret.charAt(i));
int g = Character.getNumericValue(guess.charAt(i));
if (s == g) {
bulls++;
} else {
if (nums[s] < 0) cows++;
if (nums[g] > 0) cows++;
nums[s]++;
nums[g]--;
}
}
return String.format("%sA%sB", bulls, cows);
} | public String var_0 ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null || var_1 . length ( ) == 0 || var_2 . length ( ) == 0 ) {
return "0A0B" ;
}
int [ ] var_3 = new int [ 10 ] ;
int var_4 = 0 , var_5 = 0 ;
for ( int var_6 = 0 ;
var_6 < var_1 . length ( ) ;
var_6 ++ ) {
int var_7 = Character . getNumericValue ( var_1 . charAt ( var_6 ) ) ;
int var_8 = Character . getNumericValue ( var_2 . charAt ( var_6 ) ) ;
if ( var_7 == var_8 ) {
var_4 ++ ;
}
else {
if ( var_3 [ var_7 ] < 0 ) var_5 ++ ;
if ( var_3 [ var_8 ] > 0 ) var_5 ++ ;
var_3 [ var_7 ] ++ ;
var_3 [ var_8 ] -- ;
}
}
return String . format ( "%sA%sB" , var_4 , var_5 ) ;
}
| 4 | <D_QUOTE>0A0B<D_QUOTE><SEP>10<SEP>0<SEP><D_QUOTE>%sA%sB<D_QUOTE> |
834 | <awangdev>261. Graph Valid Tree_2.java | private boolean dfs(Map<Integer, Set<Integer>> graph, Set<Integer> visited, int curr, int pre) {
if (visited.contains(curr)) return false;
visited.add(curr);
for (int child : graph.get(curr)) {
if (child == pre) continue;
if (!dfs(graph, visited, child, curr)) return false;
}
return true;
} | private boolean sample_funcname ( Map < Integer , Set < Integer >> graph , Set < Integer > visited , int curr , int pre ) {
if ( visited . contains ( curr ) ) return false ;
visited . add ( curr ) ;
for ( int child : graph . get ( curr ) ) {
if ( child == pre ) continue ;
if ( ! dfs ( graph , visited , child , curr ) ) return false ;
}
return true ;
}
| 0 | null |
835 | <awangdev>741. Cherry Pickup_3.java | private void flipRow(int[] nums) {
int i = 0, j = nums.length - 1;
while (i != j) {
int temp = nums[j];
nums[j--] = nums[i];
nums[i++] = temp;
}
} | private void var_0 ( int [ ] var_1 ) {
int var_2 = 0 , var_3 = var_1 . length - 1 ;
while ( var_2 != var_3 ) {
int var_4 = var_1 [ var_3 ] ;
var_1 [ var_3 -- ] = var_1 [ var_2 ] ;
var_1 [ var_2 ++ ] = var_4 ;
}
}
| 2 | 0<SEP>1 |
836 | <awangdev>253. Meeting Rooms II_1.java | private int[] extract(int[][] intervals, int index) {
int[] array = new int[intervals.length];
for (int i = 0; i < intervals.length; i++) {
array[i] = intervals[i][index];
}
Arrays.sort(array);
return array;
} | private int [ ] sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
int [ ] var_2 = new int [ var_0 . length ] ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
var_2 [ var_3 ] = var_0 [ var_3 ] [ var_1 ] ;
}
Arrays . sort ( var_2 ) ;
return var_2 ;
}
| 1 | 0 |
837 | <awangdev>Number of Digit One_1.java | public int countDigitOne(int n) {
int count = 0;
for (long i = 1; i <= n; i *= 10) {
count += (n / i + 8) / 10 * i;
if (n / i % 10 == 1) {
count += n % i + 1;
}
}
return count;
} | public int sample_funcname ( int var_0 ) {
int var_1 = 0 ;
for ( long var_2 = 1 ;
var_2 <= var_0 ;
var_2 *= 10 ) {
var_1 += ( var_0 / var_2 + 8 ) / 10 * var_2 ;
if ( var_0 / var_2 % 10 == 1 ) {
var_1 += var_0 % var_2 + 1 ;
}
}
return var_1 ;
}
| 4 | 8<SEP>10<SEP>0<SEP>1 |
838 | <awangdev>Rehashing_1.java | public int hashcode(int key, int capacity) {
if (key < 0) {
return (key % capacity + capacity) % capacity;
} else {
return key % capacity;
}
} | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 < 0 ) {
return ( var_0 % var_1 + var_1 ) % var_1 ;
}
else {
return var_0 % var_1 ;
}
}
| 1 | 0 |
839 | <awangdev>[lint]. HashHeap_2.java | int lson(int id) {
return id * 2 + 1;
} | int sample_funcname ( int var_0 ) {
return var_0 * 2 + 1 ;
}
| 2 | 1<SEP>2 |
840 | <awangdev>122. Best Time to Buy and Sell Stock II_5.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length <= 1) {
return 0;
}
int[] buyOn = new int[prices.length];
int[] sellOn = new int[prices.length];
int length = prices.length;
buyOn[length - 1] = 0;
sellOn[length - 1] = prices[length - 1];
for (int i = length - 2; i >= 0; i--) {
buyOn[i] = Math.max(buyOn[i + 1], sellOn[i + 1] - prices[i]);
sellOn[i] = Math.max(sellOn[i + 1], buyOn[i + 1] + prices[i]);
}
return Math.max(0, buyOn[0]);
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) {
return 0 ;
}
int [ ] var_1 = new int [ var_0 . length ] ;
int [ ] var_2 = new int [ var_0 . length ] ;
int length = var_0 . length ;
var_1 [ length - 1 ] = 0 ;
var_2 [ length - 1 ] = var_0 [ length - 1 ] ;
for ( int var_3 = length - 2 ;
var_3 >= 0 ;
var_3 -- ) {
var_1 [ var_3 ] = Math . max ( var_1 [ var_3 + 1 ] , var_2 [ var_3 + 1 ] - var_0 [ var_3 ] ) ;
var_2 [ var_3 ] = Math . max ( var_2 [ var_3 + 1 ] , var_1 [ var_3 + 1 ] + var_0 [ var_3 ] ) ;
}
return Math . max ( 0 , var_1 [ 0 ] ) ;
}
| 3 | 1<SEP>0<SEP>2 |
841 | <awangdev>Flip Game II_2.java | public static boolean canWin(String s) {
if (s == null || s.length() <= 1) {
return false;
}
StringBuilder sb = new StringBuilder(s);
while (sb.indexOf("++") != -1) {
int index = sb.indexOf("++");
if(!canWin(s.substring(0, index) + "--" + s.substring(index + 2))) {
return true;
}
sb.replace(index, index + 1, "-");
}
return false;
} | public static boolean sample_funcname ( String s ) {
if ( s == null || s . length ( ) <= 1 ) {
return false ;
}
StringBuilder sb = new StringBuilder ( s ) ;
while ( sb . indexOf ( "++" ) != - 1 ) {
int index = sb . indexOf ( "++" ) ;
if ( ! canWin ( s . substring ( 0 , index ) + "--" + s . substring ( index + 2 ) ) ) {
return true ;
}
sb . replace ( index , index + 1 , "-" ) ;
}
return false ;
}
| 6 | <D_QUOTE>-<D_QUOTE><SEP><D_QUOTE>++<D_QUOTE><SEP>2<SEP>0<SEP>1<SEP><D_QUOTE>--<D_QUOTE> |
842 | <awangdev>416. Partition Equal Subset Sum_3.java | public boolean dfs(int[] nums, int index, int target) {
if (index == nums.length) return false;
if (target == nums[index]) return true;
if (target < nums[index]) return false;
return dfs(nums, index + 1, target - nums[index])
|| dfs(nums, index + 1, target);
} | public boolean sample_funcname ( int [ ] nums , int index , int target ) {
if ( index == nums . length ) return false ;
if ( target == nums [ index ] ) return true ;
if ( target < nums [ index ] ) return false ;
return dfs ( nums , index + 1 , target - nums [ index ] ) || dfs ( nums , index + 1 , target ) ;
}
| 1 | 1 |
843 | <awangdev>Triangle Count_2.java | public int triangleCount(int S[]) {
if (S == null || S.length == 0) {
return 0;
}
Arrays.sort(S);
int count = 0;
for (int i = 0; i < S.length; i++) {
int left = 0;
int right = i - 1;
while (left < right){
if (S[left] + S[right] > S[i]) {
count += (right - left);
right--;
} else {
left++;
}
}
}
return count;
} | public int sample_funcname ( int var_0 [ ] ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
Arrays . sort ( var_0 ) ;
int var_1 = 0 ;
for ( int var_2 = 0 ;
var_2 < var_0 . length ;
var_2 ++ ) {
int var_3 = 0 ;
int var_4 = var_2 - 1 ;
while ( var_3 < var_4 ) {
if ( var_0 [ var_3 ] + var_0 [ var_4 ] > var_0 [ var_2 ] ) {
var_1 += ( var_4 - var_3 ) ;
var_4 -- ;
}
else {
var_3 ++ ;
}
}
}
return var_1 ;
}
| 2 | 0<SEP>1 |
844 | <awangdev>41. First Missing Positive_1.java | public int firstMissingPositive(int[] nums) {
if (nums == null || nums.length == 0) {
return 1;
}
if (nums.length == 1) {
return nums[0] == 1 ? 2 : 1;
}
int n = nums.length;
int i = 0;
while (i < n) {
int val = nums[i];
if (val != i && val >= 0 && val < n && val != nums[val]) {
int temp = nums[val];
nums[val] = nums[i];
nums[i] = temp;
} else {
i++;
}
}
for (i = 1; i < n; i++) {
if (nums[i] != i) {
return i;
}
}
if (nums[0] == n) {
return n + 1;
}
return n;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 1 ;
}
if ( var_0 . length == 1 ) {
return var_0 [ 0 ] == 1 ? 2 : 1 ;
}
int var_1 = var_0 . length ;
int var_2 = 0 ;
while ( var_2 < var_1 ) {
int var_3 = var_0 [ var_2 ] ;
if ( var_3 != var_2 && var_3 >= 0 && var_3 < var_1 && var_3 != var_0 [ var_3 ] ) {
int var_4 = var_0 [ var_3 ] ;
var_0 [ var_3 ] = var_0 [ var_2 ] ;
var_0 [ var_2 ] = var_4 ;
}
else {
var_2 ++ ;
}
}
for ( var_2 = 1 ;
var_2 < var_1 ;
var_2 ++ ) {
if ( var_0 [ var_2 ] != var_2 ) {
return var_2 ;
}
}
if ( var_0 [ 0 ] == var_1 ) {
return var_1 + 1 ;
}
return var_1 ;
}
| 3 | 2<SEP>0<SEP>1 |
845 | <awangdev>Number of Longest Increasing Subsequence_2.java | public int findNumberOfLIS(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length, maxLen = 0, maxFreq = 0;
int[] len = new int[n + 1];
int[] count = new int[n + 1];
for (int i = 1; i <= n; i++) {
len[i] = 1;
count[i] = 1;
for (int j = 1; j < i; j++) {
if (nums[j - 1] < nums[i - 1]) {
if (len[i] == len[j] + 1) {
count[i] += count[j];
} else if (len[i] < len[j] + 1) {
len[i] = len[j] + 1;
count[i] = count[j];
}
}
}
if (maxLen == len[i]) {
maxFreq += count[i];
} else if (maxLen < len[i]) {
maxLen = len[i];
maxFreq = count[i];
}
}
return maxFreq;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_1 = var_0 . length , var_2 = 0 , var_3 = 0 ;
int [ ] var_4 = new int [ var_1 + 1 ] ;
int [ ] var_5 = new int [ var_1 + 1 ] ;
for ( int var_6 = 1 ;
var_6 <= var_1 ;
var_6 ++ ) {
var_4 [ var_6 ] = 1 ;
var_5 [ var_6 ] = 1 ;
for ( int var_7 = 1 ;
var_7 < var_6 ;
var_7 ++ ) {
if ( var_0 [ var_7 - 1 ] < var_0 [ var_6 - 1 ] ) {
if ( var_4 [ var_6 ] == var_4 [ var_7 ] + 1 ) {
var_5 [ var_6 ] += var_5 [ var_7 ] ;
}
else if ( var_4 [ var_6 ] < var_4 [ var_7 ] + 1 ) {
var_4 [ var_6 ] = var_4 [ var_7 ] + 1 ;
var_5 [ var_6 ] = var_5 [ var_7 ] ;
}
}
}
if ( var_2 == var_4 [ var_6 ] ) {
var_3 += var_5 [ var_6 ] ;
}
else if ( var_2 < var_4 [ var_6 ] ) {
var_2 = var_4 [ var_6 ] ;
var_3 = var_5 [ var_6 ] ;
}
}
return var_3 ;
}
| 2 | 0<SEP>1 |
846 | <awangdev>Subsets II_3.java | public void dfs(List<List<Integer>> rst, ArrayList<Integer> list, int index, int[] nums) {
rst.add(new ArrayList<Integer>(list));
for (int i = index; i < nums.length; i++) {
if (i != index && nums[i] == nums[i - 1]) {
continue;
}
list.add(nums[i]);
dfs(rst, list, i + 1, nums);
list.remove(list.size() - 1);
}
} | public void sample_funcname ( List < List < Integer >> rst , ArrayList < Integer > list , int index , int [ ] nums ) {
rst . add ( new ArrayList < Integer > ( list ) ) ;
for ( int i = index ;
i < nums . length ;
i ++ ) {
if ( i != index && nums [ i ] == nums [ i - 1 ] ) {
continue ;
}
list . add ( nums [ i ] ) ;
dfs ( rst , list , i + 1 , nums ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
| 1 | 1 |
847 | <awangdev>42. Trapping Rain Water_1.java | public int trap(int[] height) {
if (height == null || height.length == 0) return 0;
int n = height.length;
int[] maxLeft = new int[n], maxRight = new int[n];
maxLeft[0] = height[0];
maxRight[n - 1] = height[n - 1];
for (int i = 1; i < n; i++) maxLeft[i] = Math.max(maxLeft[i - 1], height[i]);
for (int i = n - 2; i >= 0; i--) maxRight[i] = Math.max(maxRight[i + 1], height[i]);
int total = 0;
for (int i = 0; i < n; i++) {
int waterDepth = Math.min(maxLeft[i], maxRight[i]);
total += height[i] < waterDepth ? waterDepth - height[i] : 0;
}
return total;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_1 = var_0 . length ;
int [ ] var_2 = new int [ var_1 ] , var_3 = new int [ var_1 ] ;
var_2 [ 0 ] = var_0 [ 0 ] ;
var_3 [ var_1 - 1 ] = var_0 [ var_1 - 1 ] ;
for ( int var_4 = 1 ;
var_4 < var_1 ;
var_4 ++ ) var_2 [ var_4 ] = Math . max ( var_2 [ var_4 - 1 ] , var_0 [ var_4 ] ) ;
for ( int var_4 = var_1 - 2 ;
var_4 >= 0 ;
var_4 -- ) var_3 [ var_4 ] = Math . max ( var_3 [ var_4 + 1 ] , var_0 [ var_4 ] ) ;
int var_5 = 0 ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
int var_6 = Math . min ( var_2 [ var_4 ] , var_3 [ var_4 ] ) ;
var_5 += var_0 [ var_4 ] < var_6 ? var_6 - var_0 [ var_4 ] : 0 ;
}
return var_5 ;
}
| 3 | 2<SEP>0<SEP>1 |
848 | <awangdev>Kth Smallest Element in a Sorted Matrix_1.java | private int countSmallerItem(int[][] matrix, int target) {
int n = matrix.length;
int count = 0;
int i = 0, j = n - 1;
while (i < n && j >= 0) {
if (matrix[i][j] > target) {
j--;
} else {
count += j + 1;
i++;
}
}
return count;
} | private int sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
int var_2 = var_0 . length ;
int var_3 = 0 ;
int var_4 = 0 , var_5 = var_2 - 1 ;
while ( var_4 < var_2 && var_5 >= 0 ) {
if ( var_0 [ var_4 ] [ var_5 ] > var_1 ) {
var_5 -- ;
}
else {
var_3 += var_5 + 1 ;
var_4 ++ ;
}
}
return var_3 ;
}
| 2 | 0<SEP>1 |
849 | <awangdev>219. Contains Duplicate II_2.java | public boolean containsNearbyDuplicate(int[] nums, int k) {
if (nums == null || nums.length == 0 || k <= 0) {
return false;
}
Map<Integer, List<Integer>> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
if (map.containsKey(nums[i])) {
for (int index : map.get(nums[i])) {
if (Math.abs(index - i) <= k) {
return true;
}
}
} else {
map.put(nums[i], new ArrayList<>());
}
map.get(nums[i]).add(i);
}
return false;
} | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 || var_2 <= 0 ) {
return false ;
}
Map < Integer , List < Integer >> var_3 = new HashMap < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ;
var_4 ++ ) {
if ( var_3 . containsKey ( var_1 [ var_4 ] ) ) {
for ( int var_5 : var_3 . get ( var_1 [ var_4 ] ) ) {
if ( Math . abs ( var_5 - var_4 ) <= var_2 ) {
return true ;
}
}
}
else {
var_3 . put ( var_1 [ var_4 ] , new ArrayList < > ( ) ) ;
}
var_3 . get ( var_1 [ var_4 ] ) . add ( var_4 ) ;
}
return false ;
}
| 1 | 0 |
850 | <awangdev>70. Climbing Stairs_2.java | public int climbStairs(int n) {
if (n <= 1) {
return 1;
}
int[] dp = new int[2];
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i % 2] = dp[(i - 1) % 2] + dp[(i - 2) % 2];
}
return dp[n % 2];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
int [ ] var_1 = new int [ 2 ] ;
var_1 [ 0 ] = 1 ;
var_1 [ 1 ] = 1 ;
for ( int var_2 = 2 ;
var_2 <= var_0 ;
var_2 ++ ) {
var_1 [ var_2 % 2 ] = var_1 [ ( var_2 - 1 ) % 2 ] + var_1 [ ( var_2 - 2 ) % 2 ] ;
}
return var_1 [ var_0 % 2 ] ;
}
| 3 | 1<SEP>0<SEP>2 |
851 | <awangdev>Subsets II_2.java | public List<List<Integer>> subsetsWithDup(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
if (nums == null || nums.length == 0) {
return result;
}
Arrays.sort(nums);
Queue<List<Integer>> queue = new LinkedList<>();
List<Integer> initialList = new ArrayList<>();
queue.offer(initialList);
while (!queue.isEmpty()) {
int size = queue.size();
while (size > 0) {
List<Integer> indexRow = queue.poll();
List<Integer> list = new ArrayList<>();
for (int index : indexRow) {
list.add(nums[index]);
}
result.add(list);
int endIndex = indexRow.size() == 0 ?
0 : indexRow.get(indexRow.size() - 1) + 1;
for (int i = endIndex; i < nums.length; i++) {
if (i > endIndex && nums[i] == nums[i - 1]) {
continue;
}
indexRow.add(i);
queue.offer(new ArrayList<>(indexRow));
indexRow.remove(indexRow.size() - 1);
}
size--;
}
}
return result;
} | 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 ;
}
Arrays . sort ( var_1 ) ;
Queue < List < Integer >> var_3 = new LinkedList < > ( ) ;
List < Integer > var_4 = new ArrayList < > ( ) ;
var_3 . offer ( var_4 ) ;
while ( ! var_3 . isEmpty ( ) ) {
int size = var_3 . size ( ) ;
while ( size > 0 ) {
List < Integer > var_5 = var_3 . poll ( ) ;
List < Integer > var_6 = new ArrayList < > ( ) ;
for ( int var_7 : var_5 ) {
var_6 . add ( var_1 [ var_7 ] ) ;
}
var_2 . add ( var_6 ) ;
int var_8 = var_5 . size ( ) == 0 ? 0 : var_5 . get ( var_5 . size ( ) - 1 ) + 1 ;
for ( int var_9 = var_8 ;
var_9 < var_1 . length ;
var_9 ++ ) {
if ( var_9 > var_8 && var_1 [ var_9 ] == var_1 [ var_9 - 1 ] ) {
continue ;
}
var_5 . add ( var_9 ) ;
var_3 . offer ( new ArrayList < > ( var_5 ) ) ;
var_5 . remove ( var_5 . size ( ) - 1 ) ;
}
size -- ;
}
}
return var_2 ;
}
| 2 | 0<SEP>1 |
852 | <awangdev>[lint]. Compare Strings_2.java | public boolean compareStrings(String A, String B) {
if (A == null || B == null || A.length() < B.length()) {
return false;
}
int[] countA = new int[26];
int[] countB = new int[26];
for (int i = 0; i < A.length(); i++) {
countA[A.charAt(i) - 'A']++;
}
for (int i = 0; i < B.length(); i++) {
countB[B.charAt(i) - 'A']++;
if (countB[B.charAt(i) - 'A'] > countA[B.charAt(i) - 'A']) {
return false;
}
}
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 ;
}
int [ ] var_3 = new int [ 26 ] ;
int [ ] var_4 = new int [ 26 ] ;
for ( int var_5 = 0 ;
var_5 < var_1 . length ( ) ;
var_5 ++ ) {
var_3 [ var_1 . charAt ( var_5 ) - 'A' ] ++ ;
}
for ( int var_5 = 0 ;
var_5 < var_2 . length ( ) ;
var_5 ++ ) {
var_4 [ var_2 . charAt ( var_5 ) - 'A' ] ++ ;
if ( var_4 [ var_2 . charAt ( var_5 ) - 'A' ] > var_3 [ var_2 . charAt ( var_5 ) - 'A' ] ) {
return false ;
}
}
return true ;
}
| 3 | 0<SEP>26<SEP><S_QUOTE>A<S_QUOTE> |
853 | <awangdev>416. Partition Equal Subset Sum_2.java | public boolean dfs(int[] nums, int index, int target) {
if (target < 0) return false;
if (target == 0) return true;
for (int i = index; i < nums.length; i++) {
if (dfs(nums, i + 1, target - nums[i])) return true;
}
return false;
} | public boolean sample_funcname ( int [ ] nums , int index , int target ) {
if ( target < 0 ) return false ;
if ( target == 0 ) return true ;
for ( int i = index ;
i < nums . length ;
i ++ ) {
if ( dfs ( nums , i + 1 , target - nums [ i ] ) ) return true ;
}
return false ;
}
| 2 | 0<SEP>1 |
854 | <awangdev>26.Remove Duplicates from Sorted Array_1.java | public int removeDuplicates(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int index = 0;
for (int i = 1; i < nums.length; i++) {
if (nums[i] != nums[index]) {
nums[++index] = nums[i];
}
}
return index + 1;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = 0 ;
for ( int var_2 = 1 ;
var_2 < var_0 . length ;
var_2 ++ ) {
if ( var_0 [ var_2 ] != var_0 [ var_1 ] ) {
var_0 [ ++ var_1 ] = var_0 [ var_2 ] ;
}
}
return var_1 + 1 ;
}
| 2 | 0<SEP>1 |
855 | <awangdev>Flip Game II_3.java | public boolean canWin(String s) {
if (s == null || s.length() <= 1) {
return false;
}
String str = new String(s);
for (int i = str.indexOf("++"); i >= 0 && i < str.length() - 1; i = str.indexOf("++")) {
if (!canWin( s.substring(0, i) + "--" + s.substring(i + 2))) {
return true;
}
str = str.substring(0, i) + "-" + str.substring(i + 1);
}
return false;
} | public boolean sample_funcname ( String s ) {
if ( s == null || s . length ( ) <= 1 ) {
return false ;
}
String str = new String ( s ) ;
for ( int i = str . indexOf ( "++" ) ;
i >= 0 && i < str . length ( ) - 1 ;
i = str . indexOf ( "++" ) ) {
if ( ! canWin ( s . substring ( 0 , i ) + "--" + s . substring ( i + 2 ) ) ) {
return true ;
}
str = str . substring ( 0 , i ) + "-" + str . substring ( i + 1 ) ;
}
return false ;
}
| 6 | <D_QUOTE>-<D_QUOTE><SEP><D_QUOTE>++<D_QUOTE><SEP>2<SEP>0<SEP>1<SEP><D_QUOTE>--<D_QUOTE> |
856 | <awangdev>340. Longest Substring with At Most K Distinct Characters_1.java | public int lengthOfLongestSubstringKDistinct(String s, int k) {
if (s == null) return 0;
int left = 0, right = 0, max = 0, n = s.length();
Map<Character, Integer> freq = new HashMap<>();
while (right < n) {
char head = s.charAt(right++);
freq.put(head, freq.getOrDefault(head, 0) + 1);
if (freq.size() <= k) max = Math.max(max, right - left);
if (freq.size() > k) {
char tail = s.charAt(left++);
freq.put(tail, freq.get(tail) - 1);
if (freq.get(tail) == 0) freq.remove(tail);
}
}
return max;
} | public int sample_funcname ( String var_0 , int var_1 ) {
if ( var_0 == null ) return 0 ;
int var_2 = 0 , var_3 = 0 , max = 0 , var_4 = var_0 . length ( ) ;
Map < Character , Integer > var_5 = new HashMap < > ( ) ;
while ( var_3 < var_4 ) {
char var_6 = var_0 . charAt ( var_3 ++ ) ;
var_5 . put ( var_6 , var_5 . getOrDefault ( var_6 , 0 ) + 1 ) ;
if ( var_5 . size ( ) <= var_1 ) max = Math . max ( max , var_3 - var_2 ) ;
if ( var_5 . size ( ) > var_1 ) {
char var_7 = var_0 . charAt ( var_2 ++ ) ;
var_5 . put ( var_7 , var_5 . get ( var_7 ) - 1 ) ;
if ( var_5 . get ( var_7 ) == 0 ) var_5 . remove ( var_7 ) ;
}
}
return max ;
}
| 2 | 0<SEP>1 |
857 | <awangdev>Fast Power_1.java | public int fastPower(int a, int b, int n) {
if (n == 0) {
return 1 % b;
}
if (n == 1) {
return a % b;
}
long recurPow = fastPower(a, b, n / 2);
recurPow = (recurPow * recurPow) % b;
if (n % 2 == 1) {
recurPow = recurPow * a % b;
}
return (int)recurPow;
} | public int sample_funcname ( int a , int b , int n ) {
if ( n == 0 ) {
return 1 % b ;
}
if ( n == 1 ) {
return a % b ;
}
long recurPow = fastPower ( a , b , n / 2 ) ;
recurPow = ( recurPow * recurPow ) % b ;
if ( n % 2 == 1 ) {
recurPow = recurPow * a % b ;
}
return ( int ) recurPow ;
}
| 3 | 2<SEP>0<SEP>1 |
858 | <awangdev>Target Sum_1.java | public int findTargetSumWays(int[] nums, int S) {
if (nums == null || nums.length == 0) return 0;
int sum = 0;
for (int num : nums) sum += num;
if (sum < Math.abs(S)) return 0;
int n = nums.length, m = (sum << 1) + 1;
int[][] dp = new int[n][m];
dp[0][sum - nums[0]] += 1;
dp[0][sum + nums[0]] += 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < m; j++) {
if (j - nums[i] >= 0) {
dp[i][j] += dp[i - 1][j - nums[i]];
}
if (j + nums[i] < m) {
dp[i][j] += dp[i - 1][j + nums[i]];
}
}
}
return dp[n - 1][S + sum];
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_2 = 0 ;
for ( int var_3 : var_0 ) var_2 += var_3 ;
if ( var_2 < Math . abs ( var_1 ) ) return 0 ;
int var_4 = var_0 . length , var_5 = ( var_2 << 1 ) + 1 ;
int [ ] [ ] var_6 = new int [ var_4 ] [ var_5 ] ;
var_6 [ 0 ] [ var_2 - var_0 [ 0 ] ] += 1 ;
var_6 [ 0 ] [ var_2 + var_0 [ 0 ] ] += 1 ;
for ( int var_7 = 1 ;
var_7 < var_4 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_5 ;
var_8 ++ ) {
if ( var_8 - var_0 [ var_7 ] >= 0 ) {
var_6 [ var_7 ] [ var_8 ] += var_6 [ var_7 - 1 ] [ var_8 - var_0 [ var_7 ] ] ;
}
if ( var_8 + var_0 [ var_7 ] < var_5 ) {
var_6 [ var_7 ] [ var_8 ] += var_6 [ var_7 - 1 ] [ var_8 + var_0 [ var_7 ] ] ;
}
}
}
return var_6 [ var_4 - 1 ] [ var_1 + var_2 ] ;
}
| 2 | 0<SEP>1 |
859 | <awangdev>122. Best Time to Buy and Sell Stock II_4.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int n = prices.length;
int[][] dp = new int[2][2];
dp[0][0] = dp[0][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]);
}
return dp[n % 2][1];
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = var_0 . length ;
int [ ] [ ] var_2 = new int [ 2 ] [ 2 ] ;
var_2 [ 0 ] [ 0 ] = var_2 [ 0 ] [ 1 ] = 0 ;
var_2 [ 1 ] [ 0 ] = - var_0 [ 0 ] ;
for ( int var_3 = 2 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 % 2 ] [ 0 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] [ 0 ] , var_2 [ ( var_3 - 1 ) % 2 ] [ 1 ] - var_0 [ var_3 - 1 ] ) ;
var_2 [ var_3 % 2 ] [ 1 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] [ 1 ] , var_2 [ ( var_3 - 1 ) % 2 ] [ 0 ] + var_0 [ var_3 - 1 ] ) ;
}
return var_2 [ var_1 % 2 ] [ 1 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
860 | <awangdev>[lint]. HashHeap_3.java | int rson(int id) {
return id * 2 + 2;
} | int sample_funcname ( int var_0 ) {
return var_0 * 2 + 2 ;
}
| 1 | 2 |
861 | <awangdev>218. The Skyline Problem_2.java | private boolean isInvalid(int[][] buildings) {
return buildings == null || buildings.length == 0 || buildings[0] == null || buildings[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 |
862 | <awangdev>261. Graph Valid Tree_3.java | private Map<Integer, Set<Integer>> buildGraph(int n, int[][] edges) {
Map<Integer, Set<Integer>> graph = new HashMap<>();
for (int i = 0; i < n; i++) graph.putIfAbsent(i, new HashSet<>());
for (int[] edge: edges) {
graph.get(edge[0]).add(edge[1]);
graph.get(edge[1]).add(edge[0]);
}
return graph;
} | private Map < Integer , Set < Integer >> var_0 ( int var_1 , int [ ] [ ] var_2 ) {
Map < Integer , Set < Integer >> var_3 = new HashMap < > ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) var_3 . putIfAbsent ( var_4 , new HashSet < > ( ) ) ;
for ( int [ ] var_5 : var_2 ) {
var_3 . get ( var_5 [ 0 ] ) . add ( var_5 [ 1 ] ) ;
var_3 . get ( var_5 [ 1 ] ) . add ( var_5 [ 0 ] ) ;
}
return var_3 ;
}
| 2 | 0<SEP>1 |
863 | <awangdev>741. Cherry Pickup_2.java | private void updateGrid(int[][] grid, List<int[]> path) {
for (int[] pos : path) {
grid[pos[0]][pos[1]] = 0;
}
} | private void var_0 ( int [ ] [ ] var_1 , List < int [ ] > var_2 ) {
for ( int [ ] var_3 : var_2 ) {
var_1 [ var_3 [ 0 ] ] [ var_3 [ 1 ] ] = 0 ;
}
}
| 2 | 0<SEP>1 |
864 | <awangdev>Update Bits_1.java | public int updateBits(int n, int m, int i, int j) {
int mask = -1;
mask = -1 >>> (32 - (j - i + 1));
mask = mask << i;
mask = ~mask;
n = n & mask;
return n | (m << i);
} | public int sample_funcname ( int var_0 , int var_1 , int var_2 , int var_3 ) {
int var_4 = - 1 ;
var_4 = - 1 >>> ( 32 - ( var_3 - var_2 + 1 ) ) ;
var_4 = var_4 << var_2 ;
var_4 = ~ var_4 ;
var_0 = var_0 & var_4 ;
return var_0 | ( var_1 << var_2 ) ;
}
| 2 | 1<SEP>32 |
865 | <awangdev>House Robber II_1.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
} else if (nums.length == 1) {
return nums[0];
}
int n = nums.length;
long[][] dp = new long[n + 1][2];
dp[0][0] = 0;
dp[1][0] = 0;
dp[1][1] = nums[0];
for (int i = 2; i < n; i++) {
dp[i][0] = Math.max(dp[i - 1][0], dp[i - 2][0] + nums[i - 1]);
dp[i][1] = Math.max(dp[i - 1][1], dp[i - 2][1] + nums[i - 1]);
}
dp[n][0] = Math.max(dp[n - 1][0], dp[n - 2][0] + nums[n - 1]);
dp[n][1] = dp[n - 1][1];
return (int) Math.max(dp[n][0], dp[n][1]);
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
else if ( var_0 . length == 1 ) {
return var_0 [ 0 ] ;
}
int var_1 = var_0 . length ;
long [ ] [ ] var_2 = new long [ var_1 + 1 ] [ 2 ] ;
var_2 [ 0 ] [ 0 ] = 0 ;
var_2 [ 1 ] [ 0 ] = 0 ;
var_2 [ 1 ] [ 1 ] = var_0 [ 0 ] ;
for ( int var_3 = 2 ;
var_3 < var_1 ;
var_3 ++ ) {
var_2 [ var_3 ] [ 0 ] = Math . max ( var_2 [ var_3 - 1 ] [ 0 ] , var_2 [ var_3 - 2 ] [ 0 ] + var_0 [ var_3 - 1 ] ) ;
var_2 [ var_3 ] [ 1 ] = Math . max ( var_2 [ var_3 - 1 ] [ 1 ] , var_2 [ var_3 - 2 ] [ 1 ] + var_0 [ var_3 - 1 ] ) ;
}
var_2 [ var_1 ] [ 0 ] = Math . max ( var_2 [ var_1 - 1 ] [ 0 ] , var_2 [ var_1 - 2 ] [ 0 ] + var_0 [ var_1 - 1 ] ) ;
var_2 [ var_1 ] [ 1 ] = var_2 [ var_1 - 1 ] [ 1 ] ;
return ( int ) Math . max ( var_2 [ var_1 ] [ 0 ] , var_2 [ var_1 ] [ 1 ] ) ;
}
| 3 | 2<SEP>0<SEP>1 |
866 | <awangdev>69. Sqrt(x)_2.java | public int mySqrt(int x) {
long start = 0;
long end = x;
while(start <= end) {
long mid = (start + end) / 2;
if (mid * mid < x) {
start = mid + 1;
} else if (mid * mid > x){
end = mid - 1;
} else {
return (int)mid;
}
}
return (int)end;
} | public int sample_funcname ( int var_0 ) {
long var_1 = 0 ;
long var_2 = var_0 ;
while ( var_1 <= var_2 ) {
long var_3 = ( var_1 + var_2 ) / 2 ;
if ( var_3 * var_3 < var_0 ) {
var_1 = var_3 + 1 ;
}
else if ( var_3 * var_3 > var_0 ) {
var_2 = var_3 - 1 ;
}
else {
return ( int ) var_3 ;
}
}
return ( int ) var_2 ;
}
| 3 | 0<SEP>1<SEP>2 |
867 | <awangdev>Predict the Winner_1.java | public boolean PredictTheWinner(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
int n = nums.length;
int[][] dp = new int[n][n];
for (int i = 0; i < n; i++) {
dp[i][i] = nums[i];
}
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
int j = len + i - 1;
dp[i][j] = Math.max(nums[i] - dp[i + 1][j], nums[j] - dp[i][j - 1]);
}
}
return dp[0][n - 1] >= 0;
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
int var_2 = var_1 . 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 ] = var_1 [ var_4 ] ;
}
for ( int var_5 = 2 ;
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_1 [ var_4 ] - var_3 [ var_4 + 1 ] [ var_6 ] , var_1 [ var_6 ] - var_3 [ var_4 ] [ var_6 - 1 ] ) ;
}
}
return var_3 [ 0 ] [ var_2 - 1 ] >= 0 ;
}
| 3 | 0<SEP>1<SEP>2 |
868 | <awangdev>78. Subsets_1.java | private void dfs(List<List<Integer>> result, List<Integer> list, int[] nums, int depth) {
if (depth >= nums.length) {
result.add(new ArrayList<>(list));
return;
}
list.add(nums[depth]);
dfs(result, list, nums, depth + 1);
list.remove(list.size() - 1);
dfs(result, list, nums, depth + 1);
} | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] nums , int depth ) {
if ( depth >= nums . length ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
list . add ( nums [ depth ] ) ;
dfs ( result , list , nums , depth + 1 ) ;
list . remove ( list . size ( ) - 1 ) ;
dfs ( result , list , nums , depth + 1 ) ;
}
| 1 | 1 |
869 | <awangdev>72. Edit Distance_5.java | public int minDistance(String word1, String word2) {
if (word1 == null && word2 == null) {
return 0;
}
char[] words1 = word1 == null ? new char[0] : word1.toCharArray();
char[] words2 = word2 == null ? new char[0] : word2.toCharArray();
int m = word1.length();
int n = word2.length();
int[][] dp = new int[2][n + 1];
int curr = 0;
int prev = 0;
for (int i = 0; i <= m; i++) {
prev = curr;
curr = 1 - prev;
for (int j = 0; j <= n; j++) {
if (i == 0) {
dp[curr][j] = j;
continue;
}
if (j == 0) {
dp[curr][j] = i;
continue;
}
dp[curr][j] = Math.min(dp[prev][j - 1], Math.min(dp[curr][j - 1], dp[prev][j])) + 1;
if (words1[i - 1] == words2[j - 1]) {
dp[curr][j] = Math.min(dp[curr][j], dp[prev][j - 1]);
}
}
}
return dp[curr][n];
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_0 == null && var_1 == null ) {
return 0 ;
}
char [ ] var_2 = var_0 == null ? new char [ 0 ] : var_0 . toCharArray ( ) ;
char [ ] var_3 = var_1 == null ? new char [ 0 ] : var_1 . toCharArray ( ) ;
int var_4 = var_0 . length ( ) ;
int var_5 = var_1 . length ( ) ;
int [ ] [ ] var_6 = new int [ 2 ] [ var_5 + 1 ] ;
int var_7 = 0 ;
int var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 <= var_4 ;
var_9 ++ ) {
var_8 = var_7 ;
var_7 = 1 - var_8 ;
for ( int var_10 = 0 ;
var_10 <= var_5 ;
var_10 ++ ) {
if ( var_9 == 0 ) {
var_6 [ var_7 ] [ var_10 ] = var_10 ;
continue ;
}
if ( var_10 == 0 ) {
var_6 [ var_7 ] [ var_10 ] = var_9 ;
continue ;
}
var_6 [ var_7 ] [ var_10 ] = Math . min ( var_6 [ var_8 ] [ var_10 - 1 ] , Math . min ( var_6 [ var_7 ] [ var_10 - 1 ] , var_6 [ var_8 ] [ var_10 ] ) ) + 1 ;
if ( var_2 [ var_9 - 1 ] == var_3 [ var_10 - 1 ] ) {
var_6 [ var_7 ] [ var_10 ] = Math . min ( var_6 [ var_7 ] [ var_10 ] , var_6 [ var_8 ] [ var_10 - 1 ] ) ;
}
}
}
return var_6 [ var_7 ] [ var_5 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
870 | <awangdev>Sort Letters by Case_2.java | private void swap(char[] chars, int x, int y) {
char temp = chars[x];
chars[x] = chars[y];
chars[y] = temp;
} | private void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
char var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
| 0 | null |
871 | <awangdev>387. First Unique Character in a String_3.java | public int firstUniqChar(String s) {
if (s == null || s.length() == 0) return -1;
Map<Character, Integer> map = new HashMap<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
map.putIfAbsent(c, 0);
map.put(c, map.get(c) + 1);
}
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (map.get(c) == 1) return i;
}
return -1;
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) return - 1 ;
Map < Character , Integer > var_1 = new HashMap < > ( ) ;
for ( int var_2 = 0 ;
var_2 < var_0 . length ( ) ;
var_2 ++ ) {
char var_3 = var_0 . charAt ( var_2 ) ;
var_1 . putIfAbsent ( var_3 , 0 ) ;
var_1 . put ( var_3 , var_1 . get ( var_3 ) + 1 ) ;
}
for ( int var_2 = 0 ;
var_2 < var_0 . length ( ) ;
var_2 ++ ) {
char var_3 = var_0 . charAt ( var_2 ) ;
if ( var_1 . get ( var_3 ) == 1 ) return var_2 ;
}
return - 1 ;
}
| 2 | 0<SEP>1 |
872 | <awangdev>1203. Sort Items by Groups Respecting Dependencies_1.java | private Map<Integer, List<Integer>> buildGroup(int n, int m, int[] group) {
Map<Integer, List<Integer>> map = new HashMap<>();
for (int i = 0; i < n; i++) {
int groupId = group[i] == -1 ? m++ : group[i];
group[i] = groupId;
map.putIfAbsent(groupId, new ArrayList<>());
map.get(groupId).add(i);
}
return map;
} | private Map < Integer , List < Integer >> var_0 ( int var_1 , int var_2 , int [ ] var_3 ) {
Map < Integer , List < Integer >> var_4 = new HashMap < > ( ) ;
for ( int var_5 = 0 ;
var_5 < var_1 ;
var_5 ++ ) {
int var_6 = var_3 [ var_5 ] == - 1 ? var_2 ++ : var_3 [ var_5 ] ;
var_3 [ var_5 ] = var_6 ;
var_4 . putIfAbsent ( var_6 , new ArrayList < > ( ) ) ;
var_4 . get ( var_6 ) . add ( var_5 ) ;
}
return var_4 ;
}
| 2 | 0<SEP>1 |
873 | <awangdev>7. Reverse Integer_1.java | public int reverse(int x) {
int result = 0;
while (x != 0) {
int tail = x % 10;
int newResult = result * 10 + tail;
if ((newResult - tail) / 10 != result) return 0;
result = newResult;
x = x / 10;
}
return result;
} | public int sample_funcname ( int var_0 ) {
int var_1 = 0 ;
while ( var_0 != 0 ) {
int var_2 = var_0 % 10 ;
int var_3 = var_1 * 10 + var_2 ;
if ( ( var_3 - var_2 ) / 10 != var_1 ) return 0 ;
var_1 = var_3 ;
var_0 = var_0 / 10 ;
}
return var_1 ;
}
| 2 | 10<SEP>0 |
874 | <awangdev>Interleaving Positive and Negative Numbers_3.java | public void rerange(int[] A) {
if (A == null || A.length == 0) {
return;
}
Arrays.sort(A);
int count = 0;
for (int num : A){
count += num >= 0 ? 1 : -1;
}
int start = 0;
int end = A.length - 1;
if (count < 0) {
start++;
} else if (count > 0){
end--;
}
while (start < end) {
if (A[start] < 0 && A[end] >= 0) {
int temp = A[start];
A[start] = A[end];
A[end] = temp;
}
start += 2;
end -= 2;
}
} | public void var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return ;
}
Arrays . sort ( var_1 ) ;
int var_2 = 0 ;
for ( int var_3 : var_1 ) {
var_2 += var_3 >= 0 ? 1 : - 1 ;
}
int var_4 = 0 ;
int var_5 = var_1 . length - 1 ;
if ( var_2 < 0 ) {
var_4 ++ ;
}
else if ( var_2 > 0 ) {
var_5 -- ;
}
while ( var_4 < var_5 ) {
if ( var_1 [ var_4 ] < 0 && var_1 [ var_5 ] >= 0 ) {
int var_6 = var_1 [ var_4 ] ;
var_1 [ var_4 ] = var_1 [ var_5 ] ;
var_1 [ var_5 ] = var_6 ;
}
var_4 += 2 ;
var_5 -= 2 ;
}
}
| 3 | 2<SEP>0<SEP>1 |
875 | <awangdev>149. Max Points on a Line_1.java | private int findGCD(int a, int b) {
if (b == 0) return a;
return findGCD(b, a % b);
} | private int sample_funcname ( int a , int b ) {
if ( b == 0 ) return a ;
return findGCD ( b , a % b ) ;
}
| 1 | 0 |
876 | <awangdev>Minimum Size Subarray Sum_3.java | public int minimumSize(int[] nums, int s) {
if (nums == null || nums.length == 0) {
return -1;
}
int start = 0;
int end = 0;
int min = Integer.MAX_VALUE;
int sum = 0;
for (; start < nums.length; start++) {
while(end < nums.length && sum < s) {
sum += nums[end];
end++;
}
if (sum >= s) {
min = Math.min(min, (end-1) - start + 1);
}
sum -= nums[start];
}
return min == Integer.MAX_VALUE ? -1 : min;
} | 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 = 0 ;
int min = Integer . MAX_VALUE ;
int var_4 = 0 ;
for ( ;
var_2 < var_0 . length ;
var_2 ++ ) {
while ( var_3 < var_0 . length && var_4 < var_1 ) {
var_4 += var_0 [ var_3 ] ;
var_3 ++ ;
}
if ( var_4 >= var_1 ) {
min = Math . min ( min , ( var_3 - 1 ) - var_2 + 1 ) ;
}
var_4 -= var_0 [ var_2 ] ;
}
return min == Integer . MAX_VALUE ? - 1 : min ;
}
| 2 | 0<SEP>1 |
877 | <awangdev>13. Roman to Integer_1.java | private int countCombo(final String pattern, String str) {
int count = 0;
while (str.contains(pattern)) {
count++;
str = str.substring(str.indexOf(pattern) + pattern.length());
}
return count;
} | private int sample_funcname ( final String var_0 , String var_1 ) {
int var_2 = 0 ;
while ( var_1 . contains ( var_0 ) ) {
var_2 ++ ;
var_1 = var_1 . substring ( var_1 . indexOf ( var_0 ) + var_0 . length ( ) ) ;
}
return var_2 ;
}
| 1 | 0 |
878 | <awangdev>1106. Parsing A Boolean Expression_1.java | private String findExpBlock(String s, int i) {
StringBuffer sb = new StringBuffer();
Stack<Character> stack = new Stack<>();
while (sb.length() == 0 || !stack.isEmpty()) {
char c = s.charAt(i++);
sb.append(c);
if (c == '(') stack.push(c);
if (c == ')') stack.pop();
if (stack.isEmpty()) break;
}
return sb.toString();
} | private String var_0 ( String var_1 , int var_2 ) {
StringBuffer var_3 = new StringBuffer ( ) ;
Stack < Character > var_4 = new Stack < > ( ) ;
while ( var_3 . length ( ) == 0 || ! var_4 . isEmpty ( ) ) {
char var_5 = var_1 . charAt ( var_2 ++ ) ;
var_3 . append ( var_5 ) ;
if ( var_5 == '(' ) var_4 . push ( var_5 ) ;
if ( var_5 == ')' ) var_4 . pop ( ) ;
if ( var_4 . isEmpty ( ) ) break ;
}
return var_3 . toString ( ) ;
}
| 3 | 0<SEP><S_QUOTE>)<S_QUOTE><SEP><S_QUOTE>(<S_QUOTE> |
879 | <awangdev>Search a 2D Matrix_2.java | public boolean searchMatrix(ArrayList<ArrayList<Integer>> matrix, int target) {
if(matrix.size() == 0) {
return false;
}
int rows = matrix.size();
int cols = matrix.get(0).size();
int start = 0;
int end = rows * cols - 1;
int mid;
while (start + 1 < end) {
mid = start + (end - start) / 2;
int midVal = matrix.get(mid / cols).get(mid % cols);
if (midVal == target) {
return true;
} else if (midVal < target) {
start = mid;
} else {
end = mid;
}
}
int startVal = matrix.get(start / cols).get(start % cols);
int endVal = matrix.get(end / cols).get(end % cols);
if (startVal == target || endVal == target) {
return true;
} else {
return false;
}
} | public boolean var_0 ( ArrayList < ArrayList < Integer >> var_1 , int var_2 ) {
if ( var_1 . size ( ) == 0 ) {
return false ;
}
int var_3 = var_1 . size ( ) ;
int var_4 = var_1 . get ( 0 ) . size ( ) ;
int var_5 = 0 ;
int var_6 = var_3 * var_4 - 1 ;
int var_7 ;
while ( var_5 + 1 < var_6 ) {
var_7 = var_5 + ( var_6 - var_5 ) / 2 ;
int var_8 = var_1 . get ( var_7 / var_4 ) . get ( var_7 % var_4 ) ;
if ( var_8 == var_2 ) {
return true ;
}
else if ( var_8 < var_2 ) {
var_5 = var_7 ;
}
else {
var_6 = var_7 ;
}
}
int var_9 = var_1 . get ( var_5 / var_4 ) . get ( var_5 % var_4 ) ;
int var_10 = var_1 . get ( var_6 / var_4 ) . get ( var_6 % var_4 ) ;
if ( var_9 == var_2 || var_10 == var_2 ) {
return true ;
}
else {
return false ;
}
}
| 3 | 2<SEP>0<SEP>1 |
880 | <awangdev>242. Valid Anagram_1.java | private int[] countChars(String s, String t) {
int[] count = new int[26];
for (int i = 0; i < s.length(); i++) {
count[s.charAt(i) - 'a'] += 1;
count[t.charAt(i) - 'a'] -= 1;
}
return count;
} | private int [ ] sample_funcname ( String var_0 , String var_1 ) {
int [ ] var_2 = new int [ 26 ] ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ( ) ;
var_3 ++ ) {
var_2 [ var_0 . charAt ( var_3 ) - 'a' ] += 1 ;
var_2 [ var_1 . charAt ( var_3 ) - 'a' ] -= 1 ;
}
return var_2 ;
}
| 4 | 0<SEP>26<SEP>1<SEP><S_QUOTE>a<S_QUOTE> |
882 | <awangdev>560. Subarray Sum Equals K_1.java | public int subarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) return 0;
Map<Integer, Integer> preSumCount = new HashMap<>();
int n = nums.length, sum = 0, count = 0;
preSumCount.put(0, 1);
for (int num : nums) {
sum += num;
int priorSum = sum - k;
if (preSumCount.containsKey(priorSum)) {
count += preSumCount.get(priorSum);
}
preSumCount.put(sum, preSumCount.getOrDefault(sum, 0) + 1);
}
return count;
} | 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 < > ( ) ;
int var_3 = var_0 . length , var_4 = 0 , var_5 = 0 ;
var_2 . put ( 0 , 1 ) ;
for ( int var_6 : var_0 ) {
var_4 += var_6 ;
int var_7 = var_4 - var_1 ;
if ( var_2 . containsKey ( var_7 ) ) {
var_5 += var_2 . get ( var_7 ) ;
}
var_2 . put ( var_4 , var_2 . getOrDefault ( var_4 , 0 ) + 1 ) ;
}
return var_5 ;
}
| 2 | 0<SEP>1 |
883 | <awangdev>Backpack II_4.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 j = 0; j <= m; j++) {
dp[0][j] = -1;
}
dp[0][0] = 0;
int curr = 0, prev;
for (int i = 1; i <= n; i++) {
prev = curr;
curr = 1 - prev;
for (int j = 1; j <= m; j++) {
dp[curr][j] = dp[prev][j];
if (j - A[i - 1] >= 0 && dp[prev][j - A[i - 1]] != -1) {
dp[curr][j] = Math.max(dp[curr][j], dp[prev][j - A[i - 1]] + V[i - 1]);
}
}
}
int rst = 0;
for (int j = 0; j <= m; j++) {
if (dp[curr][j] != -1) {
rst = Math.max(rst, dp[curr][j]);
}
}
return rst;
} | public int sample_funcname ( int var_0 , int [ ] var_1 , int var_2 [ ] ) {
if ( var_1 == null || var_2 == null || var_1 . length != var_2 . length ) {
return 0 ;
}
int var_3 = var_1 . length ;
int [ ] [ ] var_4 = new int [ 2 ] [ var_0 + 1 ] ;
for ( int var_5 = 0 ;
var_5 <= var_0 ;
var_5 ++ ) {
var_4 [ 0 ] [ var_5 ] = - 1 ;
}
var_4 [ 0 ] [ 0 ] = 0 ;
int var_6 = 0 , var_7 ;
for ( int var_8 = 1 ;
var_8 <= var_3 ;
var_8 ++ ) {
var_7 = var_6 ;
var_6 = 1 - var_7 ;
for ( int var_5 = 1 ;
var_5 <= var_0 ;
var_5 ++ ) {
var_4 [ var_6 ] [ var_5 ] = var_4 [ var_7 ] [ var_5 ] ;
if ( var_5 - var_1 [ var_8 - 1 ] >= 0 && var_4 [ var_7 ] [ var_5 - var_1 [ var_8 - 1 ] ] != - 1 ) {
var_4 [ var_6 ] [ var_5 ] = Math . max ( var_4 [ var_6 ] [ var_5 ] , var_4 [ var_7 ] [ var_5 - var_1 [ var_8 - 1 ] ] + var_2 [ var_8 - 1 ] ) ;
}
}
}
int var_9 = 0 ;
for ( int var_5 = 0 ;
var_5 <= var_0 ;
var_5 ++ ) {
if ( var_4 [ var_6 ] [ var_5 ] != - 1 ) {
var_9 = Math . max ( var_9 , var_4 [ var_6 ] [ var_5 ] ) ;
}
}
return var_9 ;
}
| 3 | 0<SEP>1<SEP>2 |
884 | <awangdev>Coins in a Line III_2.java | private void search(int i, int j, boolean[][] visited, int[][] dp, int[][] sum, int[] values) {
if (visited[i][j]) {
return;
}
visited[i][j] = true;
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, visited, dp, sum, values);
search(i, j - 1, visited, 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 , boolean [ ] [ ] visited , int [ ] [ ] dp , int [ ] [ ] sum , int [ ] values ) {
if ( visited [ i ] [ j ] ) {
return ;
}
visited [ i ] [ j ] = true ;
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 , visited , dp , sum , values ) ;
search ( i , j - 1 , visited , dp , sum , values ) ;
dp [ i ] [ j ] = sum [ i ] [ j ] - Math . min ( dp [ i + 1 ] [ j ] , dp [ i ] [ j - 1 ] ) ;
}
}
| 2 | 0<SEP>1 |
885 | <awangdev>287. Find the Duplicate Number_2.java | private boolean validate(int candidate, int[] nums) {
int count = 0;
for (int num: nums) {
count += num <= candidate ? 1 : 0;
}
return count <= candidate;
} | private boolean var_0 ( int var_1 , int [ ] var_2 ) {
int var_3 = 0 ;
for ( int var_4 : var_2 ) {
var_3 += var_4 <= var_1 ? 1 : 0 ;
}
return var_3 <= var_1 ;
}
| 2 | 0<SEP>1 |
886 | <awangdev>[lint]. Subarray Sum_1.java | public List<Integer> subarraySum(int[] nums) {
List<Integer> rst = new ArrayList<>();
if (nums == null || nums.length == 0) {
return rst;
}
int preSum = 0;
Map<Integer, Integer> map = new HashMap<>();
map.put(preSum, -1);
for (int i = 0; i < nums.length; i++) {
preSum += nums[i];
if (map.containsKey(preSum)) {
rst.add(map.get(preSum) + 1);
rst.add(i);
return rst;
}
map.put(preSum, i);
}
return rst;
} | public List < Integer > var_0 ( int [ ] var_1 ) {
List < Integer > var_2 = new ArrayList < > ( ) ;
if ( var_1 == null || var_1 . length == 0 ) {
return var_2 ;
}
int var_3 = 0 ;
Map < Integer , Integer > var_4 = new HashMap < > ( ) ;
var_4 . put ( var_3 , - 1 ) ;
for ( int var_5 = 0 ;
var_5 < var_1 . length ;
var_5 ++ ) {
var_3 += var_1 [ var_5 ] ;
if ( var_4 . containsKey ( var_3 ) ) {
var_2 . add ( var_4 . get ( var_3 ) + 1 ) ;
var_2 . add ( var_5 ) ;
return var_2 ;
}
var_4 . put ( var_3 , var_5 ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
887 | <awangdev>Wiggle Sort_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 |
888 | <awangdev>Redundant Connection_2.java | public int[] findRedundantConnection(int[][] edges) {
Map<Integer, Set<Integer>> graph = new HashMap<>();
for (int[] edge : edges) {
int x = edge[0], y = edge[1];
Set<Integer> visited = new HashSet<>();
Queue<Integer> queue = new LinkedList<>();
queue.offer(x);
while (!queue.isEmpty()) {
int node = queue.poll();
if (!graph.containsKey(node)) continue;
if (graph.get(node).contains(y)) return edge;
for (int num : graph.get(node)) {
if (visited.contains(num)) continue;
queue.offer(num);
visited.add(num);
}
}
graph.putIfAbsent(x, new HashSet<>());
graph.putIfAbsent(y, new HashSet<>());
graph.get(x).add(y);
graph.get(y).add(x);
}
return new int[] {-1, -1};
} | public int [ ] sample_funcname ( int [ ] [ ] var_0 ) {
Map < Integer , Set < Integer >> var_1 = new HashMap < > ( ) ;
for ( int [ ] var_2 : var_0 ) {
int var_3 = var_2 [ 0 ] , var_4 = var_2 [ 1 ] ;
Set < Integer > var_5 = new HashSet < > ( ) ;
Queue < Integer > var_6 = new LinkedList < > ( ) ;
var_6 . offer ( var_3 ) ;
while ( ! var_6 . isEmpty ( ) ) {
int var_7 = var_6 . poll ( ) ;
if ( ! var_1 . containsKey ( var_7 ) ) continue ;
if ( var_1 . get ( var_7 ) . contains ( var_4 ) ) return var_2 ;
for ( int var_8 : var_1 . get ( var_7 ) ) {
if ( var_5 . contains ( var_8 ) ) continue ;
var_6 . offer ( var_8 ) ;
var_5 . add ( var_8 ) ;
}
}
var_1 . putIfAbsent ( var_3 , new HashSet < > ( ) ) ;
var_1 . putIfAbsent ( var_4 , new HashSet < > ( ) ) ;
var_1 . get ( var_3 ) . add ( var_4 ) ;
var_1 . get ( var_4 ) . add ( var_3 ) ;
}
return new int [ ] {
- 1 , - 1 };
}
| 2 | 0<SEP>1 |
889 | <awangdev>39. Combination Sum_4.java | private boolean validate(int[] candidates, int target) {
return candidates == null || candidates.length == 0 || target <= 0;
} | private boolean var_0 ( int [ ] var_1 , int var_2 ) {
return var_1 == null || var_1 . length == 0 || var_2 <= 0 ;
}
| 1 | 0 |
890 | <awangdev>47. Permutations II_2.java | private void swap(List<Integer> list, int x, int y) {
int temp = list.get(x);
list.set(x, list.get(y));
list.set(y, temp);
} | private void var_0 ( List < 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 |
891 | <awangdev>523. Continuous Subarray Sum_3.java | public boolean checkSubarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) {
return false;
}
int n = nums.length;
for (int i = 0; i < n; i++) {
int sum = nums[i];
for (int j = i + 1; j < n; j++) {
sum += nums[j];
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 ;
for ( int var_4 = 0 ;
var_4 < var_3 ;
var_4 ++ ) {
int var_5 = var_1 [ var_4 ] ;
for ( int var_6 = var_4 + 1 ;
var_6 < var_3 ;
var_6 ++ ) {
var_5 += var_1 [ var_6 ] ;
if ( var_5 == var_2 || ( var_2 != 0 && var_5 % var_2 == 0 ) ) {
return true ;
}
}
}
return false ;
}
| 2 | 0<SEP>1 |
892 | <awangdev>14. Longest Common Prefix_2.java | public String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length == 0) {
return "";
}
if (strs.length == 1) {
return strs[0];
}
String prefix = "";
int ind = 0;
while (ind < strs[0].length()) {
char c = strs[0].charAt(ind);
boolean valid = false;
for (int i = 1; i < strs.length; i++) {
if (strs[i].length() > ind && strs[i].charAt(ind) == c) {
valid = true;
} else {
valid = false;
break;
}
}
if (valid) {
prefix += "" + c;
} else {
break;
}
ind++;
}
return prefix;
} | public String var_0 ( String [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return "" ;
}
if ( var_1 . length == 1 ) {
return var_1 [ 0 ] ;
}
String var_2 = "" ;
int var_3 = 0 ;
while ( var_3 < var_1 [ 0 ] . length ( ) ) {
char var_4 = var_1 [ 0 ] . charAt ( var_3 ) ;
boolean var_6 = false ;
for ( int var_5 = 1 ;
var_5 < var_1 . length ;
var_5 ++ ) {
if ( var_1 [ var_5 ] . length ( ) > var_3 && var_1 [ var_5 ] . charAt ( var_3 ) == var_4 ) {
var_6 = true ;
}
else {
var_6 = false ;
break ;
}
}
if ( var_6 ) {
var_2 += "" + var_4 ;
}
else {
break ;
}
var_3 ++ ;
}
return var_2 ;
}
| 3 | 0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
893 | <awangdev>46. Permutations_2.java | private void dfs(List<List<Integer>> result, List<Integer> list, int[] nums) {
if (list.size() == nums.length) {
result.add(new ArrayList<>(list));
return;
}
for (int i = 0; i < nums.length; i++) {
if (list.contains(nums[i])) continue;
list.add(nums[i]);
dfs(result, list, nums);
list.remove(list.size() - 1);
}
} | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] nums ) {
if ( list . size ( ) == nums . length ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
for ( int i = 0 ;
i < nums . length ;
i ++ ) {
if ( list . contains ( nums [ i ] ) ) continue ;
list . add ( nums [ i ] ) ;
dfs ( result , list , nums ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
| 2 | 0<SEP>1 |
894 | <awangdev>152. Maximum Product Subarray_4.java | int maxProduct(int nums[]) {
int max = nums[0];
for (int i = 1, imax = max, imin = max; i < nums.length; i++) {
if (nums[i] < 0) {
int temp = imax;
imax = imin;
imin = temp;
}
imax = Math.max(nums[i], imax * nums[i]);
imin = Math.min(nums[i], imin * nums[i]);
max = Math.max(max, imax);
}
return max;
} | int sample_funcname ( int var_0 [ ] ) {
int max = var_0 [ 0 ] ;
for ( int var_1 = 1 , var_2 = max , var_3 = max ;
var_1 < var_0 . length ;
var_1 ++ ) {
if ( var_0 [ var_1 ] < 0 ) {
int var_4 = var_2 ;
var_2 = var_3 ;
var_3 = var_4 ;
}
var_2 = Math . max ( var_0 [ var_1 ] , var_2 * var_0 [ var_1 ] ) ;
var_3 = Math . min ( var_0 [ var_1 ] , var_3 * var_0 [ var_1 ] ) ;
max = Math . max ( max , var_2 ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
895 | <awangdev>53. Maximum Subarray_3.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] = Math.max(dp[i - 1] + nums[i - 1], nums[i - 1]);
max = Math.max(max, dp[i]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_1 = var_0 . length , 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 ] = Math . max ( var_2 [ var_3 - 1 ] + var_0 [ var_3 - 1 ] , var_0 [ var_3 - 1 ] ) ;
max = Math . max ( max , var_2 [ var_3 ] ) ;
}
return max ;
}
| 2 | 0<SEP>1 |
896 | <awangdev>1306. Jump Game III_2.java | private boolean dfs(int[] arr, Set<Integer> visited, int index) {
if (arr[index] == 0) return true;
if (!visited.add(index)) return false;
if (visited.size() == arr.length) return false;
int left = index - arr[index], right = index + arr[index];
return (left >= 0 && dfs(arr, visited, left))
|| (right < arr.length && dfs(arr, visited, right));
} | private boolean sample_funcname ( int [ ] arr , Set < Integer > visited , int index ) {
if ( arr [ index ] == 0 ) return true ;
if ( ! visited . add ( index ) ) return false ;
if ( visited . size ( ) == arr . length ) return false ;
int left = index - arr [ index ] , right = index + arr [ index ] ;
return ( left >= 0 && dfs ( arr , visited , left ) ) || ( right < arr . length && dfs ( arr , visited , right ) ) ;
}
| 1 | 0 |
897 | <awangdev>Word Pattern_2.java | public boolean wordPattern(String pattern, String str) {
if (pattern != null && str != null && pattern.length() == 0 && str.length() == 0) {
return true;
}
if (pattern == null || pattern.length() == 0 || str == null || str.length() == 0) {
return false;
}
String[] strArr = str.split(" ");
if (pattern.length() != strArr.length) {
return false;
}
HashMap<Character, String> map = new HashMap<Character, String>();
HashMap<String, Character> mapStr = new HashMap<String, Character>();
for (int i = 0; i < strArr.length; i++){
if (!map.containsKey(pattern.charAt(i))) {
map.put(pattern.charAt(i), strArr[i]);
} else {
if (!map.get(pattern.charAt(i)).equals(strArr[i])) {
return false;
}
}
if (!mapStr.containsKey(strArr[i])) {
mapStr.put(strArr[i], pattern.charAt(i));
} else {
if (mapStr.get(strArr[i]) != pattern.charAt(i)) {
return false;
}
}
}
return true;
} | public boolean var_0 ( String var_1 , String var_2 ) {
if ( var_1 != null && var_2 != null && var_1 . length ( ) == 0 && var_2 . length ( ) == 0 ) {
return true ;
}
if ( var_1 == null || var_1 . length ( ) == 0 || var_2 == null || var_2 . length ( ) == 0 ) {
return false ;
}
String [ ] var_3 = var_2 . split ( " " ) ;
if ( var_1 . length ( ) != var_3 . length ) {
return false ;
}
HashMap < Character , String > var_4 = new HashMap < Character , String > ( ) ;
HashMap < String , Character > var_5 = new HashMap < String , Character > ( ) ;
for ( int var_6 = 0 ;
var_6 < var_3 . length ;
var_6 ++ ) {
if ( ! var_4 . containsKey ( var_1 . charAt ( var_6 ) ) ) {
var_4 . put ( var_1 . charAt ( var_6 ) , var_3 [ var_6 ] ) ;
}
else {
if ( ! var_4 . get ( var_1 . charAt ( var_6 ) ) . equals ( var_3 [ var_6 ] ) ) {
return false ;
}
}
if ( ! var_5 . containsKey ( var_3 [ var_6 ] ) ) {
var_5 . put ( var_3 [ var_6 ] , var_1 . charAt ( var_6 ) ) ;
}
else {
if ( var_5 . get ( var_3 [ var_6 ] ) != var_1 . charAt ( var_6 ) ) {
return false ;
}
}
}
return true ;
}
| 2 | 0<SEP><D_QUOTE> <D_QUOTE> |
898 | <awangdev>121. Best Time to Buy and Sell Stock_2.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length <= 1) return 0;
int profit = 0, min = prices[0];
for (int i = 1; i < prices.length; i++) {
if (prices[i] < min) min = prices[i];
else profit = Math.max(profit, prices[i] - min);
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) return 0 ;
int var_1 = 0 , var_2 = var_0 [ 0 ] ;
for ( int var_3 = 1 ;
var_3 < var_0 . length ;
var_3 ++ ) {
if ( var_0 [ var_3 ] < var_2 ) var_2 = var_0 [ var_3 ] ;
else var_1 = Math . max ( var_1 , var_0 [ var_3 ] - var_2 ) ;
}
return var_1 ;
}
| 2 | 1<SEP>0 |
899 | <awangdev>Jump Game II_1.java | public int jump(int[] nums) {
if (nums == null || nums.length <= 1) return 0;
int count = 0, farest = 0, maxRange = 0, n = nums.length;
for (int i = 0; i < n - 1; i++) {
maxRange = Math.max(maxRange, i + nums[i]);
if (i == farest) {
count++;
farest = maxRange;
}
}
return count;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) return 0 ;
int var_1 = 0 , var_2 = 0 , var_3 = 0 , var_4 = var_0 . length ;
for ( int var_5 = 0 ;
var_5 < var_4 - 1 ;
var_5 ++ ) {
var_3 = Math . max ( var_3 , var_5 + var_0 [ var_5 ] ) ;
if ( var_5 == var_2 ) {
var_1 ++ ;
var_2 = var_3 ;
}
}
return var_1 ;
}
| 2 | 1<SEP>0 |
900 | <awangdev>509. Fibonacci Number_1.java | public int fibonacci(int n) {
if (n <= 1) {
return 0;
}
int first = 0;
int second = 1;
for (int i = 2; i < n; i++) {
int temp = second;
second = first + second;
first = temp;
}
return second;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 0 ;
}
int var_1 = 0 ;
int var_2 = 1 ;
for ( int var_3 = 2 ;
var_3 < var_0 ;
var_3 ++ ) {
int var_4 = var_2 ;
var_2 = var_1 + var_2 ;
var_1 = var_4 ;
}
return var_2 ;
}
| 3 | 1<SEP>0<SEP>2 |
901 | <awangdev>Minimum Height Trees_1.java | public List<Integer> findMinHeightTrees(int n, int[][] edges) {
List<Integer> rst = new ArrayList<Integer>();
if (n == 1) {
rst.add(0);
return rst;
}else if (n == 0 || edges == null || edges.length == 0 || edges.length != n - 1) {
return rst;
}
boolean[] nodes = new boolean[n];
HashMap<Integer, ArrayList<Integer>> map = new HashMap<Integer, ArrayList<Integer>>();
for (int i = 0; i < n; i++) {
map.put(i, new ArrayList<Integer>());
nodes[i] = true;
}
for (int i = 0; i < edges.length; i++) {
if (!map.get(edges[i][0]).contains(edges[i][1])) {
map.get(edges[i][0]).add(edges[i][1]);
}
if (!map.get(edges[i][1]).contains(edges[i][0])) {
map.get(edges[i][1]).add(edges[i][0]);
}
}
Queue<Integer> queue = new LinkedList<Integer>();
while (n > 2) {
for (Map.Entry<Integer, ArrayList<Integer>> entry : map.entrySet()) {
if (entry.getValue().size() == 1) {
queue.offer(entry.getKey());
}
}
while (!queue.isEmpty()) {
n--;
Integer key = queue.poll();
nodes[key] = false;
int from = map.get(key).get(0);
map.get(from).remove(key);
map.get(key).remove(0);
}
}
for (int i = 0; i < nodes.length; i++) {
if (nodes[i]) {
rst.add(i);
}
}
return rst;
} | public List < Integer > var_0 ( int var_1 , int [ ] [ ] var_2 ) {
List < Integer > var_3 = new ArrayList < Integer > ( ) ;
if ( var_1 == 1 ) {
var_3 . add ( 0 ) ;
return var_3 ;
}
else if ( var_1 == 0 || var_2 == null || var_2 . length == 0 || var_2 . length != var_1 - 1 ) {
return var_3 ;
}
boolean [ ] var_4 = new boolean [ var_1 ] ;
HashMap < Integer , ArrayList < Integer >> var_5 = new HashMap < Integer , ArrayList < Integer >> ( ) ;
for ( int var_6 = 0 ;
var_6 < var_1 ;
var_6 ++ ) {
var_5 . put ( var_6 , new ArrayList < Integer > ( ) ) ;
var_4 [ var_6 ] = true ;
}
for ( int var_6 = 0 ;
var_6 < var_2 . length ;
var_6 ++ ) {
if ( ! var_5 . get ( var_2 [ var_6 ] [ 0 ] ) . contains ( var_2 [ var_6 ] [ 1 ] ) ) {
var_5 . get ( var_2 [ var_6 ] [ 0 ] ) . add ( var_2 [ var_6 ] [ 1 ] ) ;
}
if ( ! var_5 . get ( var_2 [ var_6 ] [ 1 ] ) . contains ( var_2 [ var_6 ] [ 0 ] ) ) {
var_5 . get ( var_2 [ var_6 ] [ 1 ] ) . add ( var_2 [ var_6 ] [ 0 ] ) ;
}
}
Queue < Integer > var_7 = new LinkedList < Integer > ( ) ;
while ( var_1 > 2 ) {
for ( Map . Entry < Integer , ArrayList < Integer >> var_8 : var_5 . entrySet ( ) ) {
if ( var_8 . getValue ( ) . size ( ) == 1 ) {
var_7 . offer ( var_8 . getKey ( ) ) ;
}
}
while ( ! var_7 . isEmpty ( ) ) {
var_1 -- ;
Integer var_9 = var_7 . poll ( ) ;
var_4 [ var_9 ] = false ;
int var_10 = var_5 . get ( var_9 ) . get ( 0 ) ;
var_5 . get ( var_10 ) . remove ( var_9 ) ;
var_5 . get ( var_9 ) . remove ( 0 ) ;
}
}
for ( int var_6 = 0 ;
var_6 < var_4 . length ;
var_6 ++ ) {
if ( var_4 [ var_6 ] ) {
var_3 . add ( var_6 ) ;
}
}
return var_3 ;
}
| 3 | 1<SEP>0<SEP>2 |
902 | <awangdev>40. Combination Sum II_1.java | private void dfs(List<List<Integer>> result, List<Integer> list,
int[] candidates, int index, int target) {
if (target == 0) {
result.add(new ArrayList<>(list));
return;
}
for (int i = index; i < candidates.length; i++) {
if (i > index && candidates[i] == candidates[i - 1]) continue;
int value = candidates[i];
list.add(value);
if (target - value >= 0) dfs(result, list, candidates, i + 1, target - value);
list.remove(list.size() - 1);
}
} | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] candidates , int index , int target ) {
if ( target == 0 ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
for ( int i = index ;
i < candidates . length ;
i ++ ) {
if ( i > index && candidates [ i ] == candidates [ i - 1 ] ) continue ;
int value = candidates [ i ] ;
list . add ( value ) ;
if ( target - value >= 0 ) dfs ( result , list , candidates , i + 1 , target - value ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
| 2 | 0<SEP>1 |
903 | <awangdev>One Edit Distance_1.java | private boolean compareStr(String s, String t, int x, int y) {
return s.substring(x).equals(t.substring(y));
} | private boolean var_0 ( String var_1 , String var_2 , int var_3 , int var_4 ) {
return var_1 . substring ( var_3 ) . equals ( var_2 . substring ( var_4 ) ) ;
}
| 0 | null |
904 | <awangdev>Max Sum of Rectangle No Larger Than K_2.java | public int maxSumSubmatrix(int[][] matrix, int k) {
if (matrix == null || matrix.length == 0 || matrix[0] == null || matrix[0].length == 0) {
return -1;
}
int m = matrix.length, n = matrix[0].length;
int max = Integer.MIN_VALUE;
for (int row = 0; row < m; row++) {
int[] preSum = new int[n];
for (int i = row; i < m; i++) {
TreeSet<Integer> areaSet = new TreeSet<>();
int newSum = 0;
for (int j = 0; j < n; j++) {
preSum[j] += matrix[i][j];
newSum += preSum[j];
if (newSum <= k) max = Math.max(max, newSum);
Integer extraArea = areaSet.ceiling(newSum - k);
if (extraArea != null) {
max = Math.max(max, newSum - extraArea);
}
areaSet.add(newSum);
}
}
}
return max == Integer.MIN_VALUE ? -1 : max;
} | public int sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) {
return - 1 ;
}
int var_2 = var_0 . length , var_3 = var_0 [ 0 ] . length ;
int max = Integer . MIN_VALUE ;
for ( int var_4 = 0 ;
var_4 < var_2 ;
var_4 ++ ) {
int [ ] var_5 = new int [ var_3 ] ;
for ( int var_6 = var_4 ;
var_6 < var_2 ;
var_6 ++ ) {
TreeSet < Integer > var_7 = new TreeSet < > ( ) ;
int var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_3 ;
var_9 ++ ) {
var_5 [ var_9 ] += var_0 [ var_6 ] [ var_9 ] ;
var_8 += var_5 [ var_9 ] ;
if ( var_8 <= var_1 ) max = Math . max ( max , var_8 ) ;
Integer var_10 = var_7 . ceiling ( var_8 - var_1 ) ;
if ( var_10 != null ) {
max = Math . max ( max , var_8 - var_10 ) ;
}
var_7 . add ( var_8 ) ;
}
}
}
return max == Integer . MIN_VALUE ? - 1 : max ;
}
| 2 | 0<SEP>1 |
905 | <awangdev>265. Paint House II_3.java | public int minCostII(int[][] costs) {
if (costs == null || costs.length == 0) {
return 0;
} else if (costs.length == 1 && costs[0].length == 1) {
return costs[0][0];
}
int minCost = Integer.MAX_VALUE;
int n = costs.length;
int k = costs[0].length;
int[][] dp = new int[n + 1][k];
for (int j = 0; j < k; j++) {
dp[0][j] = 0;
}
for (int i = 1; i <= n; i++) {
int minIndex = -1;
int minSecIndex = -1;
for (int j = 0; j < k; j++) {
if (minIndex == -1 || dp[i - 1][j] < dp[i - 1][minIndex]) {
minSecIndex = minIndex;
minIndex = j;
} else if (minSecIndex == -1 || dp[i - 1][j] < dp[i - 1][minSecIndex]) {
minSecIndex = j;
}
}
for (int j = 0; j < k; j++) {
if (j == minIndex) {
dp[i][j] = dp[i - 1][minSecIndex] + costs[i - 1][j];
} else {
dp[i][j] = dp[i - 1][minIndex] + costs[i - 1][j];
}
if (i == n) {
minCost = Math.min(minCost, dp[i][j]);
}
}
}
return minCost;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
else if ( var_0 . length == 1 && var_0 [ 0 ] . length == 1 ) {
return var_0 [ 0 ] [ 0 ] ;
}
int var_1 = Integer . MAX_VALUE ;
int var_2 = var_0 . length ;
int var_3 = var_0 [ 0 ] . length ;
int [ ] [ ] var_4 = new int [ var_2 + 1 ] [ var_3 ] ;
for ( int var_5 = 0 ;
var_5 < var_3 ;
var_5 ++ ) {
var_4 [ 0 ] [ var_5 ] = 0 ;
}
for ( int var_6 = 1 ;
var_6 <= var_2 ;
var_6 ++ ) {
int var_7 = - 1 ;
int var_8 = - 1 ;
for ( int var_5 = 0 ;
var_5 < var_3 ;
var_5 ++ ) {
if ( var_7 == - 1 || var_4 [ var_6 - 1 ] [ var_5 ] < var_4 [ var_6 - 1 ] [ var_7 ] ) {
var_8 = var_7 ;
var_7 = var_5 ;
}
else if ( var_8 == - 1 || var_4 [ var_6 - 1 ] [ var_5 ] < var_4 [ var_6 - 1 ] [ var_8 ] ) {
var_8 = var_5 ;
}
}
for ( int var_5 = 0 ;
var_5 < var_3 ;
var_5 ++ ) {
if ( var_5 == var_7 ) {
var_4 [ var_6 ] [ var_5 ] = var_4 [ var_6 - 1 ] [ var_8 ] + var_0 [ var_6 - 1 ] [ var_5 ] ;
}
else {
var_4 [ var_6 ] [ var_5 ] = var_4 [ var_6 - 1 ] [ var_7 ] + var_0 [ var_6 - 1 ] [ var_5 ] ;
}
if ( var_6 == var_2 ) {
var_1 = Math . min ( var_1 , var_4 [ var_6 ] [ var_5 ] ) ;
}
}
}
return var_1 ;
}
| 2 | 0<SEP>1 |
906 | <awangdev>Longest Valid Parentheses_3.java | public int longestValidParentheses(String s) {
if (s == null || s.length() == 0) return 0;
int n = s.length();
Stack<Integer> stack = new Stack<>();
char[] arr = s.toCharArray();
for (int i = 0; i < n; i++) {
if (arr[i] == ')' && !stack.isEmpty() && arr[stack.peek()] == '(') {
stack.pop();
continue;
}
stack.push(i);
}
int max = stack.isEmpty() ? n : 0;
int end = n, start = 0;
while (!stack.isEmpty()) {
start = stack.pop();
max = Math.max(max, end - start - 1);
end = start;
}
return Math.max(max, end);
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) return 0 ;
int var_1 = var_0 . length ( ) ;
Stack < Integer > var_2 = new Stack < > ( ) ;
char [ ] var_3 = var_0 . toCharArray ( ) ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
if ( var_3 [ var_4 ] == ')' && ! var_2 . isEmpty ( ) && var_3 [ var_2 . peek ( ) ] == '(' ) {
var_2 . pop ( ) ;
continue ;
}
var_2 . push ( var_4 ) ;
}
int max = var_2 . isEmpty ( ) ? var_1 : 0 ;
int var_5 = var_1 , var_6 = 0 ;
while ( ! var_2 . isEmpty ( ) ) {
var_6 = var_2 . pop ( ) ;
max = Math . max ( max , var_5 - var_6 - 1 ) ;
var_5 = var_6 ;
}
return Math . max ( max , var_5 ) ;
}
| 4 | 0<SEP><S_QUOTE>)<S_QUOTE><SEP><S_QUOTE>(<S_QUOTE><SEP>1 |
907 | <awangdev>62. Unique Path_2.java | public int uniquePaths(int m, int n) {
if (m == 0 || n == 0) return 0;
int[][] dp = new int[2][n];
for (int i = 0; i < 2; i++) dp[i][0] = 1;
for (int i = 0; i < n; i++) dp[0][i] = 1;
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[i%2][j] = dp[(i - 1)%2][j] + dp[i%2][j - 1];
}
}
return dp[(m-1)%2][n-1];
} | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 == 0 || var_1 == 0 ) return 0 ;
int [ ] [ ] var_2 = new int [ 2 ] [ var_1 ] ;
for ( int var_3 = 0 ;
var_3 < 2 ;
var_3 ++ ) var_2 [ var_3 ] [ 0 ] = 1 ;
for ( int var_3 = 0 ;
var_3 < var_1 ;
var_3 ++ ) var_2 [ 0 ] [ var_3 ] = 1 ;
for ( int var_3 = 1 ;
var_3 < var_0 ;
var_3 ++ ) {
for ( int var_4 = 1 ;
var_4 < var_1 ;
var_4 ++ ) {
var_2 [ var_3 % 2 ] [ var_4 ] = var_2 [ ( var_3 - 1 ) % 2 ] [ var_4 ] + var_2 [ var_3 % 2 ] [ var_4 - 1 ] ;
}
}
return var_2 [ ( var_0 - 1 ) % 2 ] [ var_1 - 1 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
908 | <awangdev>Longest Common Substring_4.java | public int longestCommonSubstring(String A, String B) {
if (A == null || B == null || A.length() == 0 || B.length() == 0) {
return 0;
}
int [][] D = new int[A.length() + 1][B.length() + 1];
int max = 0;
for (int i = 0; i <= A.length(); i++) {
for(int j = 0; j <= B.length(); j++) {
if (i == 0 || j == 0) {
D[i][j] = 0;
} else {
if (A.charAt(i - 1) == B.charAt(j - 1)) {
D[i][j] = D[i - 1][j - 1] + 1;
} else {
D[i][j] = 0;
}
max = Math.max(max, D[i][j]);
}
}
}
return max;
} | public int sample_funcname ( String var_0 , String var_1 ) {
if ( var_0 == null || var_1 == null || var_0 . length ( ) == 0 || var_1 . length ( ) == 0 ) {
return 0 ;
}
int [ ] [ ] var_2 = new int [ var_0 . length ( ) + 1 ] [ var_1 . length ( ) + 1 ] ;
int max = 0 ;
for ( int var_3 = 0 ;
var_3 <= var_0 . length ( ) ;
var_3 ++ ) {
for ( int var_4 = 0 ;
var_4 <= var_1 . length ( ) ;
var_4 ++ ) {
if ( var_3 == 0 || var_4 == 0 ) {
var_2 [ var_3 ] [ var_4 ] = 0 ;
}
else {
if ( var_0 . charAt ( var_3 - 1 ) == var_1 . charAt ( var_4 - 1 ) ) {
var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 - 1 ] [ var_4 - 1 ] + 1 ;
}
else {
var_2 [ var_3 ] [ var_4 ] = 0 ;
}
max = Math . max ( max , var_2 [ var_3 ] [ var_4 ] ) ;
}
}
}
return max ;
}
| 2 | 0<SEP>1 |
909 | <awangdev>Last Position of Target_1.java | public int lastPosition(int[] A, int target) {
if (A == null || A.length == 0) {
return -1;
}
int start = 0;
int end = A.length - 1;
int mid;
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 {
return mid;
}
} else if (A[mid] < target) {
start = mid;
} else {
end = mid;
}
}
if (A[end] == target) {
return end;
} else if (A[start] == target) {
return start;
}
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 ;
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 {
return var_4 ;
}
}
else if ( var_0 [ var_4 ] < var_1 ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
if ( var_0 [ var_3 ] == var_1 ) {
return var_3 ;
}
else if ( var_0 [ var_2 ] == var_1 ) {
return var_2 ;
}
return - 1 ;
}
| 3 | 2<SEP>0<SEP>1 |
910 | <awangdev>Pow(x, n)_2.java | public double pow(double x, int n) {
if (n == 0) {
return 1;
}
double num = pow(x, n/2);
if (n % 2 == 0) {
return num * num;
}
return num * num * x;
} | public double sample_funcname ( double x , int n ) {
if ( n == 0 ) {
return 1 ;
}
double num = pow ( x , n / 2 ) ;
if ( n % 2 == 0 ) {
return num * num ;
}
return num * num * x ;
}
| 3 | 2<SEP>0<SEP>1 |
911 | <awangdev>31. Next Permutation_2.java | private int findHigh(int[] nums, int low) {
int end = nums.length - 1;
while (end > low) {
if (nums[end] > nums[low]) return end;
end--;
}
return -1;
} | private int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_2 = var_0 . length - 1 ;
while ( var_2 > var_1 ) {
if ( var_0 [ var_2 ] > var_0 [ var_1 ] ) return var_2 ;
var_2 -- ;
}
return - 1 ;
}
| 1 | 1 |
912 | <awangdev>88. Merge Sorted Array_3.java | public void merge(int[] nums1, int m, int[] nums2, int n) {
if (nums1 == null || nums1.length == 0 || nums2 == null || nums2.length == 0) {
return;
}
int end = m + n - 1;
m--;
n--;
for (int i = end; i >= 0; i--) {
if (m >= 0 && n >= 0) {
nums1[i] = nums1[m] >= nums2[n] ? nums1[m--] : nums2[n--];
} else {
nums1[i] = m >= 0 ? nums1[m--] : nums2[n--];
}
}
} | public void var_0 ( int [ ] var_1 , int var_2 , int [ ] var_3 , int var_4 ) {
if ( var_1 == null || var_1 . length == 0 || var_3 == null || var_3 . length == 0 ) {
return ;
}
int var_5 = var_2 + var_4 - 1 ;
var_2 -- ;
var_4 -- ;
for ( int var_6 = var_5 ;
var_6 >= 0 ;
var_6 -- ) {
if ( var_2 >= 0 && var_4 >= 0 ) {
var_1 [ var_6 ] = var_1 [ var_2 ] >= var_3 [ var_4 ] ? var_1 [ var_2 -- ] : var_3 [ var_4 -- ] ;
}
else {
var_1 [ var_6 ] = var_2 >= 0 ? var_1 [ var_2 -- ] : var_3 [ var_4 -- ] ;
}
}
}
| 2 | 0<SEP>1 |
913 | <awangdev>Line Reflection_1.java | public boolean isReflected(int[][] points) {
if (points == null || points.length == 0 || points[0] == null || points[0].length == 0) return true;
Map<Integer, Set<Double>> map = new HashMap<>();
for (int[] point : points) {
map.putIfAbsent(point[1], new HashSet<>());
map.get(point[1]).add((double)point[0]);
}
List<Double> sampleRow = new ArrayList<>(map.get(points[0][1]));
Collections.sort(sampleRow);
double mid = (sampleRow.get(0) + sampleRow.get(sampleRow.size() - 1)) / 2;
for (Set<Double> row: map.values()) {
int left = 0, right = row.size() - 1;
List<Double> sortedRow = new ArrayList<>(row);
Collections.sort(sortedRow);
while (left <= right) {
if ((sortedRow.get(left) + sortedRow.get(right)) / 2 != mid) {
return false;
}
left++;
right--;
}
}
return true;
} | public boolean var_0 ( int [ ] [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ) return true ;
Map < Integer , Set < Double >> var_2 = new HashMap < > ( ) ;
for ( int [ ] var_3 : var_1 ) {
var_2 . putIfAbsent ( var_3 [ 1 ] , new HashSet < > ( ) ) ;
var_2 . get ( var_3 [ 1 ] ) . add ( ( double ) var_3 [ 0 ] ) ;
}
List < Double > var_4 = new ArrayList < > ( var_2 . get ( var_1 [ 0 ] [ 1 ] ) ) ;
Collections . sort ( var_4 ) ;
double var_5 = ( var_4 . get ( 0 ) + var_4 . get ( var_4 . size ( ) - 1 ) ) / 2 ;
for ( Set < Double > var_6 : var_2 . values ( ) ) {
int var_7 = 0 , var_8 = var_6 . size ( ) - 1 ;
List < Double > var_9 = new ArrayList < > ( var_6 ) ;
Collections . sort ( var_9 ) ;
while ( var_7 <= var_8 ) {
if ( ( var_9 . get ( var_7 ) + var_9 . get ( var_8 ) ) / 2 != var_5 ) {
return false ;
}
var_7 ++ ;
var_8 -- ;
}
}
return true ;
}
| 3 | 2<SEP>0<SEP>1 |
914 | <awangdev>Longest Increasing Continuous subsequence_2.java | public int dfs(int[] A, int[] dp, int[] flag, int i){
if (flag[i] == 1) {
return dp[i];
}
int ansLeft = 1;
int ansRight = 1;
flag[i] = -1;
if (i - 1 >= 0 && A[i - 1] < A[i] && flag[i - 1] != -1) {
ansLeft = dfs(A, dp, flag, i - 1) + 1;
}
if (i + 1 < A.length && A[i] > A[i + 1] && flag[i + 1] != -1) {
ansRight = dfs(A, dp, flag, i + 1) + 1;
}
flag[i] = 1;
dp[i] = Math.max(ansLeft, ansRight);
return dp[i];
} | public int sample_funcname ( int [ ] A , int [ ] dp , int [ ] flag , int i ) {
if ( flag [ i ] == 1 ) {
return dp [ i ] ;
}
int ansLeft = 1 ;
int ansRight = 1 ;
flag [ i ] = - 1 ;
if ( i - 1 >= 0 && A [ i - 1 ] < A [ i ] && flag [ i - 1 ] != - 1 ) {
ansLeft = dfs ( A , dp , flag , i - 1 ) + 1 ;
}
if ( i + 1 < A . length && A [ i ] > A [ i + 1 ] && flag [ i + 1 ] != - 1 ) {
ansRight = dfs ( A , dp , flag , i + 1 ) + 1 ;
}
flag [ i ] = 1 ;
dp [ i ] = Math . max ( ansLeft , ansRight ) ;
return dp [ i ] ;
}
| 2 | 1<SEP>0 |
915 | <awangdev>1048. Longest String Chain_1.java | public int longestStrChain(String[] words) {
int rst = 0;
Arrays.sort(words, Comparator.comparing(a -> a.length()));
HashMap<String, Integer> wordChainMap = new HashMap();
for (String word : words) {
if (wordChainMap.containsKey(word)) continue;
wordChainMap.put(word, 1);
for (int i = 0; i < word.length(); i++) {
StringBuilder sb = new StringBuilder(word);
sb.deleteCharAt(i);
String lastWord = sb.toString();
if (wordChainMap.containsKey(lastWord) && wordChainMap.get(lastWord) + 1 > wordChainMap.get(word)) {
wordChainMap.put(word, wordChainMap.get(lastWord) + 1);
}
}
if (wordChainMap.get(word) > rst) rst = wordChainMap.get(word);
}
return rst;
} | public int sample_funcname ( String [ ] var_0 ) {
int var_1 = 0 ;
Arrays . sort ( var_0 , Comparator . comparing ( var_2 -> var_2 . length ( ) ) ) ;
HashMap < String , Integer > var_3 = new HashMap ( ) ;
for ( String var_4 : var_0 ) {
if ( var_3 . containsKey ( var_4 ) ) continue ;
var_3 . put ( var_4 , 1 ) ;
for ( int var_5 = 0 ;
var_5 < var_4 . length ( ) ;
var_5 ++ ) {
StringBuilder var_6 = new StringBuilder ( var_4 ) ;
var_6 . deleteCharAt ( var_5 ) ;
String var_7 = var_6 . toString ( ) ;
if ( var_3 . containsKey ( var_7 ) && var_3 . get ( var_7 ) + 1 > var_3 . get ( var_4 ) ) {
var_3 . put ( var_4 , var_3 . get ( var_7 ) + 1 ) ;
}
}
if ( var_3 . get ( var_4 ) > var_1 ) var_1 = var_3 . get ( var_4 ) ;
}
return var_1 ;
}
| 2 | 0<SEP>1 |
916 | <awangdev>1007. Minimum Domino Rotations For Equal Row_1.java | public int minDominoRotations(int[] A, int[] B) {
int[] countA = new int[7], countB = new int[7], overlap = new int[7];
int n = A.length;
for (int i = 0; i < n; ++i) {
countA[A[i]]++;
countB[B[i]]++;
if (A[i] == B[i]) overlap[A[i]]++;
}
for (int i = 1; i < 7; ++i) {
if (countA[i] + countB[i] - overlap[i] == n) return n - Math.max(countA[i], countB[i]);
}
return -1;
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
int [ ] var_2 = new int [ 7 ] , var_3 = new int [ 7 ] , var_4 = new int [ 7 ] ;
int var_5 = var_0 . length ;
for ( int var_6 = 0 ;
var_6 < var_5 ;
++ var_6 ) {
var_2 [ var_0 [ var_6 ] ] ++ ;
var_3 [ var_1 [ var_6 ] ] ++ ;
if ( var_0 [ var_6 ] == var_1 [ var_6 ] ) var_4 [ var_0 [ var_6 ] ] ++ ;
}
for ( int var_6 = 1 ;
var_6 < 7 ;
++ var_6 ) {
if ( var_2 [ var_6 ] + var_3 [ var_6 ] - var_4 [ var_6 ] == var_5 ) return var_5 - Math . max ( var_2 [ var_6 ] , var_3 [ var_6 ] ) ;
}
return - 1 ;
}
| 3 | 7<SEP>0<SEP>1 |
917 | <awangdev>Interleaving String_1.java | public boolean isInterleave(String s1, String s2, String s3) {
if (s1 == null || s2 == null || s1.length() + s2.length() != s3.length()) {
return false;
}
int m = s1.length();
int n = s2.length();
boolean[][] dp = new boolean[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i == 0 && j == 0) {
dp[i][j] = true;
continue;
}
dp[i][j] = false;
if (i > 0 && s1.charAt(i - 1) == s3.charAt(i + j - 1)) {
dp[i][j] |= dp[i - 1][j];
}
if (j > 0 && s2.charAt(j - 1) == s3.charAt(i + j - 1)) {
dp[i][j] |= dp[i][j - 1];
}
}
}
return dp[m][n];
} | public boolean var_0 ( String var_1 , String var_2 , String var_3 ) {
if ( var_1 == null || var_2 == null || var_1 . length ( ) + var_2 . length ( ) != var_3 . length ( ) ) {
return false ;
}
int var_4 = var_1 . length ( ) ;
int var_5 = var_2 . length ( ) ;
boolean [ ] [ ] var_6 = new boolean [ var_4 + 1 ] [ var_5 + 1 ] ;
for ( int var_7 = 0 ;
var_7 <= var_4 ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 <= var_5 ;
var_8 ++ ) {
if ( var_7 == 0 && var_8 == 0 ) {
var_6 [ var_7 ] [ var_8 ] = true ;
continue ;
}
var_6 [ var_7 ] [ var_8 ] = false ;
if ( var_7 > 0 && var_1 . charAt ( var_7 - 1 ) == var_3 . charAt ( var_7 + var_8 - 1 ) ) {
var_6 [ var_7 ] [ var_8 ] |= var_6 [ var_7 - 1 ] [ var_8 ] ;
}
if ( var_8 > 0 && var_2 . charAt ( var_8 - 1 ) == var_3 . charAt ( var_7 + var_8 - 1 ) ) {
var_6 [ var_7 ] [ var_8 ] |= var_6 [ var_7 ] [ var_8 - 1 ] ;
}
}
}
return var_6 [ var_4 ] [ var_5 ] ;
}
| 2 | 1<SEP>0 |
918 | <awangdev>Decode String_1.java | private String popStack(Stack<Object> stack) {
StringBuffer sb = new StringBuffer();
while (!stack.isEmpty() && (stack.peek() instanceof String)) {
sb.insert(0, stack.pop());
}
return sb.toString();
} | private String var_0 ( Stack < Object > var_1 ) {
StringBuffer var_2 = new StringBuffer ( ) ;
while ( ! var_1 . isEmpty ( ) && ( var_1 . peek ( ) instanceof String ) ) {
var_2 . insert ( 0 , var_1 . pop ( ) ) ;
}
return var_2 . toString ( ) ;
}
| 1 | 0 |
919 | <awangdev>125. Valid Palindrome_2.java | public boolean isPalindrome(String s) {
if (s == null || s.length() <= 1) {
return true;
}
String str = s.replaceAll("[^a-zA-Z0-9]", "").toLowerCase();
int start = 0;
int end = str.length() - 1;
while (start < end) {
if (str.charAt(start) != str.charAt(end)) {
return false;
}
start++;
end--;
}
return true;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) <= 1 ) {
return true ;
}
String var_2 = var_1 . replaceAll ( "[^a-zA-Z0-9]" , "" ) . toLowerCase ( ) ;
int var_3 = 0 ;
int var_4 = var_2 . length ( ) - 1 ;
while ( var_3 < var_4 ) {
if ( var_2 . charAt ( var_3 ) != var_2 . charAt ( var_4 ) ) {
return false ;
}
var_3 ++ ;
var_4 -- ;
}
return true ;
}
| 4 | <D_QUOTE><D_QUOTE><SEP>1<SEP>0<SEP><D_QUOTE>[^a-zA-Z0-9]<D_QUOTE> |
920 | <awangdev>Find Peak Element II_2.java | private List<Integer> find(int x1, int x2, int y1, int y2, int[][] A) {
int midX = x1 + ((x2 - x1) >> 1);
int midY = y1 + ((y2 - y1) >> 1);
int x = midX, y = midY;
int max = A[x][y];
for (int j = y1; j <= y2; j++) {
if (A[midX][j] > max) {
max = A[midX][j];
x = midX;
y = j;
}
}
for (int i = x1; i <= x2; i++) {
if (A[i][midY] > max) {
max = A[i][midY];
y = midY;
x = i;
}
}
boolean isPeak = true;
if (A[x - 1][y] > A[x][y]) {
isPeak = false;
x -= 1;
} else if (A[x + 1][y] > A[x][y]) {
isPeak = false;
x += 1;
} else if (A[x][y - 1] > A[x][y]) {
isPeak = false;
y -= 1;
} else if (A[x][y + 1] > A[x][y]) {
isPeak = false;
y += 1;
}
if (isPeak) {
return new ArrayList<Integer>(Arrays.asList(x, y));
}
if (x >= x1 && x < midX && y >= y1 && y < midY) {
return find(x1, midX - 1, y1, midY - 1, A);
}
if (x >= x1 && x < midX && y > midY && y <= y2) {
return find(x1, midX - 1, midY + 1, y2, A);
}
if (x > midX && x <= x2 && y >= y1 && y < midY) {
return find(midX + 1, x2, y1, midY - 1, A);
}
if (x >= midX && x <= x2 && y > midY && y <= y2) {
return find(midX + 1, x2, midY + 1, y2, A);
}
return new ArrayList<>();
} | private List < Integer > sample_funcname ( int x1 , int x2 , int y1 , int y2 , int [ ] [ ] A ) {
int midX = x1 + ( ( x2 - x1 ) >> 1 ) ;
int midY = y1 + ( ( y2 - y1 ) >> 1 ) ;
int x = midX , y = midY ;
int max = A [ x ] [ y ] ;
for ( int j = y1 ;
j <= y2 ;
j ++ ) {
if ( A [ midX ] [ j ] > max ) {
max = A [ midX ] [ j ] ;
x = midX ;
y = j ;
}
}
for ( int i = x1 ;
i <= x2 ;
i ++ ) {
if ( A [ i ] [ midY ] > max ) {
max = A [ i ] [ midY ] ;
y = midY ;
x = i ;
}
}
boolean isPeak = true ;
if ( A [ x - 1 ] [ y ] > A [ x ] [ y ] ) {
isPeak = false ;
x -= 1 ;
}
else if ( A [ x + 1 ] [ y ] > A [ x ] [ y ] ) {
isPeak = false ;
x += 1 ;
}
else if ( A [ x ] [ y - 1 ] > A [ x ] [ y ] ) {
isPeak = false ;
y -= 1 ;
}
else if ( A [ x ] [ y + 1 ] > A [ x ] [ y ] ) {
isPeak = false ;
y += 1 ;
}
if ( isPeak ) {
return new ArrayList < Integer > ( Arrays . asList ( x , y ) ) ;
}
if ( x >= x1 && x < midX && y >= y1 && y < midY ) {
return find ( x1 , midX - 1 , y1 , midY - 1 , A ) ;
}
if ( x >= x1 && x < midX && y > midY && y <= y2 ) {
return find ( x1 , midX - 1 , midY + 1 , y2 , A ) ;
}
if ( x > midX && x <= x2 && y >= y1 && y < midY ) {
return find ( midX + 1 , x2 , y1 , midY - 1 , A ) ;
}
if ( x >= midX && x <= x2 && y > midY && y <= y2 ) {
return find ( midX + 1 , x2 , midY + 1 , y2 , A ) ;
}
return new ArrayList < > ( ) ;
}
| 1 | 1 |
921 | <awangdev>Ugly Number_2.java | public long kthPrimeNumber(int k) {
if (k == 0) {
return 0;
}
PriorityQueue<Long> queue = new PriorityQueue<Long>();
queue.offer((long)3);
queue.offer((long)5);
queue.offer((long)7);
long num = 0;
for (int i = 0; i < k; i++) {
num = queue.poll();
if (num % 3 == 0) {
queue.offer(num * 3);
} else if (num % 5 == 0) {
queue.offer(num * 3);
queue.offer(num * 5);
} else if (num % 7 == 0) {
queue.offer(num * 3);
queue.offer(num * 5);
queue.offer(num * 7);
}
}
return num;
} | public long sample_funcname ( int var_0 ) {
if ( var_0 == 0 ) {
return 0 ;
}
PriorityQueue < Long > var_1 = new PriorityQueue < Long > ( ) ;
var_1 . offer ( ( long ) 3 ) ;
var_1 . offer ( ( long ) 5 ) ;
var_1 . offer ( ( long ) 7 ) ;
long var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 ;
var_3 ++ ) {
var_2 = var_1 . poll ( ) ;
if ( var_2 % 3 == 0 ) {
var_1 . offer ( var_2 * 3 ) ;
}
else if ( var_2 % 5 == 0 ) {
var_1 . offer ( var_2 * 3 ) ;
var_1 . offer ( var_2 * 5 ) ;
}
else if ( var_2 % 7 == 0 ) {
var_1 . offer ( var_2 * 3 ) ;
var_1 . offer ( var_2 * 5 ) ;
var_1 . offer ( var_2 * 7 ) ;
}
}
return var_2 ;
}
| 4 | 7<SEP>0<SEP>3<SEP>5 |
922 | <awangdev>Encode and Decode Strings_4.java | public static List<String> decode(String s) {
List<String> rst = new ArrayList<String>();
if (s.equals("NULL")) {
return rst;
}
int index = s.indexOf("LINE");
while (index != -1) {
String str = s.substring(0, index);
StringBuffer sb = new StringBuffer();
int i = 0;
while (i + 3 <= str.length()) {
int letter = Integer.parseInt(str.substring(i, i + 3));
sb.append((char)letter);
i+=3;
}
rst.add(sb.toString());
s = s.substring(index + 4);
index = s.indexOf("LINE");
}
return rst;
} | public static List < String > var_0 ( String var_1 ) {
List < String > var_2 = new ArrayList < String > ( ) ;
if ( var_1 . equals ( "NULL" ) ) {
return var_2 ;
}
int var_3 = var_1 . indexOf ( "LINE" ) ;
while ( var_3 != - 1 ) {
String var_4 = var_1 . substring ( 0 , var_3 ) ;
StringBuffer var_5 = new StringBuffer ( ) ;
int var_6 = 0 ;
while ( var_6 + 3 <= var_4 . length ( ) ) {
int var_7 = Integer . parseInt ( var_4 . substring ( var_6 , var_6 + 3 ) ) ;
var_5 . append ( ( char ) var_7 ) ;
var_6 += 3 ;
}
var_2 . add ( var_5 . toString ( ) ) ;
var_1 = var_1 . substring ( var_3 + 4 ) ;
var_3 = var_1 . indexOf ( "LINE" ) ;
}
return var_2 ;
}
| 6 | <D_QUOTE>NULL<D_QUOTE><SEP>4<SEP><D_QUOTE>LINE<D_QUOTE><SEP>1<SEP>0<SEP>3 |
923 | <awangdev>Backpack III_1.java | public int backPackIII(int[] A, int[] V, int m) {
if (A == null || A.length == 0 || V == null || V.length == 0 || m <= 0) {
return 0;
}
int n = A.length;
int[][] dp = new int[n + 1][m + 1];
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
dp[i][j] = dp[i - 1][j];
for (int k = 1; k * A[i - 1] <= j; k++) {
dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - k * A[i - 1]] + k * V[i - 1]);
}
}
}
return dp[n][m];
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 == null || var_1 . length == 0 || var_2 <= 0 ) {
return 0 ;
}
int var_3 = var_0 . length ;
int [ ] [ ] var_4 = new int [ var_3 + 1 ] [ var_2 + 1 ] ;
var_4 [ 0 ] [ 0 ] = 0 ;
for ( int var_5 = 1 ;
var_5 <= var_3 ;
var_5 ++ ) {
for ( int var_6 = 1 ;
var_6 <= var_2 ;
var_6 ++ ) {
var_4 [ var_5 ] [ var_6 ] = var_4 [ var_5 - 1 ] [ var_6 ] ;
for ( int var_7 = 1 ;
var_7 * var_0 [ var_5 - 1 ] <= var_6 ;
var_7 ++ ) {
var_4 [ var_5 ] [ var_6 ] = Math . max ( var_4 [ var_5 ] [ var_6 ] , var_4 [ var_5 - 1 ] [ var_6 - var_7 * var_0 [ var_5 - 1 ] ] + var_7 * var_1 [ var_5 - 1 ] ) ;
}
}
}
return var_4 [ var_3 ] [ var_2 ] ;
}
| 2 | 0<SEP>1 |
Subsets and Splits