id
int64 0
1.17k
| comefrom
stringlengths 21
84
| code
stringlengths 50
1.89k
| masked
stringlengths 63
2.47k
|
|---|---|---|---|
700 | <awangdev>689. Maximum Sum of 3 Non-Overlapping Subarrays_2.java | private int[] calcRight(int[] nums, int[] presum, int k) {
int n = nums.length;
int[] right = new int[n];
right[n - k] = n - k;
for (int i = n - k - 1, total = presum[n] - presum[n - k]; i>= 0; i--) {
int sum = presum[i + k] - presum[i];
if (sum >= total) {
right[i] = i;
total = sum;
} else right[i] = right[i + 1];
}
return right;
} | private int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
int var_4 = var_0 . length ;
int [ ] var_5 = new int [ var_4 ] ;
var_5 [ var_4 - var_2 ] = var_4 - var_2 ;
for ( int var_7 = var_4 - var_2 - 1 , var_8 = var_1 [ var_4 ] - var_1 [ var_4 - var_2 ] ;
var_7 >= 0 ;
var_7 -- ) {
int var_10 = var_1 [ var_7 + var_2 ] - var_1 [ var_7 ] ;
if ( var_10 >= var_8 ) {
var_5 [ var_7 ] = var_7 ;
var_8 = var_10 ;
}
else var_5 [ var_7 ] = var_5 [ var_7 + 1 ] ;
}
return var_5 ;
}
|
701 | <awangdev>140. Word Break II_2.java | public void helper(List<String> result, List<String> list, boolean[][] isWord, boolean[] isValid, String s, int start) {
if (!isValid[start]) {
return;
}
if (start >= s.length()) {
StringBuffer sb = new StringBuffer();
for (String word : list) {
sb.append(word + " ");
}
result.add(sb.toString().trim());
return;
}
for (int i = start; i < s.length(); i++) {
if (!isWord[start][i]) {
continue;
}
list.add(s.substring(start, i + 1));
helper(result, list, isWord, isValid, s, i + 1);
list.remove(list.size() - 1);
}
} | public void sample_funcname ( List < String > result , List < String > list , boolean [ ] [ ] isWord , boolean [ ] isValid , String s , int start ) {
if ( ! isValid [ start ] ) {
return ;
}
if ( start >= s . length ( ) ) {
StringBuffer sb = new StringBuffer ( ) ;
for ( String word : list ) {
sb . append ( word + " " ) ;
}
result . add ( sb . toString ( ) . trim ( ) ) ;
return ;
}
for ( int i = start ;
i < s . length ( ) ;
i ++ ) {
if ( ! isWord [ start ] [ i ] ) {
continue ;
}
list . add ( s . substring ( start , i + 1 ) ) ;
helper ( result , list , isWord , isValid , s , i + 1 ) ;
list . remove ( list . size ( ) - 1 ) ;
}
}
|
702 | <awangdev>[lint]. Product of Array Exclude Itself_1.java | public ArrayList<Long> productExcludeItself(ArrayList<Integer> A) {
if (A == null || A.size() == 0) {
return null;
}
ArrayList<Long> rst = new ArrayList<Long>();
for (int i = 0; i < A.size(); i++) {
long num = 1;
for (int j = 0; j < A.size(); j++) {
if (j != i) {
num *= A.get(j);
}
}
rst.add(num);
}
return rst;
} | public ArrayList < Long > var_1 ( ArrayList < Integer > var_4 ) {
if ( var_4 == null || var_4 . size ( ) == 0 ) {
return null ;
}
ArrayList < Long > var_8 = new ArrayList < Long > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_4 . size ( ) ;
var_9 ++ ) {
long var_11 = 1 ;
for ( int var_12 = 0 ;
var_12 < var_4 . size ( ) ;
var_12 ++ ) {
if ( var_12 != var_9 ) {
var_11 *= var_4 . get ( var_12 ) ;
}
}
var_8 . add ( var_11 ) ;
}
return var_8 ;
}
|
703 | <awangdev>1040. Moving Stones Until Consecutive II_1.java | public int[] numMovesStonesII(int[] stones) {
Arrays.sort(stones);
int n = stones.length, left = 0, right = 0, min = n;
int max = Math.max(stones[n - 1] - stones[1] - n + 2, stones[n - 2] - stones[0] - n + 2);
while (right < n) {
while (stones[right] - stones[left] + 1 > n) left++;
int count = right - left + 1;
if (count == n - 1 && stones[right] - stones[left] + 1 == n - 1) {
min = Math.min(min, 2);
} else {
min = Math.min(min, n - count);
}
right++;
}
return new int[]{min, max};
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
Arrays . sort ( var_0 ) ;
int var_4 = var_0 . length , var_6 = 0 , var_7 = 0 , min = var_4 ;
int max = Math . max ( var_0 [ var_4 - 1 ] - var_0 [ 1 ] - var_4 + 2 , var_0 [ var_4 - 2 ] - var_0 [ 0 ] - var_4 + 2 ) ;
while ( var_7 < var_4 ) {
while ( var_0 [ var_7 ] - var_0 [ var_6 ] + 1 > var_4 ) var_6 ++ ;
int var_13 = var_7 - var_6 + 1 ;
if ( var_13 == var_4 - 1 && var_0 [ var_7 ] - var_0 [ var_6 ] + 1 == var_4 - 1 ) {
min = Math . min ( min , 2 ) ;
}
else {
min = Math . min ( min , var_4 - var_13 ) ;
}
var_7 ++ ;
}
return new int [ ] {
min , max };
}
|
704 | <awangdev>Subsets II_4.java | public ArrayList<ArrayList<Integer>> subsetsWithDup(ArrayList<Integer> S) {
ArrayList<ArrayList<Integer>> rst = new ArrayList<ArrayList<Integer>>();
if (S == null || S.size() == 0) {
return rst;
}
Collections.sort(S);
Queue<ArrayList<Integer>> queue = new LinkedList<ArrayList<Integer>>();
ArrayList<Integer> list = new ArrayList<Integer>();
queue.offer(new ArrayList<Integer>(list));
rst.add(new ArrayList<Integer>(list));
for (int i = 0; i < S.size(); i++) {
int num = S.get(i);
int size = queue.size();
while(size > 0) {
list = queue.poll();
list.add(num);
if (!rst.contains(list)) {
rst.add(new ArrayList<Integer>(list));
}
queue.offer(new ArrayList<Integer>(list));
list.remove(list.size() - 1);
queue.offer(new ArrayList<Integer>(list));
size--;
}
}
return rst;
} | public ArrayList < ArrayList < Integer >> var_2 ( ArrayList < Integer > var_3 ) {
ArrayList < ArrayList < Integer >> var_4 = new ArrayList < ArrayList < Integer >> ( ) ;
if ( var_3 == null || var_3 . size ( ) == 0 ) {
return var_4 ;
}
Collections . sort ( var_3 ) ;
Queue < ArrayList < Integer >> var_12 = new LinkedList < ArrayList < Integer >> ( ) ;
ArrayList < Integer > var_13 = new ArrayList < Integer > ( ) ;
var_12 . offer ( new ArrayList < Integer > ( var_13 ) ) ;
var_4 . add ( new ArrayList < Integer > ( var_13 ) ) ;
for ( int var_16 = 0 ;
var_16 < var_3 . size ( ) ;
var_16 ++ ) {
int var_18 = var_3 . get ( var_16 ) ;
int size = var_12 . size ( ) ;
while ( size > 0 ) {
var_13 = var_12 . poll ( ) ;
var_13 . add ( var_18 ) ;
if ( ! var_4 . contains ( var_13 ) ) {
var_4 . add ( new ArrayList < Integer > ( var_13 ) ) ;
}
var_12 . offer ( new ArrayList < Integer > ( var_13 ) ) ;
var_13 . remove ( var_13 . size ( ) - 1 ) ;
var_12 . offer ( new ArrayList < Integer > ( var_13 ) ) ;
size -- ;
}
}
return var_4 ;
}
|
705 | <awangdev>[tool]. Hash Function_1.java | public int hashCode(char[] key, int HASH_SIZE) {
if (key.length == 0) {
return 0;
}
long hashRst = 0;
for (int i = 0; i < key.length ; i++) {
hashRst = hashRst * 33 + (int)(key[i]);
hashRst = hashRst % HASH_SIZE;
}
return (int)hashRst;
} | public int sample_funcname ( char [ ] var_0 , int var_1 ) {
if ( var_0 . length == 0 ) {
return 0 ;
}
long var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
var_4 = var_4 * 33 + ( int ) ( var_0 [ var_5 ] ) ;
var_4 = var_4 % var_1 ;
}
return ( int ) var_4 ;
}
|
706 | <awangdev>The Maze III_1.java | private boolean isEnd(int[] hole, int x, int y) {
return x == hole[0] && y == hole[1];
} | private boolean var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
return var_2 == var_1 [ 0 ] && var_3 == var_1 [ 1 ] ;
}
|
707 | <awangdev>438. Find All Anagrams in a String_1.java | public List<Integer> findAnagrams(String s, String p) {
List<Integer> rst = new ArrayList<>();
if (s == null || s.length() == 0 || s.length() < p.length()) return rst;
int n = s.length(), m = p.length();
int[] hash = new int[256];
for (char c : p.toCharArray()) hash[c]++;
int left = 0, right = 0;
int count = m;
while (right < n) {
char c = s.charAt(right++);
if (hash[c] > 0) count--;
hash[c]--;
if (count == 0) rst.add(left);
if (right - left == m) {
c = s.charAt(left++);
if (hash[c] >= 0) count++;
hash[c]++;
}
}
return rst;
} | public List < Integer > var_1 ( String var_3 , String var_4 ) {
List < Integer > var_7 = new ArrayList < > ( ) ;
if ( var_3 == null || var_3 . length ( ) == 0 || var_3 . length ( ) < var_4 . length ( ) ) return var_7 ;
int var_11 = var_3 . length ( ) , var_12 = var_4 . length ( ) ;
int [ ] var_14 = new int [ 256 ] ;
for ( char var_16 : var_4 . toCharArray ( ) ) var_14 [ var_16 ] ++ ;
int var_17 = 0 , var_18 = 0 ;
int var_19 = var_12 ;
while ( var_18 < var_11 ) {
char var_16 = var_3 . charAt ( var_18 ++ ) ;
if ( var_14 [ var_16 ] > 0 ) var_19 -- ;
var_14 [ var_16 ] -- ;
if ( var_19 == 0 ) var_7 . add ( var_17 ) ;
if ( var_18 - var_17 == var_12 ) {
var_16 = var_3 . charAt ( var_17 ++ ) ;
if ( var_14 [ var_16 ] >= 0 ) var_19 ++ ;
var_14 [ var_16 ] ++ ;
}
}
return var_7 ;
}
|
708 | <awangdev>Flip Game II_5.java | public static boolean checkP1Win(String str, int x, boolean isP1) {
String s = str.substring(0,x) + "--" + str.substring(x + 2);
if (s.indexOf("++") == -1) {
return isP1;
}
if (isP1) {
String temp = s;
for (int i = temp.indexOf("++"); i >= 0 && i < temp.length() - 1; i = temp.indexOf("++")) {
if (checkP1Win(s, i, !isP1)) {
return true;
}
temp = temp.substring(0, i) + "-" + temp.substring(i + 1);
}
return false;
} else {
String temp = s;
for (int i = temp.indexOf("++"); i >= 0 && i < temp.length() - 1; i = temp.indexOf("++")) {
if (!checkP1Win(s, i, !isP1)) {
return false;
}
temp = temp.substring(0, i) + "-" + temp.substring(i + 1);
}
return true;
}
} | public static boolean sample_funcname ( String str , int x , boolean isP1 ) {
String s = str . substring ( 0 , x ) + "--" + str . substring ( x + 2 ) ;
if ( s . indexOf ( "++" ) == - 1 ) {
return isP1 ;
}
if ( isP1 ) {
String temp = s ;
for ( int i = temp . indexOf ( "++" ) ;
i >= 0 && i < temp . length ( ) - 1 ;
i = temp . indexOf ( "++" ) ) {
if ( checkP1Win ( s , i , ! isP1 ) ) {
return true ;
}
temp = temp . substring ( 0 , i ) + "-" + temp . substring ( i + 1 ) ;
}
return false ;
}
else {
String temp = s ;
for ( int i = temp . indexOf ( "++" ) ;
i >= 0 && i < temp . length ( ) - 1 ;
i = temp . indexOf ( "++" ) ) {
if ( ! checkP1Win ( s , i , ! isP1 ) ) {
return false ;
}
temp = temp . substring ( 0 , i ) + "-" + temp . substring ( i + 1 ) ;
}
return true ;
}
}
|
709 | <awangdev>Frog Jump_2.java | public boolean canCross(int[] stones) {
if (stones == null || stones.length == 0) return false;
int n = stones.length;
Map<Integer, Set<Integer>> dp = new HashMap<>();
for (int stone : stones) {
dp.put(stone, new HashSet<>());
}
dp.get(0).add(0);
for (int stone : stones) {
for (int k : dp.get(stone)) {
if (k - 1 > 0 && dp.containsKey(stone + k - 1)) {
dp.get(stone + k - 1).add(k - 1);
}
if (k > 0 && dp.containsKey(stone + k)) {
dp.get(stone + k).add(k);
}
if (k + 1 > 0 && dp.containsKey(stone + k + 1)) {
dp.get(stone + k + 1).add(k + 1);
}
}
}
int lastStone = stones[n - 1];
return !dp.get(lastStone).isEmpty();
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) return false ;
int var_5 = var_1 . length ;
Map < Integer , Set < Integer >> var_10 = new HashMap < > ( ) ;
for ( int var_11 : var_1 ) {
var_10 . put ( var_11 , new HashSet < > ( ) ) ;
}
var_10 . get ( 0 ) . add ( 0 ) ;
for ( int var_11 : var_1 ) {
for ( int var_16 : var_10 . get ( var_11 ) ) {
if ( var_16 - 1 > 0 && var_10 . containsKey ( var_11 + var_16 - 1 ) ) {
var_10 . get ( var_11 + var_16 - 1 ) . add ( var_16 - 1 ) ;
}
if ( var_16 > 0 && var_10 . containsKey ( var_11 + var_16 ) ) {
var_10 . get ( var_11 + var_16 ) . add ( var_16 ) ;
}
if ( var_16 + 1 > 0 && var_10 . containsKey ( var_11 + var_16 + 1 ) ) {
var_10 . get ( var_11 + var_16 + 1 ) . add ( var_16 + 1 ) ;
}
}
}
int var_19 = var_1 [ var_5 - 1 ] ;
return ! var_10 . get ( var_19 ) . isEmpty ( ) ;
}
|
710 | <awangdev>254. Factor Combinations_2.java | private List<List<Integer>> calcFactors(int lastFactor, int num) {
List<List<Integer>> rst = new ArrayList<>();
int sqrt = (int)Math.sqrt(num);
for (int i = lastFactor; i <= sqrt; i++) {
int remain = num / i;
if (i * remain == num) rst.add(Arrays.asList(i, remain));
}
return rst;
} | private List < List < Integer >> var_2 ( int var_3 , int var_4 ) {
List < List < Integer >> var_6 = new ArrayList < > ( ) ;
int sqrt = ( int ) Math . sqrt ( var_4 ) ;
for ( int var_9 = var_3 ;
var_9 <= sqrt ;
var_9 ++ ) {
int var_10 = var_4 / var_9 ;
if ( var_9 * var_10 == var_4 ) var_6 . add ( Arrays . asList ( var_9 , var_10 ) ) ;
}
return var_6 ;
}
|
711 | <awangdev>Longest Substring Without Repeating Characters_1.java | public int lengthOfLongestSubstring(String s) {
if (s == null || s.length() == 0) {
return 0;
}
boolean[] chars = new boolean[256];
int rst = 0;
int start = 0;
int end = 0;
while (start < s.length()) {
while (end < s.length() && !chars[s.charAt(end)]) {
chars[s.charAt(end)] = true;
rst = Math.max(rst, end - start + 1);
end++;
}
chars[s.charAt(start)] = false;
start++;
}
return rst;
} | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
boolean [ ] var_7 = new boolean [ 256 ] ;
int var_8 = 0 ;
int var_9 = 0 ;
int var_10 = 0 ;
while ( var_9 < var_1 . length ( ) ) {
while ( var_10 < var_1 . length ( ) && ! var_7 [ var_1 . charAt ( var_10 ) ] ) {
var_7 [ var_1 . charAt ( var_10 ) ] = true ;
var_8 = Math . max ( var_8 , var_10 - var_9 + 1 ) ;
var_10 ++ ;
}
var_7 [ var_1 . charAt ( var_9 ) ] = false ;
var_9 ++ ;
}
return var_8 ;
}
|
712 | <awangdev>Plus One_2.java | public int[] plusOne(int[] digits) {
if(digits.length==0) return digits;
digits[digits.length-1] += 1;
for(int i = digits.length-1; i>0; i--){
if(digits[i] == 10){
digits[i]=0;
digits[i-1]+=1;
}
else return digits;
}
if(digits[0]==10){
int[] output = new int[digits.length+1];
output[0] = 1;
output[1] = 0;
for(int i=2; i<output.length-1; i++){
output[i]=digits[i-1];
}
return output;
}
else return digits;
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return var_0 ;
var_0 [ var_0 . length - 1 ] += 1 ;
for ( int var_4 = var_0 . length - 1 ;
var_4 > 0 ;
var_4 -- ) {
if ( var_0 [ var_4 ] == 10 ) {
var_0 [ var_4 ] = 0 ;
var_0 [ var_4 - 1 ] += 1 ;
}
else return var_0 ;
}
if ( var_0 [ 0 ] == 10 ) {
int [ ] var_6 = new int [ var_0 . length + 1 ] ;
var_6 [ 0 ] = 1 ;
var_6 [ 1 ] = 0 ;
for ( int var_4 = 2 ;
var_4 < var_6 . length - 1 ;
var_4 ++ ) {
var_6 [ var_4 ] = var_0 [ var_4 - 1 ] ;
}
return var_6 ;
}
else return var_0 ;
}
|
713 | <awangdev>1219. Path with Maximum Gold_1.java | private boolean check(int[][] grid, int i, int j) {
return i < 0 || j < 0 || i >= grid.length || j >= grid[0].length || grid[i][j] == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 < 0 || var_3 < 0 || var_2 >= var_1 . length || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] == 0 ;
}
|
714 | <awangdev>122. Best Time to Buy and Sell Stock II_2.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length <= 1) {
return 0;
}
int curr = 0;
int profit = 0;
int peek = 1;
while(curr < prices.length) {
while (peek < prices.length && prices[peek - 1] <= prices[peek]) {
peek++;
}
profit += prices[peek - 1] - prices[curr];
curr = peek;
peek = curr + 1;
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) {
return 0 ;
}
int var_5 = 0 ;
int var_6 = 0 ;
int var_7 = 1 ;
while ( var_5 < var_0 . length ) {
while ( var_7 < var_0 . length && var_0 [ var_7 - 1 ] <= var_0 [ var_7 ] ) {
var_7 ++ ;
}
var_6 += var_0 [ var_7 - 1 ] - var_0 [ var_5 ] ;
var_5 = var_7 ;
var_7 = var_5 + 1 ;
}
return var_6 ;
}
|
715 | <awangdev>Contiguous Array_1.java | public int findMaxLength(int[] nums) {
if (nums == null || nums.length == 0) return 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) nums[i] = -1;
}
Map<Integer, Integer> map = new HashMap<>();
map.put(0, -1);
int preSum = 0, max = 0;
for (int i = 0; i < nums.length; i++) {
preSum += nums[i];
if (map.containsKey(preSum)) {
max = Math.max(max, i - map.get(preSum));
}
if (!map.containsKey(preSum)) {
map.put(preSum, i);
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
if ( var_0 [ var_4 ] == 0 ) var_0 [ var_4 ] = - 1 ;
}
Map < Integer , Integer > var_9 = new HashMap < > ( ) ;
var_9 . put ( 0 , - 1 ) ;
int var_11 = 0 , max = 0 ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
var_11 += var_0 [ var_4 ] ;
if ( var_9 . containsKey ( var_11 ) ) {
max = Math . max ( max , var_4 - var_9 . get ( var_11 ) ) ;
}
if ( ! var_9 . containsKey ( var_11 ) ) {
var_9 . put ( var_11 , var_4 ) ;
}
}
return max ;
}
|
716 | <awangdev>[lint]. Heapify_2.java | public void heapify(int[] A) {
if (A == null || A.length == 0) {
return;
}
int child = 0;
int currId = 0;
int leftId = 0;
int rightId = 0;
int n = A.length;
for (int i = n/2 - 1; i >= 0; i--) {
currId = i;
while (currId * 2 + 1 < n) {
leftId = currId * 2 + 1;
rightId = currId * 2 + 2;
if (rightId >= n || A[leftId] <= A[rightId]) {
child = leftId;
} else {
child = rightId;
}
if (A[currId] <= A[child]) {
break;
} else {
int temp = A[currId];
A[currId] = A[child];
A[child] = temp;
}
currId = child;
}
}
} | public void var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return ;
}
int var_5 = 0 ;
int var_6 = 0 ;
int var_7 = 0 ;
int var_8 = 0 ;
int var_9 = var_1 . length ;
for ( int var_12 = var_9 / 2 - 1 ;
var_12 >= 0 ;
var_12 -- ) {
var_6 = var_12 ;
while ( var_6 * 2 + 1 < var_9 ) {
var_7 = var_6 * 2 + 1 ;
var_8 = var_6 * 2 + 2 ;
if ( var_8 >= var_9 || var_1 [ var_7 ] <= var_1 [ var_8 ] ) {
var_5 = var_7 ;
}
else {
var_5 = var_8 ;
}
if ( var_1 [ var_6 ] <= var_1 [ var_5 ] ) {
break ;
}
else {
int var_13 = var_1 [ var_6 ] ;
var_1 [ var_6 ] = var_1 [ var_5 ] ;
var_1 [ var_5 ] = var_13 ;
}
var_6 = var_5 ;
}
}
}
|
717 | <awangdev>1170. Compare Strings by Frequency of the Smallest Character_3.java | private int count(String w) {
int[] count = new int[26];
for (char c : w.toCharArray()) count[c - 'a']++;
for (int num : count) if (num != 0) return num;
return 0;
} | private int sample_funcname ( String var_1 ) {
int [ ] var_3 = new int [ 26 ] ;
for ( char var_5 : var_1 . toCharArray ( ) ) var_3 [ var_5 - 'a' ] ++ ;
for ( int var_7 : var_3 ) if ( var_7 != 0 ) return var_7 ;
return 0 ;
}
|
718 | <awangdev>218. The Skyline Problem_4.java | int lson(int id) {
return id * 2 + 1;
} | int sample_funcname ( int var_0 ) {
return var_0 * 2 + 1 ;
}
|
719 | <awangdev>293. Flip Game_2.java | public List<String> generatePossibleNextMoves(String s) {
List<String> rst = new ArrayList<String>();
if (s == null || s.length() == 0) {
return rst;
}
ArrayList<Integer> list = new ArrayList<Integer>();
StringBuffer sb = new StringBuffer(s);
while (sb.indexOf("++") != -1) {
int index = sb.indexOf("++");
list.add(index);
sb.replace(index, index + 1, "*");
}
for (int index : list) {
rst.add(s.substring(0, index) + "--" + s.substring(index + 2));
}
return rst;
} | public List < String > var_1 ( String var_2 ) {
List < String > var_5 = new ArrayList < String > ( ) ;
if ( var_2 == null || var_2 . length ( ) == 0 ) {
return var_5 ;
}
ArrayList < Integer > var_10 = new ArrayList < Integer > ( ) ;
StringBuffer var_12 = new StringBuffer ( var_2 ) ;
while ( var_12 . indexOf ( "++" ) != - 1 ) {
int var_16 = var_12 . indexOf ( "++" ) ;
var_10 . add ( var_16 ) ;
var_12 . replace ( var_16 , var_16 + 1 , "*" ) ;
}
for ( int var_16 : var_10 ) {
var_5 . add ( var_2 . substring ( 0 , var_16 ) + "--" + var_2 . substring ( var_16 + 2 ) ) ;
}
return var_5 ;
}
|
720 | <awangdev>Binary Representation_1.java | public String parseInteger(String n) {
if (n.length() == 0 || n.equals("0")) {
return n;
}
int num = Integer.parseInt(n);
StringBuffer sb = new StringBuffer();
while (num != 0) {
sb.insert(0, num % 2);
num = num / 2;
}
return sb.toString();
} | public String var_0 ( String var_2 ) {
if ( var_2 . length ( ) == 0 || var_2 . equals ( "0" ) ) {
return var_2 ;
}
int var_9 = Integer . parseInt ( var_2 ) ;
StringBuffer var_11 = new StringBuffer ( ) ;
while ( var_9 != 0 ) {
var_11 . insert ( 0 , var_9 % 2 ) ;
var_9 = var_9 / 2 ;
}
return var_11 . toString ( ) ;
}
|
721 | <awangdev>Search a 2D Matrix II_3.java | public int searchMatrix(int[][] matrix, int target) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return 0;
}
int row = matrix.length;
int col = matrix[0].length;
int x = row - 1;
int y = 0;
int count = 0;
while (x >= 0 && y < col) {
if (matrix[x][y] < target) {
y++;
} else if (matrix[x][y] > target) {
x--;
} else {
count++;
x--;
y++;
}
}
return count;
} | public int sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] . length == 0 ) {
return 0 ;
}
int var_5 = var_0 . length ;
int var_6 = var_0 [ 0 ] . length ;
int var_8 = var_5 - 1 ;
int var_9 = 0 ;
int var_10 = 0 ;
while ( var_8 >= 0 && var_9 < var_6 ) {
if ( var_0 [ var_8 ] [ var_9 ] < var_1 ) {
var_9 ++ ;
}
else if ( var_0 [ var_8 ] [ var_9 ] > var_1 ) {
var_8 -- ;
}
else {
var_10 ++ ;
var_8 -- ;
var_9 ++ ;
}
}
return var_10 ;
}
|
722 | <awangdev>Maximum Subarray III_1.java | public int maxSubArray(int[] nums, int k) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int[][] dp = new int[n + 1][k + 1];
for (int j = 1; j <= k; j++) {
for (int i = j; i <= n; i++) {
dp[i][j] = Integer.MIN_VALUE;
int endMax = 0;
int max = Integer.MIN_VALUE;
for (int x = i - 1; x >= j - 1; x--) {
endMax = Math.max(nums[x], nums[x] + endMax);
max = Math.max(max, endMax);
dp[i][j] = dp[i][j] < dp[x][j - 1] + max ? dp[x][j - 1] + max : dp[i][j];
}
}
}
return dp[n][k];
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_5 = var_0 . length ;
int [ ] [ ] var_7 = new int [ var_5 + 1 ] [ var_1 + 1 ] ;
for ( int var_8 = 1 ;
var_8 <= var_1 ;
var_8 ++ ) {
for ( int var_9 = var_8 ;
var_9 <= var_5 ;
var_9 ++ ) {
var_7 [ var_9 ] [ var_8 ] = Integer . MIN_VALUE ;
int var_12 = 0 ;
int max = Integer . MIN_VALUE ;
for ( int var_14 = var_9 - 1 ;
var_14 >= var_8 - 1 ;
var_14 -- ) {
var_12 = Math . max ( var_0 [ var_14 ] , var_0 [ var_14 ] + var_12 ) ;
max = Math . max ( max , var_12 ) ;
var_7 [ var_9 ] [ var_8 ] = var_7 [ var_9 ] [ var_8 ] < var_7 [ var_14 ] [ var_8 - 1 ] + max ? var_7 [ var_14 ] [ var_8 - 1 ] + max : var_7 [ var_9 ] [ var_8 ] ;
}
}
}
return var_7 [ var_5 ] [ var_1 ] ;
}
|
723 | <awangdev>72. Edit Distance_3.java | public int minDistance(String word1, String word2) {
if (word1 == null && word2 == null) return 0;
if (word1 == null || word2 == null) return word1 == null ? word2.length() : word1.length();
int m = word1.length();
int n = word2.length();
int[][] dp = new int[m + 1][n + 1];
for (int i = 0; i <= m; i++) {
dp[i][0] = i;
}
for (int j = 0; j <= n; j++) {
dp[0][j] = j;
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
dp[i][j] = dp[i - 1][j - 1];
} else {
dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1;
}
}
}
return dp[m][n];
} | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null && var_2 == null ) return 0 ;
if ( var_1 == null || var_2 == null ) return var_1 == null ? var_2 . length ( ) : var_1 . length ( ) ;
int var_6 = var_1 . length ( ) ;
int var_7 = var_2 . length ( ) ;
int [ ] [ ] var_9 = new int [ var_6 + 1 ] [ var_7 + 1 ] ;
for ( int var_10 = 0 ;
var_10 <= var_6 ;
var_10 ++ ) {
var_9 [ var_10 ] [ 0 ] = var_10 ;
}
for ( int var_11 = 0 ;
var_11 <= var_7 ;
var_11 ++ ) {
var_9 [ 0 ] [ var_11 ] = var_11 ;
}
for ( int var_10 = 1 ;
var_10 <= var_6 ;
var_10 ++ ) {
for ( int var_11 = 1 ;
var_11 <= var_7 ;
var_11 ++ ) {
if ( var_1 . charAt ( var_10 - 1 ) == var_2 . charAt ( var_11 - 1 ) ) {
var_9 [ var_10 ] [ var_11 ] = var_9 [ var_10 - 1 ] [ var_11 - 1 ] ;
}
else {
var_9 [ var_10 ] [ var_11 ] = Math . min ( var_9 [ var_10 - 1 ] [ var_11 - 1 ] , Math . min ( var_9 [ var_10 ] [ var_11 - 1 ] , var_9 [ var_10 - 1 ] [ var_11 ] ) ) + 1 ;
}
}
}
return var_9 [ var_6 ] [ var_7 ] ;
}
|
724 | <awangdev>Maximum Size Subarray Sum Equals k_1.java | public int maxSubArrayLen(int[] nums, int k) {
if (nums == null || nums.length == 0) return 0;
Map<Integer, Integer> map = new HashMap<>();
map.put(0, -1);
int preSum = 0, max = 0;
for (int i = 0; i < nums.length; i++) {
preSum += nums[i];
if (map.containsKey(preSum - k)) {
max = Math.max(max, i - map.get(preSum - k));
}
if (!map.containsKey(preSum)) {
map.put(preSum, i);
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
Map < Integer , Integer > var_8 = new HashMap < > ( ) ;
var_8 . put ( 0 , - 1 ) ;
int var_11 = 0 , max = 0 ;
for ( int var_13 = 0 ;
var_13 < var_0 . length ;
var_13 ++ ) {
var_11 += var_0 [ var_13 ] ;
if ( var_8 . containsKey ( var_11 - var_1 ) ) {
max = Math . max ( max , var_13 - var_8 . get ( var_11 - var_1 ) ) ;
}
if ( ! var_8 . containsKey ( var_11 ) ) {
var_8 . put ( var_11 , var_13 ) ;
}
}
return max ;
}
|
725 | <awangdev>760. Find Anagram Mappings_1.java | public int[] anagramMappings(int[] A, int[] B) {
if (A == null || B == null || A.length == 0) {
return null;
}
int[] result = new int[A.length];
Map<Integer, ArrayList<Integer>> map = new HashMap<>();
for (int i = 0; i < B.length; i++) {
map.putIfAbsent(B[i], new ArrayList<>());
map.get(B[i]).add(i);
}
for (int i = 0; i < A.length; i++) {
ArrayList<Integer> list = map.get(A[i]);
result[i] = list.get(0);
list.remove(0);
}
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
if ( var_0 == null || var_1 == null || var_0 . length == 0 ) {
return null ;
}
int [ ] var_5 = new int [ var_0 . length ] ;
Map < Integer , ArrayList < Integer >> var_10 = new HashMap < > ( ) ;
for ( int var_11 = 0 ;
var_11 < var_1 . length ;
var_11 ++ ) {
var_10 . putIfAbsent ( var_1 [ var_11 ] , new ArrayList < > ( ) ) ;
var_10 . get ( var_1 [ var_11 ] ) . add ( var_11 ) ;
}
for ( int var_11 = 0 ;
var_11 < var_0 . length ;
var_11 ++ ) {
ArrayList < Integer > var_15 = var_10 . get ( var_0 [ var_11 ] ) ;
var_5 [ var_11 ] = var_15 . get ( 0 ) ;
var_15 . remove ( 0 ) ;
}
return var_5 ;
}
|
726 | <awangdev>Maximum Subarray II_1.java | public int maxTwoSubArrays(List<Integer> nums) {
if (nums == null || nums.size() == 0) {
return 0;
}
int n = nums.size();
int[] dpLeft = new int[n + 1];
int[] dpRight = new int[n + 1];
dpLeft[0] = 0;
dpRight[n] = 0;
int[] maxLeft = new int[n + 1];;
int[] maxRight = new int[n + 1];
maxLeft[0] = Integer.MIN_VALUE;
maxRight[n] = Integer.MIN_VALUE;
for (int i = 1; i <= n; i++) {
dpLeft[i] = Math.max(dpLeft[i - 1] + nums.get(i - 1), nums.get(i - 1));
maxLeft[i] = Math.max(maxLeft[i - 1], dpLeft[i]);
}
for (int j = n - 1; j >= 0; j--) {
dpRight[j] = Math.max(dpRight[j + 1] + nums.get(j), nums.get(j));
maxRight[j] = Math.max(maxRight[j + 1], dpRight[j]);
}
int max = Integer.MIN_VALUE;
for (int i = 1; i < n; i++) {
max = Math.max(max, maxLeft[i] + maxRight[i]);
}
return max;
} | public int sample_funcname ( List < Integer > var_2 ) {
if ( var_2 == null || var_2 . size ( ) == 0 ) {
return 0 ;
}
int var_6 = var_2 . size ( ) ;
int [ ] var_8 = new int [ var_6 + 1 ] ;
int [ ] var_9 = new int [ var_6 + 1 ] ;
var_8 [ 0 ] = 0 ;
var_9 [ var_6 ] = 0 ;
int [ ] var_10 = new int [ var_6 + 1 ] ;
;
int [ ] var_11 = new int [ var_6 + 1 ] ;
var_10 [ 0 ] = Integer . MIN_VALUE ;
var_11 [ var_6 ] = Integer . MIN_VALUE ;
for ( int var_13 = 1 ;
var_13 <= var_6 ;
var_13 ++ ) {
var_8 [ var_13 ] = Math . max ( var_8 [ var_13 - 1 ] + var_2 . get ( var_13 - 1 ) , var_2 . get ( var_13 - 1 ) ) ;
var_10 [ var_13 ] = Math . max ( var_10 [ var_13 - 1 ] , var_8 [ var_13 ] ) ;
}
for ( int var_17 = var_6 - 1 ;
var_17 >= 0 ;
var_17 -- ) {
var_9 [ var_17 ] = Math . max ( var_9 [ var_17 + 1 ] + var_2 . get ( var_17 ) , var_2 . get ( var_17 ) ) ;
var_11 [ var_17 ] = Math . max ( var_11 [ var_17 + 1 ] , var_9 [ var_17 ] ) ;
}
int max = Integer . MIN_VALUE ;
for ( int var_13 = 1 ;
var_13 < var_6 ;
var_13 ++ ) {
max = Math . max ( max , var_10 [ var_13 ] + var_11 [ var_13 ] ) ;
}
return max ;
}
|
727 | <awangdev>198. House Robber_2.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length;
long[] dp = new long[2];
dp[0] = 0;
dp[1] = nums[0];
for (int i = 2; i <= n; i++) {
dp[i % 2] = Math.max(dp[(i - 1)%2], dp[(i - 2)%2] + nums[i - 1]);
}
return (int) dp[n % 2];
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length ;
long [ ] var_6 = new long [ 2 ] ;
var_6 [ 0 ] = 0 ;
var_6 [ 1 ] = var_0 [ 0 ] ;
for ( int var_8 = 2 ;
var_8 <= var_4 ;
var_8 ++ ) {
var_6 [ var_8 % 2 ] = Math . max ( var_6 [ ( var_8 - 1 ) % 2 ] , var_6 [ ( var_8 - 2 ) % 2 ] + var_0 [ var_8 - 1 ] ) ;
}
return ( int ) var_6 [ var_4 % 2 ] ;
}
|
728 | <awangdev>[HackerRank]. Change to Anagram_1.java | public int validate(String str) {
if (str.length() % 2 == 1) {
return -1;
}
String sA = str.substring(0, str.length()/2);
String sB = str.substring(str.length()/2);
int[] arr = new int[26];
for (int i = 0; i < sA.length(); i++) {
char cA = sA.charAt(i);
char cB = sB.charAt(i);
if (cA < 'a' || cA > 'z' || cB < 'a' || cB > 'z') {
return -1;
}
arr[cA - 'a']++;
arr[cB - 'a']--;
}
int count = 0;
for (int num : arr) {
count += Math.abs(num);
}
return count/2;
} | public int sample_funcname ( String var_1 ) {
if ( var_1 . length ( ) % 2 == 1 ) {
return - 1 ;
}
String var_7 = var_1 . substring ( 0 , var_1 . length ( ) / 2 ) ;
String var_8 = var_1 . substring ( var_1 . length ( ) / 2 ) ;
int [ ] var_10 = new int [ 26 ] ;
for ( int var_11 = 0 ;
var_11 < var_7 . length ( ) ;
var_11 ++ ) {
char var_13 = var_7 . charAt ( var_11 ) ;
char var_14 = var_8 . charAt ( var_11 ) ;
if ( var_13 < 'a' || var_13 > 'z' || var_14 < 'a' || var_14 > 'z' ) {
return - 1 ;
}
var_10 [ var_13 - 'a' ] ++ ;
var_10 [ var_14 - 'a' ] -- ;
}
int var_17 = 0 ;
for ( int var_18 : var_10 ) {
var_17 += Math . abs ( var_18 ) ;
}
return var_17 / 2 ;
}
|
729 | <awangdev>51. N-Queens_2.java | private List<String> createBoard(int[] columns){
int n = columns.length;
List<String> board = new ArrayList<>();
for (int row = 0; row < n; row++) {
StringBuffer sb = new StringBuffer();
int queenCol = columns[row];
for (int col = 0; col < n; col++) {
sb.append(queenCol == col ? "Q" : ".");
}
board.add(sb.toString());
}
return board;
} | private List < String > var_1 ( int [ ] var_2 ) {
int var_4 = var_2 . length ;
List < String > var_7 = new ArrayList < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_4 ;
var_9 ++ ) {
StringBuffer var_11 = new StringBuffer ( ) ;
int var_12 = var_2 [ var_9 ] ;
for ( int var_13 = 0 ;
var_13 < var_4 ;
var_13 ++ ) {
var_11 . append ( var_12 == var_13 ? "Q" : "." ) ;
}
var_7 . add ( var_11 . toString ( ) ) ;
}
return var_7 ;
}
|
730 | <awangdev>415. Add Strings_2.java | private int[] convertToInt(String num) {
if (num == null || num.length() == 0) {
return new int[1];
}
int n = num.length();
int[] nums = new int[n + 1];
for (int i = 0; i < n; i++) {
nums[i] = num.charAt(n - i - 1) - '0';
}
return nums;
} | private int [ ] sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return new int [ 1 ] ;
}
int var_6 = var_1 . length ( ) ;
int [ ] var_7 = new int [ var_6 + 1 ] ;
for ( int var_8 = 0 ;
var_8 < var_6 ;
var_8 ++ ) {
var_7 [ var_8 ] = var_1 . charAt ( var_6 - var_8 - 1 ) - '0' ;
}
return var_7 ;
}
|
731 | <awangdev>1216. Valid Palindrome III_2.java | private String getKey(int left, int right, int k) {
return String.format("%s@%s@%s", left, right, k);
} | private String var_0 ( int var_1 , int var_2 , int var_3 ) {
return String . format ( "%s@%s@%s" , var_1 , var_2 , var_3 ) ;
}
|
732 | <awangdev>Evaluate Reverse Polish Notation_2.java | private long eval(long a, long b, String s) {
long rst = 0;
char operator = s.charAt(0);
if (operator == '+') rst = a + b;
if (operator == '-') rst = a - b;
if (operator == '*') rst = a * b;
if (operator == '/') rst = a / b;
return rst;
} | private long sample_funcname ( long var_0 , long var_1 , String var_3 ) {
long var_5 = 0 ;
char var_7 = var_3 . charAt ( 0 ) ;
if ( var_7 == '+' ) var_5 = var_0 + var_1 ;
if ( var_7 == '-' ) var_5 = var_0 - var_1 ;
if ( var_7 == '*' ) var_5 = var_0 * var_1 ;
if ( var_7 == '/' ) var_5 = var_0 / var_1 ;
return var_5 ;
}
|
733 | <awangdev>Backpack II_2.java | public int backPackII(int m, int[] A, int V[]) {
if (A == null || V == null || A.length != V.length) {
return 0;
}
int n = A.length;
int[][] dp = new int[2][m + 1];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
dp[i % 2][j] = dp[(i - 1) % 2][j];
if (j - A[i - 1] >= 0) {
dp[i % 2][j] = Math.max(dp[i % 2][j], dp[(i - 1) % 2][j - A[i - 1]] + V[i - 1]);
}
}
}
return dp[n % 2][m];
} | public int sample_funcname ( int var_0 , int [ ] var_1 , int var_2 [ ] ) {
if ( var_1 == null || var_2 == null || var_1 . length != var_2 . length ) {
return 0 ;
}
int var_6 = var_1 . length ;
int [ ] [ ] var_9 = new int [ 2 ] [ var_0 + 1 ] ;
for ( int var_10 = 1 ;
var_10 <= var_6 ;
var_10 ++ ) {
for ( int var_11 = 0 ;
var_11 <= var_0 ;
var_11 ++ ) {
var_9 [ var_10 % 2 ] [ var_11 ] = var_9 [ ( var_10 - 1 ) % 2 ] [ var_11 ] ;
if ( var_11 - var_1 [ var_10 - 1 ] >= 0 ) {
var_9 [ var_10 % 2 ] [ var_11 ] = Math . max ( var_9 [ var_10 % 2 ] [ var_11 ] , var_9 [ ( var_10 - 1 ) % 2 ] [ var_11 - var_1 [ var_10 - 1 ] ] + var_2 [ var_10 - 1 ] ) ;
}
}
}
return var_9 [ var_6 % 2 ] [ var_0 ] ;
}
|
734 | <awangdev>39. Combination Sum_2.java | private boolean validate(int[] candidates, int target) {
return candidates == null || candidates.length == 0 || target <= 0;
} | private boolean var_0 ( int [ ] var_1 , int var_2 ) {
return var_1 == null || var_1 . length == 0 || var_2 <= 0 ;
}
|
735 | <awangdev>986. Interval List Intersections_1.java | public int[][] intervalIntersection(int[][] A, int[][] B) {
List<int[]> list = new ArrayList<>();
int i = 0, j = 0;
int m = A.length, n = B.length;
while (i < m && j < n) {
int lo = Math.max(A[i][0], B[j][0]);
int hi = Math.min(A[i][1], B[j][1]);
if (lo <= hi) list.add(new int[]{lo, hi});
if (A[i][1] < B[j][1]) i++;
else j++;
}
int[][] rst = new int[list.size()][2];
for (int k = 0; k < list.size(); k++) {
rst[k] = list.get(k);
}
return rst;
} | public int [ ] [ ] sample_funcname ( int [ ] [ ] var_0 , int [ ] [ ] var_1 ) {
List < int [ ] > var_4 = new ArrayList < > ( ) ;
int var_6 = 0 , var_7 = 0 ;
int var_9 = var_0 . length , var_10 = var_1 . length ;
while ( var_6 < var_9 && var_7 < var_10 ) {
int var_13 = Math . max ( var_0 [ var_6 ] [ 0 ] , var_1 [ var_7 ] [ 0 ] ) ;
int var_16 = Math . min ( var_0 [ var_6 ] [ 1 ] , var_1 [ var_7 ] [ 1 ] ) ;
if ( var_13 <= var_16 ) var_4 . add ( new int [ ] {
var_13 , var_16 }
) ;
if ( var_0 [ var_6 ] [ 1 ] < var_1 [ var_7 ] [ 1 ] ) var_6 ++ ;
else var_7 ++ ;
}
int [ ] [ ] var_20 = new int [ var_4 . size ( ) ] [ 2 ] ;
for ( int var_21 = 0 ;
var_21 < var_4 . size ( ) ;
var_21 ++ ) {
var_20 [ var_21 ] = var_4 . get ( var_21 ) ;
}
return var_20 ;
}
|
736 | <awangdev>347. Top K Frequent Elements_2.java | private Map<Integer, Integer> buildFreqMap(int[] nums) {
Map<Integer, Integer> map = new HashMap<>();
for (int num : nums) map.put(num, map.getOrDefault(num, 0) + 1);
return map;
} | private Map < Integer , Integer > var_1 ( int [ ] var_2 ) {
Map < Integer , Integer > var_5 = new HashMap < > ( ) ;
for ( int var_6 : var_2 ) var_5 . put ( var_6 , var_5 . getOrDefault ( var_6 , 0 ) + 1 ) ;
return var_5 ;
}
|
737 | <awangdev>28. Implement strStr()_1.java | public int strStr(String haystack, String needle) {
if (needle == null || needle.length() == 0) {
return 0;
}
if (needle.length() > haystack.length()) {
return -1;
}
int n = haystack.length();
int m = needle.length();
for (int i = 0; i < n; i++) {
if (n - i < m) {
return -1;
}
if (haystack.charAt(i) != needle.charAt(0)) {
continue;
}
if (haystack.substring(i, i + m).equals(needle)) {
return i;
}
}
return -1;
} | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_2 == null || var_2 . length ( ) == 0 ) {
return 0 ;
}
if ( var_2 . length ( ) > var_1 . length ( ) ) {
return - 1 ;
}
int var_7 = var_1 . length ( ) ;
int var_8 = var_2 . length ( ) ;
for ( int var_9 = 0 ;
var_9 < var_7 ;
var_9 ++ ) {
if ( var_7 - var_9 < var_8 ) {
return - 1 ;
}
if ( var_1 . charAt ( var_9 ) != var_2 . charAt ( 0 ) ) {
continue ;
}
if ( var_1 . substring ( var_9 , var_9 + var_8 ) . equals ( var_2 ) ) {
return var_9 ;
}
}
return - 1 ;
}
|
738 | <awangdev>767. Reorganize String_3.java | private PriorityQueue<int[]> buildCharQueue (Map<Character, Integer> map) {
PriorityQueue<int[]> queue = new PriorityQueue<>((a,b) -> b[1] - a[1]);
for (char c : map.keySet()) {
queue.add(new int[]{c, map.get(c)});
}
return queue;
} | private PriorityQueue < int [ ] > var_0 ( Map < Character , Integer > var_4 ) {
PriorityQueue < int [ ] > var_9 = new PriorityQueue < > ( ( var_8 , var_6 ) -> var_6 [ 1 ] - var_8 [ 1 ] ) ;
for ( char var_11 : var_4 . keySet ( ) ) {
var_9 . add ( new int [ ] {
var_11 , var_4 . get ( var_11 ) }
) ;
}
return var_9 ;
}
|
739 | <awangdev>Longest Consecutive Sequence_1.java | public int longestConsecutive(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
Set<Integer> set = new HashSet<>();
for (int num : nums) {
set.add(num);
}
int longest = 0;
for (int num : nums) {
int start = num;
while (set.contains(start - 1)) {
start--;
set.remove(start);
}
int end = num;
while (set.contains(end + 1)) {
end++;
set.remove(end);
}
longest = Math.max(longest, end - start + 1);
}
return longest;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
Set < Integer > var_7 = new HashSet < > ( ) ;
for ( int var_8 : var_0 ) {
var_7 . add ( var_8 ) ;
}
int var_10 = 0 ;
for ( int var_8 : var_0 ) {
int var_11 = var_8 ;
while ( var_7 . contains ( var_11 - 1 ) ) {
var_11 -- ;
var_7 . remove ( var_11 ) ;
}
int var_15 = var_8 ;
while ( var_7 . contains ( var_15 + 1 ) ) {
var_15 ++ ;
var_7 . remove ( var_15 ) ;
}
var_10 = Math . max ( var_10 , var_15 - var_11 + 1 ) ;
}
return var_10 ;
}
|
740 | <awangdev>53. Maximum Subarray_5.java | public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length, max = Integer.MIN_VALUE;
int[] dp = new int[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = nums[i - 1] + (dp[i - 1] >= 0 ? dp[i - 1] : 0);
max = Math.max(max, dp[i]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length , max = Integer . MIN_VALUE ;
int [ ] var_9 = new int [ var_4 + 1 ] ;
var_9 [ 0 ] = 0 ;
for ( int var_10 = 1 ;
var_10 <= var_4 ;
var_10 ++ ) {
var_9 [ var_10 ] = var_0 [ var_10 - 1 ] + ( var_9 [ var_10 - 1 ] >= 0 ? var_9 [ var_10 - 1 ] : 0 ) ;
max = Math . max ( max , var_9 [ var_10 ] ) ;
}
return max ;
}
|
741 | <awangdev>46. Permutations_4.java | public List<List<Integer>> permute(int[] nums) {
List<List<Integer>> rst = new ArrayList<>();
if (nums == null || nums.length == 0) return rst;
rst.add(new ArrayList<>());
for (int i = 0; i < nums.length; i++) {
int rstSize = rst.size();
for (int j = 0; j < rstSize; j++) {
List<Integer> baselist = rst.get(j);
for (int index = 0; index < baselist.size(); index++) {
baselist.add(index, nums[i]);
rst.add(new ArrayList<>(baselist));
baselist.remove(index);
}
baselist.add(nums[i]);
}
}
return rst;
} | public List < List < Integer >> var_2 ( int [ ] var_3 ) {
List < List < Integer >> var_5 = new ArrayList < > ( ) ;
if ( var_3 == null || var_3 . length == 0 ) return var_5 ;
var_5 . add ( new ArrayList < > ( ) ) ;
for ( int var_10 = 0 ;
var_10 < var_3 . length ;
var_10 ++ ) {
int var_12 = var_5 . size ( ) ;
for ( int var_13 = 0 ;
var_13 < var_12 ;
var_13 ++ ) {
List < Integer > var_15 = var_5 . get ( var_13 ) ;
for ( int var_16 = 0 ;
var_16 < var_15 . size ( ) ;
var_16 ++ ) {
var_15 . add ( var_16 , var_3 [ var_10 ] ) ;
var_5 . add ( new ArrayList < > ( var_15 ) ) ;
var_15 . remove ( var_16 ) ;
}
var_15 . add ( var_3 [ var_10 ] ) ;
}
}
return var_5 ;
}
|
742 | <awangdev>152. Maximum Product Subarray_2.java | public int maxProduct(int[] nums) {
int n = nums.length;
int[] maxProduct = new int[2], minProduct = new int[2];
maxProduct[0] = nums[0];
minProduct[0] = nums[0];
int max = nums[0];
for (int i = 1; i < n; i++) {
int num = nums[i];
if (num > 0) {
maxProduct[i % 2] = Math.max(num, maxProduct[(i - 1) % 2] * num);
minProduct[i % 2] = Math.min(num, minProduct[(i - 1) % 2] * num);
} else {
maxProduct[i % 2] = Math.max(num, minProduct[(i - 1) % 2] * num);
minProduct[i % 2] = Math.min(num, maxProduct[(i - 1) % 2] * num);
}
max = Math.max(max, maxProduct[i % 2]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = var_0 . length ;
int [ ] var_4 = new int [ 2 ] , var_5 = new int [ 2 ] ;
var_4 [ 0 ] = var_0 [ 0 ] ;
var_5 [ 0 ] = var_0 [ 0 ] ;
int max = var_0 [ 0 ] ;
for ( int var_9 = 1 ;
var_9 < var_2 ;
var_9 ++ ) {
int var_10 = var_0 [ var_9 ] ;
if ( var_10 > 0 ) {
var_4 [ var_9 % 2 ] = Math . max ( var_10 , var_4 [ ( var_9 - 1 ) % 2 ] * var_10 ) ;
var_5 [ var_9 % 2 ] = Math . min ( var_10 , var_5 [ ( var_9 - 1 ) % 2 ] * var_10 ) ;
}
else {
var_4 [ var_9 % 2 ] = Math . max ( var_10 , var_5 [ ( var_9 - 1 ) % 2 ] * var_10 ) ;
var_5 [ var_9 % 2 ] = Math . min ( var_10 , var_4 [ ( var_9 - 1 ) % 2 ] * var_10 ) ;
}
max = Math . max ( max , var_4 [ var_9 % 2 ] ) ;
}
return max ;
}
|
743 | <awangdev>200. Number of Islands_1.java | private boolean validateInput(char[][] grid, int x, int y) {
return x < 0 || x >= grid.length || y < 0 || y >= grid[0].length || grid[x][y] == '0';
} | private boolean var_0 ( char [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 < 0 || var_2 >= var_1 . length || var_3 < 0 || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] == '0' ;
}
|
744 | <awangdev>259. 3Sum Smaller_1.java | public int threeSumSmaller(int[] nums, int target) {
if (nums == null || nums.length <= 2) {
return 0;
}
Arrays.sort(nums);
int count = 0;
for (int i = 0; i < nums.length - 2; i++) {
int start = i + 1, end = nums.length - 1;
while (start < end) {
if (nums[i] + nums[start] + nums[end] < target) {
count += end - start;
start++;
} else {
end--;
}
}
}
return count;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length <= 2 ) {
return 0 ;
}
Arrays . sort ( var_0 ) ;
int var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_0 . length - 2 ;
var_9 ++ ) {
int var_11 = var_9 + 1 , var_12 = var_0 . length - 1 ;
while ( var_11 < var_12 ) {
if ( var_0 [ var_9 ] + var_0 [ var_11 ] + var_0 [ var_12 ] < var_1 ) {
var_8 += var_12 - var_11 ;
var_11 ++ ;
}
else {
var_12 -- ;
}
}
}
return var_8 ;
}
|
745 | <awangdev>91. Decode Ways_1.java | private boolean check(String s, int i) {
int twoDigit = (s.charAt(i - 1) - '0') * 10 + (s.charAt(i) - '0');
return twoDigit <= 26 && twoDigit >= 10;
} | private boolean var_0 ( String var_2 , int var_3 ) {
int var_8 = ( var_2 . charAt ( var_3 - 1 ) - '0' ) * 10 + ( var_2 . charAt ( var_3 ) - '0' ) ;
return var_8 <= 26 && var_8 >= 10 ;
}
|
746 | <awangdev>K Empty Slots_2.java | public int kEmptySlots(int[] flowers, int k) {
if (flowers == null || flowers.length == 0 || k < 0) {
return - 1;
}
int n = flowers.length;
int[] days = new int[n];
for (int i = 0; i < n; i++) {
days[flowers[i] - 1] = i + 1;
}
int left = 0, right = k + 1, result = Integer.MAX_VALUE;
for (int i = 0; right < n; i++) {
if (days[i] < days[left] || days[i] <= days[right]) {
if (i == right) {
result = Math.min(result, Math.max(days[left], days[right]));
}
left = i;
right = k + 1 + i;
}
}
return result == Integer.MAX_VALUE ? - 1 : result;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 < 0 ) {
return - 1 ;
}
int var_6 = var_0 . length ;
int [ ] var_7 = new int [ var_6 ] ;
for ( int var_8 = 0 ;
var_8 < var_6 ;
var_8 ++ ) {
var_7 [ var_0 [ var_8 ] - 1 ] = var_8 + 1 ;
}
int var_9 = 0 , var_10 = var_1 + 1 , var_13 = Integer . MAX_VALUE ;
for ( int var_8 = 0 ;
var_10 < var_6 ;
var_8 ++ ) {
if ( var_7 [ var_8 ] < var_7 [ var_9 ] || var_7 [ var_8 ] <= var_7 [ var_10 ] ) {
if ( var_8 == var_10 ) {
var_13 = Math . min ( var_13 , Math . max ( var_7 [ var_9 ] , var_7 [ var_10 ] ) ) ;
}
var_9 = var_8 ;
var_10 = var_1 + 1 + var_8 ;
}
}
return var_13 == Integer . MAX_VALUE ? - 1 : var_13 ;
}
|
747 | <awangdev>1. Two Sum_1.java | public int[] twoSum(int[] nums, int target) {
int[] rst = new int[2];
if (nums == null || nums.length <= 1) return rst;
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
if (map.containsKey(target - nums[i])) {
rst[0] = map.get(target - nums[i]);
rst[1] = i;
break;
}
map.put(nums[i], i);
}
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
int [ ] var_3 = new int [ 2 ] ;
if ( var_0 == null || var_0 . length <= 1 ) return var_3 ;
Map < Integer , Integer > var_10 = new HashMap < > ( ) ;
for ( int var_12 = 0 ;
var_12 < var_0 . length ;
var_12 ++ ) {
if ( var_10 . containsKey ( var_1 - var_0 [ var_12 ] ) ) {
var_3 [ 0 ] = var_10 . get ( var_1 - var_0 [ var_12 ] ) ;
var_3 [ 1 ] = var_12 ;
break ;
}
var_10 . put ( var_0 [ var_12 ] , var_12 ) ;
}
return var_3 ;
}
|
748 | <awangdev>Paint Fence_1.java | public int numWays(int n, int k) {
if (n <= 1 || k <= 0) {
return n * k;
}
int[] dp = new int[n + 1];
dp[0] = 0;
dp[1] = k;
dp[2] = k + k * (k - 1);
for (int i = 3; i <= n; i++) {
dp[i] = (k - 1) * (dp[i - 1] + dp[i - 2]);
}
return dp[n];
} | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 <= 1 || var_1 <= 0 ) {
return var_0 * var_1 ;
}
int [ ] var_4 = new int [ var_0 + 1 ] ;
var_4 [ 0 ] = 0 ;
var_4 [ 1 ] = var_1 ;
var_4 [ 2 ] = var_1 + var_1 * ( var_1 - 1 ) ;
for ( int var_7 = 3 ;
var_7 <= var_0 ;
var_7 ++ ) {
var_4 [ var_7 ] = ( var_1 - 1 ) * ( var_4 [ var_7 - 1 ] + var_4 [ var_7 - 2 ] ) ;
}
return var_4 [ var_0 ] ;
}
|
749 | <awangdev>121. Best Time to Buy and Sell Stock_4.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int n = prices.length;
int[] dp = new int[2];
dp[0] = Integer.MAX_VALUE;
int profit = 0;
for (int i = 1; i <= n; i++) {
dp[i % 2] = Math.min(dp[(i - 1) % 2], prices[i - 1]);
profit = Math.max(profit, prices[i - 1] - dp[i % 2]);
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int [ ] var_6 = new int [ 2 ] ;
var_6 [ 0 ] = Integer . MAX_VALUE ;
int var_9 = 0 ;
for ( int var_11 = 1 ;
var_11 <= var_4 ;
var_11 ++ ) {
var_6 [ var_11 % 2 ] = Math . min ( var_6 [ ( var_11 - 1 ) % 2 ] , var_0 [ var_11 - 1 ] ) ;
var_9 = Math . max ( var_9 , var_0 [ var_11 - 1 ] - var_6 [ var_11 % 2 ] ) ;
}
return var_9 ;
}
|
750 | <awangdev>567. Permutation in String_3.java | private boolean zeroCount(int[] count) {
for (int i = 0; i < 26; i++) {
if (count[i] != 0) return false;
}
return true;
} | private boolean var_0 ( int [ ] var_1 ) {
for ( int var_3 = 0 ;
var_3 < 26 ;
var_3 ++ ) {
if ( var_1 [ var_3 ] != 0 ) return false ;
}
return true ;
}
|
751 | <awangdev>1213. Intersection of Three Sorted Arrays_1.java | private Set<Integer> toSet(int[] nums) {
Set<Integer> set = new HashSet<>();
for (int num : nums) set.add(num);
return set;
} | private Set < Integer > var_1 ( int [ ] var_2 ) {
Set < Integer > var_5 = new HashSet < > ( ) ;
for ( int var_6 : var_2 ) var_5 . add ( var_6 ) ;
return var_5 ;
}
|
752 | <awangdev>Best Time to Buy and Sell Stock with Transaction Fee_2.java | public int maxProfit(int[] prices, int fee) {
if (prices == null || prices.length <= 1) return 0;
int n = prices.length;
int[][] dp = new int[2][2];
dp[0][0] = dp[0][1] = 0;
dp[1][1] = 0;
dp[1][0] = - prices[0];
for (int i = 2; i <= n; i++) {
dp[i%2][0] = Math.max(dp[(i - 1)%2][0], dp[(i - 1)%2][1] - prices[i - 1]);
dp[i%2][1] = Math.max(dp[(i - 1)%2][1], dp[(i - 1)%2][0] + prices[i - 1] - fee);
}
return dp[n%2][1];
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length <= 1 ) return 0 ;
int var_6 = var_0 . length ;
int [ ] [ ] var_8 = new int [ 2 ] [ 2 ] ;
var_8 [ 0 ] [ 0 ] = var_8 [ 0 ] [ 1 ] = 0 ;
var_8 [ 1 ] [ 1 ] = 0 ;
var_8 [ 1 ] [ 0 ] = - var_0 [ 0 ] ;
for ( int var_9 = 2 ;
var_9 <= var_6 ;
var_9 ++ ) {
var_8 [ var_9 % 2 ] [ 0 ] = Math . max ( var_8 [ ( var_9 - 1 ) % 2 ] [ 0 ] , var_8 [ ( var_9 - 1 ) % 2 ] [ 1 ] - var_0 [ var_9 - 1 ] ) ;
var_8 [ var_9 % 2 ] [ 1 ] = Math . max ( var_8 [ ( var_9 - 1 ) % 2 ] [ 1 ] , var_8 [ ( var_9 - 1 ) % 2 ] [ 0 ] + var_0 [ var_9 - 1 ] - var_1 ) ;
}
return var_8 [ var_6 % 2 ] [ 1 ] ;
}
|
753 | <awangdev>Coins in a Line_5.java | public boolean firstWillWin(int n) {
if (n <= 0) {
return false;
}
return n % 3 != 0;
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
return var_1 % 3 != 0 ;
}
|
754 | <awangdev>Count 1 in Binary_2.java | public int countOnes(int num) {
if (num < 0) {
return 0;
}
String bits = Integer.toBinaryString(num);
char[] bitArray = bits.toCharArray();
int sum = 0;
for (int i = 0; i < bitArray.length; i++) {
sum += Character.getNumericValue(bitArray[i]);
}
return sum;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 < 0 ) {
return 0 ;
}
String var_5 = Integer . toBinaryString ( var_0 ) ;
char [ ] var_7 = var_5 . toCharArray ( ) ;
int var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_7 . length ;
var_9 ++ ) {
var_8 += Character . getNumericValue ( var_7 [ var_9 ] ) ;
}
return var_8 ;
}
|
755 | <awangdev>Letter Combinations of a Phone Number_1.java | public List<String> letterCombinations(String digits) {
List<String> rst = new ArrayList<String>();
if (digits == null || digits.length() == 0) {
return rst;
}
HashMap<Character, String> map = new HashMap<Character, String>();
map.put('2',"abc");
map.put('3',"def");
map.put('4',"ghi");
map.put('5',"jkl");
map.put('6',"mno");
map.put('7',"pqrs");
map.put('8',"tuv");
map.put('9',"wxyz");
Queue<String> queue = new LinkedList<String>();
char c = digits.charAt(0);
String s = map.get(c);
for (int i = 0; i < s.length(); i++) {
queue.offer(s.charAt(i) + "");
}
int size = 0;
for (int i = 1; i < digits.length(); i++) {
c = digits.charAt(i);
s = map.get(c);
size = queue.size();
for (int j = 0; j < size; j++) {
String str = queue.poll();
for (int k = 0; k < s.length(); k++) {
queue.offer(str + s.charAt(k));
}
}
}
while (!queue.isEmpty()) {
rst.add(queue.poll());
}
return rst;
} | public List < String > var_1 ( String var_2 ) {
List < String > var_5 = new ArrayList < String > ( ) ;
if ( var_2 == null || var_2 . length ( ) == 0 ) {
return var_5 ;
}
HashMap < Character , String > var_11 = new HashMap < Character , String > ( ) ;
var_11 . put ( '2' , "abc" ) ;
var_11 . put ( '3' , "def" ) ;
var_11 . put ( '4' , "ghi" ) ;
var_11 . put ( '5' , "jkl" ) ;
var_11 . put ( '6' , "mno" ) ;
var_11 . put ( '7' , "pqrs" ) ;
var_11 . put ( '8' , "tuv" ) ;
var_11 . put ( '9' , "wxyz" ) ;
Queue < String > var_31 = new LinkedList < String > ( ) ;
char var_33 = var_2 . charAt ( 0 ) ;
String var_35 = var_11 . get ( var_33 ) ;
for ( int var_36 = 0 ;
var_36 < var_35 . length ( ) ;
var_36 ++ ) {
var_31 . offer ( var_35 . charAt ( var_36 ) + "" ) ;
}
int size = 0 ;
for ( int var_36 = 1 ;
var_36 < var_2 . length ( ) ;
var_36 ++ ) {
var_33 = var_2 . charAt ( var_36 ) ;
var_35 = var_11 . get ( var_33 ) ;
size = var_31 . size ( ) ;
for ( int var_41 = 0 ;
var_41 < size ;
var_41 ++ ) {
String var_43 = var_31 . poll ( ) ;
for ( int var_44 = 0 ;
var_44 < var_35 . length ( ) ;
var_44 ++ ) {
var_31 . offer ( var_43 + var_35 . charAt ( var_44 ) ) ;
}
}
}
while ( ! var_31 . isEmpty ( ) ) {
var_5 . add ( var_31 . poll ( ) ) ;
}
return var_5 ;
}
|
756 | <awangdev>402. Remove K Digits_1.java | public String removeKdigits(String num, int k) {
Stack<Character> stack = new Stack<>();
int i = 0, n = num.length();
while (i < n) {
char c = num.charAt(i++);
while (k > 0 && !stack.isEmpty() && stack.peek() > c) {
stack.pop();
k--;
}
stack.push(c);
}
while (k-- > 0) stack.pop();
StringBuffer sb = new StringBuffer();
while(!stack.isEmpty()) sb.append(stack.pop());
sb.reverse();
while(sb.length() > 0 && sb.charAt(0) == '0') sb.deleteCharAt(0);
return sb.length() == 0 ? "0" : sb.toString();
} | public String var_0 ( String var_2 , int var_3 ) {
Stack < Character > var_6 = new Stack < > ( ) ;
int var_8 = 0 , var_10 = var_2 . length ( ) ;
while ( var_8 < var_10 ) {
char var_12 = var_2 . charAt ( var_8 ++ ) ;
while ( var_3 > 0 && ! var_6 . isEmpty ( ) && var_6 . peek ( ) > var_12 ) {
var_6 . pop ( ) ;
var_3 -- ;
}
var_6 . push ( var_12 ) ;
}
while ( var_3 -- > 0 ) var_6 . pop ( ) ;
StringBuffer var_18 = new StringBuffer ( ) ;
while ( ! var_6 . isEmpty ( ) ) var_18 . append ( var_6 . pop ( ) ) ;
var_18 . reverse ( ) ;
while ( var_18 . length ( ) > 0 && var_18 . charAt ( 0 ) == '0' ) var_18 . deleteCharAt ( 0 ) ;
return var_18 . length ( ) == 0 ? "0" : var_18 . toString ( ) ;
}
|
757 | <awangdev>169. Majority Element_3.java | private int countInRange(int[] nums, int value, int lo, int hi) {
int count = 0;
for (int i = lo; i <= hi; i++) {
if (nums[i] == value) count++;
}
return count;
} | private int sample_funcname ( int [ ] var_0 , int var_1 , int var_2 , int var_3 ) {
int var_5 = 0 ;
for ( int var_6 = var_2 ;
var_6 <= var_3 ;
var_6 ++ ) {
if ( var_0 [ var_6 ] == var_1 ) var_5 ++ ;
}
return var_5 ;
}
|
758 | <awangdev>921. Minimum Add to Make Parentheses Valid_1.java | public int minAddToMakeValid(String s) {
if (s == null || s.length() == 0) {
return 0;
}
Stack<Character> stack = new Stack<>();
int count = 0;
for (char c : s.toCharArray()) {
if (c == '(') stack.push(c);
else if (stack.isEmpty()) count++;
else stack.pop();
}
return count + stack.size();
} | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
Stack < Character > var_7 = new Stack < > ( ) ;
int var_8 = 0 ;
for ( char var_10 : var_1 . toCharArray ( ) ) {
if ( var_10 == '(' ) var_7 . push ( var_10 ) ;
else if ( var_7 . isEmpty ( ) ) var_8 ++ ;
else var_7 . pop ( ) ;
}
return var_8 + var_7 . size ( ) ;
}
|
759 | <awangdev>Longest Common Subsequence_2.java | public int longestCommonSubsequence(String A, String B) {
if (A == null || B == null || A.length() == 0 || B.length() == 0) {
return 0;
}
int m = A.length();
int n = B.length();
int[][] dp = new int[2][n + 1];
int curr = 1;
int prev = 0;
for (int i = 1; i <= m; i++) {
prev = curr;
curr = 1 - prev;
for (int j = 1; j <= n; j++) {
if(i == 0 || j == 0) {
dp[i][j] = 0;
continue;
}
dp[curr][j] = Math.max(dp[prev][j], dp[curr][j - 1]);
if (A.charAt(i - 1) == B.charAt(j - 1)) {
dp[curr][j] = Math.max(dp[curr][j], dp[prev][j - 1] + 1);
}
}
}
return dp[curr][n];
} | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null || var_1 . length ( ) == 0 || var_2 . length ( ) == 0 ) {
return 0 ;
}
int var_6 = var_1 . length ( ) ;
int var_7 = var_2 . length ( ) ;
int [ ] [ ] var_10 = new int [ 2 ] [ var_7 + 1 ] ;
int var_11 = 1 ;
int var_12 = 0 ;
for ( int var_13 = 1 ;
var_13 <= var_6 ;
var_13 ++ ) {
var_12 = var_11 ;
var_11 = 1 - var_12 ;
for ( int var_14 = 1 ;
var_14 <= var_7 ;
var_14 ++ ) {
if ( var_13 == 0 || var_14 == 0 ) {
var_10 [ var_13 ] [ var_14 ] = 0 ;
continue ;
}
var_10 [ var_11 ] [ var_14 ] = Math . max ( var_10 [ var_12 ] [ var_14 ] , var_10 [ var_11 ] [ var_14 - 1 ] ) ;
if ( var_1 . charAt ( var_13 - 1 ) == var_2 . charAt ( var_14 - 1 ) ) {
var_10 [ var_11 ] [ var_14 ] = Math . max ( var_10 [ var_11 ] [ var_14 ] , var_10 [ var_12 ] [ var_14 - 1 ] + 1 ) ;
}
}
}
return var_10 [ var_11 ] [ var_7 ] ;
}
|
760 | <awangdev>Power of Three_3.java | public boolean isPowerOfThree(int n) {
while (n/3>=1){
if (n%3!=0) return false;
n/=3;
}
return n==1;
} | public boolean var_0 ( int var_1 ) {
while ( var_1 / 3 >= 1 ) {
if ( var_1 % 3 != 0 ) return false ;
var_1 /= 3 ;
}
return var_1 == 1 ;
}
|
761 | <awangdev>274.H-Index_1.java | public int hIndex(int[] citations) {
if (citations == null || citations.length == 0) {
return 0;
}
int n = citations.length;
int[] bucket = new int[n + 1];
for (int i = 0; i < n; i++) {
int bucketSlot = citations[i];
if (bucketSlot <= n) bucket[bucketSlot]++;
else bucket[n]++;
}
int sum = 0;
for (int h = n; h >= 0; h--) {
sum += bucket[h];
if (sum >= h) return h;
}
return 0;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int [ ] var_6 = new int [ var_4 + 1 ] ;
for ( int var_7 = 0 ;
var_7 < var_4 ;
var_7 ++ ) {
int var_8 = var_0 [ var_7 ] ;
if ( var_8 <= var_4 ) var_6 [ var_8 ] ++ ;
else var_6 [ var_4 ] ++ ;
}
int var_9 = 0 ;
for ( int var_10 = var_4 ;
var_10 >= 0 ;
var_10 -- ) {
var_9 += var_6 [ var_10 ] ;
if ( var_9 >= var_10 ) return var_10 ;
}
return 0 ;
}
|
762 | <awangdev>[lint]. Recover Rotated Sorted Array_1.java | public void reverse(ArrayList<Integer> nums, int start, int end){
for (int i = start, j = end; i < j; i++,j--) {
int temp = nums.get(i);
nums.set(i, nums.get(j));
nums.set(j, temp);
}
} | public void var_0 ( ArrayList < Integer > var_3 , int var_4 , int var_5 ) {
for ( int var_6 = var_4 , var_7 = var_5 ;
var_6 < var_7 ;
var_6 ++ , var_7 -- ) {
int var_9 = var_3 . get ( var_6 ) ;
var_3 . set ( var_6 , var_3 . get ( var_7 ) ) ;
var_3 . set ( var_7 , var_9 ) ;
}
}
|
763 | <awangdev>Find Minimum in Rotated Sorted Array_2.java | public int findMin(int[] num) {
if (num == null || num.length == 0) {
return -1;
}
int start = 0;
int end = num.length - 1;
int mid = 0;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (num[mid] > num[end]) {
start = mid;
} else {
end = mid;
}
}
if (num[start] < num[end]) {
return num[start];
} else {
return num[end];
}
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_5 = 0 ;
int var_6 = var_0 . length - 1 ;
int var_7 = 0 ;
while ( var_5 + 1 < var_6 ) {
var_7 = var_5 + ( var_6 - var_5 ) / 2 ;
if ( var_0 [ var_7 ] > var_0 [ var_6 ] ) {
var_5 = var_7 ;
}
else {
var_6 = var_7 ;
}
}
if ( var_0 [ var_5 ] < var_0 [ var_6 ] ) {
return var_0 [ var_5 ] ;
}
else {
return var_0 [ var_6 ] ;
}
}
|
764 | <awangdev>Palindrome Partitioning II_3.java | public int minCut(String s) {
if (s == null || s.length() == 0) {
return 0;
}
int length = s.length();
boolean[][] isPal = new boolean[length][length];
int[] cut = new int[length];
for (int j = 0; j < length; j++) {
cut[j] = j;
for (int i = 0; i <= j; i++) {
if (s.charAt(i) == s.charAt(j) && (j - i <= 1 || isPal[i + 1][j - 1])) {
isPal[i][j] = true;
if (i > 0) {
cut[j] = Math.min(cut[j], cut[i - 1] + 1);
} else {
cut[j] = 0;
}
}
}
}
return cut[length - 1];
} | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
int length = var_1 . length ( ) ;
boolean [ ] [ ] var_6 = new boolean [ length ] [ length ] ;
int [ ] var_7 = new int [ length ] ;
for ( int var_8 = 0 ;
var_8 < length ;
var_8 ++ ) {
var_7 [ var_8 ] = var_8 ;
for ( int var_9 = 0 ;
var_9 <= var_8 ;
var_9 ++ ) {
if ( var_1 . charAt ( var_9 ) == var_1 . charAt ( var_8 ) && ( var_8 - var_9 <= 1 || var_6 [ var_9 + 1 ] [ var_8 - 1 ] ) ) {
var_6 [ var_9 ] [ var_8 ] = true ;
if ( var_9 > 0 ) {
var_7 [ var_8 ] = Math . min ( var_7 [ var_8 ] , var_7 [ var_9 - 1 ] + 1 ) ;
}
else {
var_7 [ var_8 ] = 0 ;
}
}
}
}
return var_7 [ length - 1 ] ;
}
|
765 | <awangdev>Walls and Gates_1.java | private boolean validateCoordinate(int[][] rooms, int x, int y) {
return x < 0 || x >= rooms.length || y < 0 || y >= rooms[0].length || rooms[x][y] == -1 || rooms[x][y] == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 < 0 || var_2 >= var_1 . length || var_3 < 0 || var_3 >= var_1 [ 0 ] . length || var_1 [ var_2 ] [ var_3 ] == - 1 || var_1 [ var_2 ] [ var_3 ] == 0 ;
}
|
766 | <awangdev>Search for a Range_1.java | public int[] searchRange(int[] A, int target) {
int[] rst = new int[]{-1, -1};
if (A == null || A.length == 0) {
return rst;
}
int start = 0;
int end = A.length - 1;
int mid = start + (end - start)/2;
int first = 0;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
if (mid - 1 >= 0 && A[mid - 1] == target) {
end = mid;
continue;
}
break;
} else if (A[mid] < target) {
start = mid;
} else {
end = mid;
}
}
if (A[start] == target) {
first = start;
} else if (A[mid] == target) {
first = mid;
} else if (A[end] == target) {
first = end;
} else {
return rst;
}
int last = first;
start = first;
end = A.length - 1;
while (start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
if (mid + 1 < A.length && A[mid + 1] == target) {
start = mid;
continue;
}
break;
} else if (A[mid] < target) {
start = mid;
} else {
end = mid;
}
}
if (A[end] == target) {
last = end;
} else if (A[mid] == target) {
last = mid;
} else if (A[start] == target) {
last = start;
}
rst[0] = first;
rst[1] = last;
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
int [ ] var_3 = new int [ ] {
- 1 , - 1 };
if ( var_0 == null || var_0 . length == 0 ) {
return var_3 ;
}
int var_7 = 0 ;
int var_8 = var_0 . length - 1 ;
int var_10 = var_7 + ( var_8 - var_7 ) / 2 ;
int var_11 = 0 ;
while ( var_7 + 1 < var_8 ) {
var_10 = var_7 + ( var_8 - var_7 ) / 2 ;
if ( var_0 [ var_10 ] == var_1 ) {
if ( var_10 - 1 >= 0 && var_0 [ var_10 - 1 ] == var_1 ) {
var_8 = var_10 ;
continue ;
}
break ;
}
else if ( var_0 [ var_10 ] < var_1 ) {
var_7 = var_10 ;
}
else {
var_8 = var_10 ;
}
}
if ( var_0 [ var_7 ] == var_1 ) {
var_11 = var_7 ;
}
else if ( var_0 [ var_10 ] == var_1 ) {
var_11 = var_10 ;
}
else if ( var_0 [ var_8 ] == var_1 ) {
var_11 = var_8 ;
}
else {
return var_3 ;
}
int var_12 = var_11 ;
var_7 = var_11 ;
var_8 = var_0 . length - 1 ;
while ( var_7 + 1 < var_8 ) {
var_10 = var_7 + ( var_8 - var_7 ) / 2 ;
if ( var_0 [ var_10 ] == var_1 ) {
if ( var_10 + 1 < var_0 . length && var_0 [ var_10 + 1 ] == var_1 ) {
var_7 = var_10 ;
continue ;
}
break ;
}
else if ( var_0 [ var_10 ] < var_1 ) {
var_7 = var_10 ;
}
else {
var_8 = var_10 ;
}
}
if ( var_0 [ var_8 ] == var_1 ) {
var_12 = var_8 ;
}
else if ( var_0 [ var_10 ] == var_1 ) {
var_12 = var_10 ;
}
else if ( var_0 [ var_7 ] == var_1 ) {
var_12 = var_7 ;
}
var_3 [ 0 ] = var_11 ;
var_3 [ 1 ] = var_12 ;
return var_3 ;
}
|
767 | <awangdev>Ugly Number II_2.java | private void populate(PriorityQueue<Long> candidate, HashSet<Long> set, long[] dp, long last, int factor) {
long nextCandidate = last * factor;
if (!set.contains(nextCandidate)) {
candidate.add(nextCandidate);
set.add(nextCandidate);
}
} | private void var_0 ( PriorityQueue < Long > var_3 , HashSet < Long > var_5 , long [ ] var_6 , long var_7 , int var_8 ) {
long var_9 = var_7 * var_8 ;
if ( ! var_5 . contains ( var_9 ) ) {
var_3 . add ( var_9 ) ;
var_5 . add ( var_9 ) ;
}
}
|
768 | <awangdev>Longest Increasing Continuous subsequence II_1.java | public int dfs(int[][] A, int[][] dp, int[][] flag, int i, int j, int n, int m) {
if (flag[i][j] == 1) {
return dp[i][j];
}
int ans = 1;
flag[i][j] = -1;
int[] dx = {0, 0, 1, -1};
int[] dy = {1, -1, 0, 0};
for (int k = 0; k < dx.length; k++) {
int id = i + dx[k];
int jd = j + dy[k];
if (id >= 0 && id < n && jd >= 0 && jd < m && A[i][j] < A[id][jd]) {
ans = Math.max(ans, dfs(A, dp, flag, id, jd, n, m) + 1);
}
}
flag[i][j] = 1;
dp[i][j] = ans;
return dp[i][j];
} | public int sample_funcname ( int [ ] [ ] A , int [ ] [ ] dp , int [ ] [ ] flag , int i , int j , int n , int m ) {
if ( flag [ i ] [ j ] == 1 ) {
return dp [ i ] [ j ] ;
}
int ans = 1 ;
flag [ i ] [ j ] = - 1 ;
int [ ] dx = {
0 , 0 , 1 , - 1 };
int [ ] dy = {
1 , - 1 , 0 , 0 };
for ( int k = 0 ;
k < dx . length ;
k ++ ) {
int id = i + dx [ k ] ;
int jd = j + dy [ k ] ;
if ( id >= 0 && id < n && jd >= 0 && jd < m && A [ i ] [ j ] < A [ id ] [ jd ] ) {
ans = Math . max ( ans , dfs ( A , dp , flag , id , jd , n , m ) + 1 ) ;
}
}
flag [ i ] [ j ] = 1 ;
dp [ i ] [ j ] = ans ;
return dp [ i ] [ j ] ;
}
|
769 | <awangdev>125. Valid Palindrome_3.java | public boolean isPalindrome(String s) {
if (s == null || s.length() == 0) {
return true;
}
StringBuffer sb = new StringBuffer();
s = s.toLowerCase();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if ((c <= 'z' && c >= 'a') || (c >= '0' && c <= '9')) {
sb.append(s.charAt(i));
}
}
s = sb.toString();
int start = 0;
int end = s.length() - 1;
while (start < end) {
if (s.charAt(start) != s.charAt(end)) {
return false;
}
start++;
end--;
}
return true;
} | public boolean var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . length ( ) == 0 ) {
return true ;
}
StringBuffer var_7 = new StringBuffer ( ) ;
var_2 = var_2 . toLowerCase ( ) ;
for ( int var_9 = 0 ;
var_9 < var_2 . length ( ) ;
var_9 ++ ) {
char var_11 = var_2 . charAt ( var_9 ) ;
if ( ( var_11 <= 'z' && var_11 >= 'a' ) || ( var_11 >= '0' && var_11 <= '9' ) ) {
var_7 . append ( var_2 . charAt ( var_9 ) ) ;
}
}
var_2 = var_7 . toString ( ) ;
int var_18 = 0 ;
int var_20 = var_2 . length ( ) - 1 ;
while ( var_18 < var_20 ) {
if ( var_2 . charAt ( var_18 ) != var_2 . charAt ( var_20 ) ) {
return false ;
}
var_18 ++ ;
var_20 -- ;
}
return true ;
}
|
770 | <awangdev>Sum of Two Integers_2.java | public int aplusb(int a, int b) {
int numA = a;
int numB = b;
int incompleteSum = 0;
while (numB != 0) {
incompleteSum = numA ^ numB;
numB = (numA & numB) << 1;
numA = incompleteSum;
}
return incompleteSum;
} | public int sample_funcname ( int var_0 , int var_1 ) {
int var_2 = var_0 ;
int var_3 = var_1 ;
int var_5 = 0 ;
while ( var_3 != 0 ) {
var_5 = var_2 ^ var_3 ;
var_3 = ( var_2 & var_3 ) << 1 ;
var_2 = var_5 ;
}
return var_5 ;
}
|
771 | <awangdev>204. Count Primes_2.java | public boolean isPrime(int num) {
if (num <= 1) return false;
for (int i = 2; i * i <= num; i++) {
if (num % i == 0) {
return false;
}
}
return true;
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 1 ) return false ;
for ( int var_4 = 2 ;
var_4 * var_4 <= var_1 ;
var_4 ++ ) {
if ( var_1 % var_4 == 0 ) {
return false ;
}
}
return true ;
}
|
772 | <awangdev>448. Find All Numbers Disappeared in an Array_2.java | public List<Integer> findDisappearedNumbers(int[] nums) {
final List<Integer> rst = new ArrayList<Integer>();
if (nums == null || nums.length == 0) return rst;
for (int i = 0; i < nums.length; i++) {
int desiredIndex = Math.abs(nums[i]) - 1;
nums[desiredIndex] = -Math.abs(nums[desiredIndex]);
}
for (int i = 0; i < nums.length; i++) {
if (nums[i] > 0) rst.add(i + 1);
}
return rst;
} | public List < Integer > var_1 ( int [ ] var_2 ) {
final List < Integer > var_5 = new ArrayList < Integer > ( ) ;
if ( var_2 == null || var_2 . length == 0 ) return var_5 ;
for ( int var_9 = 0 ;
var_9 < var_2 . length ;
var_9 ++ ) {
int var_13 = Math . abs ( var_2 [ var_9 ] ) - 1 ;
var_2 [ var_13 ] = - Math . abs ( var_2 [ var_13 ] ) ;
}
for ( int var_9 = 0 ;
var_9 < var_2 . length ;
var_9 ++ ) {
if ( var_2 [ var_9 ] > 0 ) var_5 . add ( var_9 + 1 ) ;
}
return var_5 ;
}
|
773 | <awangdev>Ugly Number_3.java | public long kthPrimeNumber(int k) {
if (k == 0) {
return 0;
}
ArrayList<Long> set = new ArrayList<Long>();
PriorityQueue<Long> queue = new PriorityQueue<Long>();
queue.offer((long)3);
queue.offer((long)5);
queue.offer((long)7);
set.add((long)3);
set.add((long)5);
set.add((long)7);
long num = 0;
for (int i = 0; i < k; i++) {
num = queue.poll();
if (!set.contains(num * 3)) {
queue.offer(num * 3);
set.add(num * 3);
}
if (!set.contains(num * 5)) {
queue.offer(num * 5);
set.add(num * 5);
}
if (!set.contains(num * 7)) {
queue.offer(num * 7);
set.add(num * 7);
}
}
return num;
} | public long sample_funcname ( int var_0 ) {
if ( var_0 == 0 ) {
return 0 ;
}
ArrayList < Long > var_4 = new ArrayList < Long > ( ) ;
PriorityQueue < Long > var_6 = new PriorityQueue < Long > ( ) ;
var_6 . offer ( ( long ) 3 ) ;
var_6 . offer ( ( long ) 5 ) ;
var_6 . offer ( ( long ) 7 ) ;
var_4 . add ( ( long ) 3 ) ;
var_4 . add ( ( long ) 5 ) ;
var_4 . add ( ( long ) 7 ) ;
long var_12 = 0 ;
for ( int var_13 = 0 ;
var_13 < var_0 ;
var_13 ++ ) {
var_12 = var_6 . poll ( ) ;
if ( ! var_4 . contains ( var_12 * 3 ) ) {
var_6 . offer ( var_12 * 3 ) ;
var_4 . add ( var_12 * 3 ) ;
}
if ( ! var_4 . contains ( var_12 * 5 ) ) {
var_6 . offer ( var_12 * 5 ) ;
var_4 . add ( var_12 * 5 ) ;
}
if ( ! var_4 . contains ( var_12 * 7 ) ) {
var_6 . offer ( var_12 * 7 ) ;
var_4 . add ( var_12 * 7 ) ;
}
}
return var_12 ;
}
|
774 | <awangdev>844. Backspace String Compare_1.java | private int backtrack(String s, int index) {
int i = index, count = 0;
while (i >= 0) {
if (s.charAt(i) == '#') {
count++;
i--;
} else if (count > 0) {
count--;
i--;
} else break;
}
return i;
} | private int sample_funcname ( String var_1 , int var_2 ) {
int var_3 = var_2 , var_5 = 0 ;
while ( var_3 >= 0 ) {
if ( var_1 . charAt ( var_3 ) == '#' ) {
var_5 ++ ;
var_3 -- ;
}
else if ( var_5 > 0 ) {
var_5 -- ;
var_3 -- ;
}
else break ;
}
return var_3 ;
}
|
775 | <awangdev>Longest Increasing Continuous subsequence_3.java | public int longestIncreasingContinuousSubsequence(int[] A) {
if (A == null || A.length == 0) {
return -1;
}
int maxLength1 = 0;
int maxLength2 = 0;
int track = 1;
for (int i = 1; i < A.length; i++) {
if (A[i] > A[i - 1]) {
track++;
} else {
maxLength1 = track > maxLength1 ? track : maxLength1;
track = 1;
}
}
maxLength1 = track > maxLength1 ? track : maxLength1;
track = 1;
for (int i = A.length - 2; i >= 0; i--) {
if (A[i] > A[i + 1]) {
track++;
} else {
maxLength2 = track > maxLength2 ? track : maxLength2;
track = 1;
}
}
maxLength2 = track > maxLength2 ? track : maxLength2;
return maxLength1 > maxLength2 ? maxLength1 : maxLength2;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_5 = 0 ;
int var_6 = 0 ;
int var_7 = 1 ;
for ( int var_8 = 1 ;
var_8 < var_0 . length ;
var_8 ++ ) {
if ( var_0 [ var_8 ] > var_0 [ var_8 - 1 ] ) {
var_7 ++ ;
}
else {
var_5 = var_7 > var_5 ? var_7 : var_5 ;
var_7 = 1 ;
}
}
var_5 = var_7 > var_5 ? var_7 : var_5 ;
var_7 = 1 ;
for ( int var_8 = var_0 . length - 2 ;
var_8 >= 0 ;
var_8 -- ) {
if ( var_0 [ var_8 ] > var_0 [ var_8 + 1 ] ) {
var_7 ++ ;
}
else {
var_6 = var_7 > var_6 ? var_7 : var_6 ;
var_7 = 1 ;
}
}
var_6 = var_7 > var_6 ? var_7 : var_6 ;
return var_5 > var_6 ? var_5 : var_6 ;
}
|
776 | <awangdev>Perfect Squares_1.java | public int numSquares(int n) {
if (n <= 1) {
return 1;
}
int[] dp = new int[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = Integer.MAX_VALUE;
for (int j = 1; j <= i; j++) {
if (i >= j * j) {
dp[i] = Math.min(dp[i], dp[i - j * j] + 1);
} else {
break;
}
}
}
return dp[n];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
int [ ] var_2 = new int [ var_0 + 1 ] ;
var_2 [ 0 ] = 0 ;
for ( int var_4 = 1 ;
var_4 <= var_0 ;
var_4 ++ ) {
var_2 [ var_4 ] = Integer . MAX_VALUE ;
for ( int var_7 = 1 ;
var_7 <= var_4 ;
var_7 ++ ) {
if ( var_4 >= var_7 * var_7 ) {
var_2 [ var_4 ] = Math . min ( var_2 [ var_4 ] , var_2 [ var_4 - var_7 * var_7 ] + 1 ) ;
}
else {
break ;
}
}
}
return var_2 [ var_0 ] ;
}
|
777 | <awangdev>31. Next Permutation_3.java | private void swap(int[] nums, int a, int b) {
int temp = nums[a];
nums[a] = nums[b];
nums[b] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
778 | <awangdev>52. N-Queens II_1.java | private boolean validate(int[] columns, int row, int col) {
for (int newRow = 0; newRow < row; newRow++) {
int newCol = columns[newRow];
if (col == newCol || Math.abs(row - newRow) == Math.abs(col - newCol)) {
return false;
}
}
return true;
} | private boolean var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
int var_6 = var_1 [ var_5 ] ;
if ( var_3 == var_6 || Math . abs ( var_2 - var_5 ) == Math . abs ( var_3 - var_6 ) ) {
return false ;
}
}
return true ;
}
|
779 | <awangdev>88. Merge Sorted Array_2.java | public void merge(int[] nums1, int m, int[] nums2, int n) {
m--; n--;
while (m >= 0 || n >= 0) {
if (m >= 0 && n >= 0) {
nums1[m + n + 1] = nums1[m] > nums2[n] ? nums1[m--] : nums2[n--];
} else if (m < 0) {
nums1[n] = nums2[n--];
} else if (n < 0) {
break;
}
}
} | public void var_0 ( int [ ] var_1 , int var_2 , int [ ] var_3 , int var_4 ) {
var_2 -- ;
var_4 -- ;
while ( var_2 >= 0 || var_4 >= 0 ) {
if ( var_2 >= 0 && var_4 >= 0 ) {
var_1 [ var_2 + var_4 + 1 ] = var_1 [ var_2 ] > var_3 [ var_4 ] ? var_1 [ var_2 -- ] : var_3 [ var_4 -- ] ;
}
else if ( var_2 < 0 ) {
var_1 [ var_4 ] = var_3 [ var_4 -- ] ;
}
else if ( var_4 < 0 ) {
break ;
}
}
}
|
780 | <awangdev>Classical Binary Search_1.java | public int findPosition(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return -1;
}
int start = 0;
int end = nums.length - 1;
while (start + 1 < end) {
int mid = start + ((end - start) >> 1);
if (nums[mid] == target) {
return mid;
} else if (nums[mid] < target) {
start = mid;
} else {
end = mid;
}
}
if (nums[start] == target) {
return start;
}
if (nums[end] == target) {
return end;
}
return -1;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_6 = 0 ;
int var_7 = var_0 . length - 1 ;
while ( var_6 + 1 < var_7 ) {
int var_8 = var_6 + ( ( var_7 - var_6 ) >> 1 ) ;
if ( var_0 [ var_8 ] == var_1 ) {
return var_8 ;
}
else if ( var_0 [ var_8 ] < var_1 ) {
var_6 = var_8 ;
}
else {
var_7 = var_8 ;
}
}
if ( var_0 [ var_6 ] == var_1 ) {
return var_6 ;
}
if ( var_0 [ var_7 ] == var_1 ) {
return var_7 ;
}
return - 1 ;
}
|
781 | <awangdev>Triangles_1.java | public int minimumTotal(List<List<Integer>> triangle) {
if (triangle == null || triangle.size() == 0) {
return 0;
}
int n = triangle.size();
int[][] dp = new int[n][n];
for (int j = 0; j < n; j++) {
dp[n - 1][j] = triangle.get(n - 1).get(j);
}
for (int i = n - 2; i >= 0; i--) {
for (int j = 0; j <= i; j++) {
dp[i][j] = Math.min(dp[i + 1][j], dp[i + 1][j + 1]) + triangle.get(i).get(j);
}
}
return dp[0][0];
} | public int sample_funcname ( List < List < Integer >> var_2 ) {
if ( var_2 == null || var_2 . size ( ) == 0 ) {
return 0 ;
}
int var_6 = var_2 . size ( ) ;
int [ ] [ ] var_7 = new int [ var_6 ] [ var_6 ] ;
for ( int var_8 = 0 ;
var_8 < var_6 ;
var_8 ++ ) {
var_7 [ var_6 - 1 ] [ var_8 ] = var_2 . get ( var_6 - 1 ) . get ( var_8 ) ;
}
for ( int var_12 = var_6 - 2 ;
var_12 >= 0 ;
var_12 -- ) {
for ( int var_8 = 0 ;
var_8 <= var_12 ;
var_8 ++ ) {
var_7 [ var_12 ] [ var_8 ] = Math . min ( var_7 [ var_12 + 1 ] [ var_8 ] , var_7 [ var_12 + 1 ] [ var_8 + 1 ] ) + var_2 . get ( var_12 ) . get ( var_8 ) ;
}
}
return var_7 [ 0 ] [ 0 ] ;
}
|
782 | <awangdev>QuickSort_2.java | private void printArray(int[] nums, String str) {
System.out.print(str);
if (nums == null || nums.length == 0) {
System.out.println();
return;
}
for (int num : nums) {
System.out.print(num + ", ");
}
System.out.println();
} | private void var_0 ( int [ ] var_1 , String var_3 ) {
System . out . print ( var_3 ) ;
if ( var_1 == null || var_1 . length == 0 ) {
System . out . println ( ) ;
return ;
}
for ( int var_11 : var_1 ) {
System . out . print ( var_11 + ", " ) ;
}
System . out . println ( ) ;
}
|
783 | <awangdev>[tool]. MergeSort_1.java | private void merge(int[] nums, int[] temp, int start, int end) {
int leftEnd = start + (end - start) / 2;
int rightStart = leftEnd + 1;
int size = end - start + 1;
int i = start;
int j = rightStart;
int index = start;
while (i <= leftEnd && j <= end) {
if (nums[i] <= nums[j]) {
temp[index] = nums[i];
i++;
} else {
temp[index] = nums[j];
j++;
}
index++;
}
System.arraycopy(nums, i, temp, index, leftEnd - i + 1);
System.arraycopy(nums, j, temp, index, end - j + 1);
System.arraycopy(temp, start, nums, start, end - start + 1);
} | private void var_0 ( int [ ] var_1 , int [ ] var_2 , int var_3 , int var_4 ) {
int var_6 = var_3 + ( var_4 - var_3 ) / 2 ;
int var_8 = var_6 + 1 ;
int var_9 = var_4 - var_3 + 1 ;
int var_10 = var_3 ;
int var_11 = var_8 ;
int var_12 = var_3 ;
while ( var_10 <= var_6 && var_11 <= var_4 ) {
if ( var_1 [ var_10 ] <= var_1 [ var_11 ] ) {
var_2 [ var_12 ] = var_1 [ var_10 ] ;
var_10 ++ ;
}
else {
var_2 [ var_12 ] = var_1 [ var_11 ] ;
var_11 ++ ;
}
var_12 ++ ;
}
System . arraycopy ( var_1 , var_10 , var_2 , var_12 , var_6 - var_10 + 1 ) ;
System . arraycopy ( var_1 , var_11 , var_2 , var_12 , var_4 - var_11 + 1 ) ;
System . arraycopy ( var_2 , var_3 , var_1 , var_3 , var_4 - var_3 + 1 ) ;
}
|
784 | <awangdev>Backpack_6.java | public int backPack(int m, int[] A) {
if (A == null || m == 0) {
return 0;
}
boolean[] DP = new boolean[m + 1];
DP[0] = true;
for (int i = 1; i <= A.length; i++) {
for (int j = m; j >= 0; j--) {
if (j - A[i - 1] >= 0 && DP[j - A[i - 1]]) {
DP[j] = true;
}
}
}
for (int j = m; j >= 0; j--) {
if (DP[j]) {
return j;
}
}
return 0;
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_0 == 0 ) {
return 0 ;
}
boolean [ ] var_6 = new boolean [ var_0 + 1 ] ;
var_6 [ 0 ] = true ;
for ( int var_7 = 1 ;
var_7 <= var_1 . length ;
var_7 ++ ) {
for ( int var_9 = var_0 ;
var_9 >= 0 ;
var_9 -- ) {
if ( var_9 - var_1 [ var_7 - 1 ] >= 0 && var_6 [ var_9 - var_1 [ var_7 - 1 ] ] ) {
var_6 [ var_9 ] = true ;
}
}
}
for ( int var_9 = var_0 ;
var_9 >= 0 ;
var_9 -- ) {
if ( var_6 [ var_9 ] ) {
return var_9 ;
}
}
return 0 ;
}
|
785 | <awangdev>Number of Connected Components in an Undirected Graph_2.java | private void dfs(Map<Integer, List<Integer>> graph, boolean[] visited, int i) {
if (visited[i]) {
return;
}
visited[i] = true;
for (int j : graph.get(i)) {
dfs(graph, visited, j);
}
} | private void sample_funcname ( Map < Integer , List < Integer >> graph , boolean [ ] visited , int i ) {
if ( visited [ i ] ) {
return ;
}
visited [ i ] = true ;
for ( int j : graph . get ( i ) ) {
dfs ( graph , visited , j ) ;
}
}
|
786 | <awangdev>796. Rotate String_2.java | public void reverse(char[] A, int start, int end) {
for (int i = start, j = end; i < j; i++, j--) {
char temp = A[j];
A[j] = A[i];
A[i] = temp;
}
} | public void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
for ( int var_4 = var_2 , var_5 = var_3 ;
var_4 < var_5 ;
var_4 ++ , var_5 -- ) {
char var_6 = var_1 [ var_5 ] ;
var_1 [ var_5 ] = var_1 [ var_4 ] ;
var_1 [ var_4 ] = var_6 ;
}
}
|
787 | <awangdev>265. Paint House II_2.java | public int minCostII(int[][] costs) {
if (costs == null || costs.length == 0) return 0;
if (costs.length == 1 && costs[0].length == 1) return costs[0][0];
int n = costs.length, k = costs[0].length;
int[][] dp = new int[2][k];
for (int i = 1; i <= n; i++) {
for (int j = 0; j < k; j++) {
dp[i % 2][j] = Integer.MAX_VALUE;
for (int m = 0; m < k; m++) {
if (j == m) continue;
dp[i % 2][j] = Math.min(dp[i % 2][j], dp[(i - 1) % 2][m] + costs[i - 1][j]);
}
}
}
int min = Integer.MAX_VALUE;
for (int j = 0; j < k; j++) min = Math.min(min, dp[n % 2][j]);
return min;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
if ( var_0 . length == 1 && var_0 [ 0 ] . length == 1 ) return var_0 [ 0 ] [ 0 ] ;
int var_5 = var_0 . length , var_6 = var_0 [ 0 ] . length ;
int [ ] [ ] var_8 = new int [ 2 ] [ var_6 ] ;
for ( int var_9 = 1 ;
var_9 <= var_5 ;
var_9 ++ ) {
for ( int var_10 = 0 ;
var_10 < var_6 ;
var_10 ++ ) {
var_8 [ var_9 % 2 ] [ var_10 ] = Integer . MAX_VALUE ;
for ( int var_13 = 0 ;
var_13 < var_6 ;
var_13 ++ ) {
if ( var_10 == var_13 ) continue ;
var_8 [ var_9 % 2 ] [ var_10 ] = Math . min ( var_8 [ var_9 % 2 ] [ var_10 ] , var_8 [ ( var_9 - 1 ) % 2 ] [ var_13 ] + var_0 [ var_9 - 1 ] [ var_10 ] ) ;
}
}
}
int min = Integer . MAX_VALUE ;
for ( int var_10 = 0 ;
var_10 < var_6 ;
var_10 ++ ) min = Math . min ( min , var_8 [ var_5 % 2 ] [ var_10 ] ) ;
return min ;
}
|
788 | <awangdev>Longest Valid Parentheses_2.java | private int addPriorLength(int priorIndex, int[] dp) {
return (priorIndex - 1 >= 0) ? dp[priorIndex - 1] : 0;
} | private int sample_funcname ( int var_0 , int [ ] var_1 ) {
return ( var_0 - 1 >= 0 ) ? var_1 [ var_0 - 1 ] : 0 ;
}
|
789 | <awangdev>Count and Say_2.java | public String countAndSay(int n) {
if (n <= 1) {
return n + "";
}
String str = "11";
int ind = 2;
while (ind < n) {
StringBuffer sb = new StringBuffer();
char[] arr = str.toCharArray();
int count = 1;
int type = Character.getNumericValue(arr[0]);
for (int i = 1; i < arr.length; i++) {
if (arr[i] == arr[i - 1]) {
count++;
} else {
sb.append(count + "" + type);
type = Character.getNumericValue(arr[i]);
count = 1;
}
}
ind++;
sb.append(count + "" + type);
str = sb.toString();
}
return str;
} | public String var_0 ( int var_1 ) {
if ( var_1 <= 1 ) {
return var_1 + "" ;
}
String var_6 = "11" ;
int var_8 = 2 ;
while ( var_8 < var_1 ) {
StringBuffer var_10 = new StringBuffer ( ) ;
char [ ] var_12 = var_6 . toCharArray ( ) ;
int var_13 = 1 ;
int var_17 = Character . getNumericValue ( var_12 [ 0 ] ) ;
for ( int var_18 = 1 ;
var_18 < var_12 . length ;
var_18 ++ ) {
if ( var_12 [ var_18 ] == var_12 [ var_18 - 1 ] ) {
var_13 ++ ;
}
else {
var_10 . append ( var_13 + "" + var_17 ) ;
var_17 = Character . getNumericValue ( var_12 [ var_18 ] ) ;
var_13 = 1 ;
}
}
var_8 ++ ;
var_10 . append ( var_13 + "" + var_17 ) ;
var_6 = var_10 . toString ( ) ;
}
return var_6 ;
}
|
790 | <awangdev>62. Unique Path_3.java | private String getKey(int x, int y) {
return x + "," + y;
} | private String var_0 ( int var_1 , int var_2 ) {
return var_1 + "," + var_2 ;
}
|
791 | <awangdev>Find Peak Element_1.java | public int findPeakElement(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int start = 0;
int end = n - 1;
while (start + 1 < end) {
int mid = (start + end) >> 1;
if (nums[mid] > nums[mid - 1] && nums[mid] > nums[mid + 1]) {
return mid;
} else if (nums[mid] > nums[mid - 1]) {
start = mid;
} else {
end = mid;
}
}
return nums[start] > nums[end] ? start : end;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = var_0 . length ;
int var_5 = 0 ;
int var_7 = var_4 - 1 ;
while ( var_5 + 1 < var_7 ) {
int var_8 = ( var_5 + var_7 ) >> 1 ;
if ( var_0 [ var_8 ] > var_0 [ var_8 - 1 ] && var_0 [ var_8 ] > var_0 [ var_8 + 1 ] ) {
return var_8 ;
}
else if ( var_0 [ var_8 ] > var_0 [ var_8 - 1 ] ) {
var_5 = var_8 ;
}
else {
var_7 = var_8 ;
}
}
return var_0 [ var_5 ] > var_0 [ var_7 ] ? var_5 : var_7 ;
}
|
792 | <awangdev>55. Jump Game_1.java | public boolean canJump(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
int farest = 0;
for (int i = 0; i < nums.length; i++) {
farest = Math.max(farest, i + nums[i]);
if (farest >= nums.length - 1) {
return true;
}
if (farest <= i) {
return false;
}
}
return true;
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
int var_5 = 0 ;
for ( int var_6 = 0 ;
var_6 < var_1 . length ;
var_6 ++ ) {
var_5 = Math . max ( var_5 , var_6 + var_1 [ var_6 ] ) ;
if ( var_5 >= var_1 . length - 1 ) {
return true ;
}
if ( var_5 <= var_6 ) {
return false ;
}
}
return true ;
}
|
793 | <awangdev>Heaters_1.java | public int findRadius(int[] houses, int[] heaters) {
int heaterIndex = 0;
int radius = 0;
int heatersLength = heaters.length;
Arrays.sort(houses);
Arrays.sort(heaters);
for (int i = 0; i < houses.length; i++) {
int housePos = houses[i];
while (heaterIndex < heatersLength - 1 && Math.abs(heaters[heaterIndex + 1] - housePos) <= Math.abs(heaters[heaterIndex] - housePos)) {
heaterIndex++;
}
radius = Math.max(radius, Math.abs(heaters[heaterIndex] - housePos));
}
return radius;
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
int var_3 = 0 ;
int var_4 = 0 ;
int var_6 = var_1 . length ;
Arrays . sort ( var_0 ) ;
Arrays . sort ( var_1 ) ;
for ( int var_9 = 0 ;
var_9 < var_0 . length ;
var_9 ++ ) {
int var_10 = var_0 [ var_9 ] ;
while ( var_3 < var_6 - 1 && Math . abs ( var_1 [ var_3 + 1 ] - var_10 ) <= Math . abs ( var_1 [ var_3 ] - var_10 ) ) {
var_3 ++ ;
}
var_4 = Math . max ( var_4 , Math . abs ( var_1 [ var_3 ] - var_10 ) ) ;
}
return var_4 ;
}
|
794 | <awangdev>Minimum Subarray_2.java | public int minSubArray(ArrayList<Integer> nums) {
if (nums == null || nums.size() == 0) {
return 0;
}
int curMin = nums.get(0);
int minRst = nums.get(0);
for (int i = 1; i < nums.size(); i++) {
curMin = Math.min(nums.get(i), curMin + nums.get(i));
minRst = Math.min(curMin, minRst);
}
return minRst;
} | public int sample_funcname ( ArrayList < Integer > var_2 ) {
if ( var_2 == null || var_2 . size ( ) == 0 ) {
return 0 ;
}
int var_7 = var_2 . get ( 0 ) ;
int var_8 = var_2 . get ( 0 ) ;
for ( int var_10 = 1 ;
var_10 < var_2 . size ( ) ;
var_10 ++ ) {
var_7 = Math . min ( var_2 . get ( var_10 ) , var_7 + var_2 . get ( var_10 ) ) ;
var_8 = Math . min ( var_7 , var_8 ) ;
}
return var_8 ;
}
|
795 | <awangdev>Two Sum II - Input array is sorted_1.java | public int[] twoSum(int[] numbers, int target) {
if (numbers == null || numbers.length == 0) {
return numbers;
}
final int[] result = new int[2];
int start = 0;
int end = numbers.length - 1;
while (start < end) {
long sum = (long)(numbers[start] + numbers[end]);
if (sum == target) {
result[0] = start + 1;
result[1] = end + 1;
break;
} else if (sum < target) {
start++;
} else {
end--;
}
}
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return var_0 ;
}
final int [ ] var_6 = new int [ 2 ] ;
int var_7 = 0 ;
int var_9 = var_0 . length - 1 ;
while ( var_7 < var_9 ) {
long var_10 = ( long ) ( var_0 [ var_7 ] + var_0 [ var_9 ] ) ;
if ( var_10 == var_1 ) {
var_6 [ 0 ] = var_7 + 1 ;
var_6 [ 1 ] = var_9 + 1 ;
break ;
}
else if ( var_10 < var_1 ) {
var_7 ++ ;
}
else {
var_9 -- ;
}
}
return var_6 ;
}
|
796 | <awangdev>Excel Sheet Column Number_2.java | public int titleToNumber(String s) {
if (s == null || s.length() == 0) {
return 0;
}
int num = 0;
for (int i = s.length() - 1; i >= 0; i--) {
int digit = s.charAt(i) - 'A' + 1;
num += digit * Math.pow(26, s.length() - i - 1);
}
return num;
} | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return 0 ;
}
int var_5 = 0 ;
for ( int var_7 = var_1 . length ( ) - 1 ;
var_7 >= 0 ;
var_7 -- ) {
int var_10 = var_1 . charAt ( var_7 ) - 'A' + 1 ;
var_5 += var_10 * Math . pow ( 26 , var_1 . length ( ) - var_7 - 1 ) ;
}
return var_5 ;
}
|
797 | <awangdev>Shortest Palindrome_1.java | private boolean validateSubstring(String s, int i, int j) {
String end = s.substring(j).toString();
String front = new StringBuffer(s.substring(0, i + 1)).reverse().toString();
if (front.length() <= end.length() && end.indexOf(front) == 0) {
return true;
}
return false;
} | private boolean var_0 ( String var_2 , int var_3 , int var_4 ) {
String var_7 = var_2 . substring ( var_4 ) . toString ( ) ;
String var_12 = new StringBuffer ( var_2 . substring ( 0 , var_3 + 1 ) ) . reverse ( ) . toString ( ) ;
if ( var_12 . length ( ) <= var_7 . length ( ) && var_7 . indexOf ( var_12 ) == 0 ) {
return true ;
}
return false ;
}
|
798 | <awangdev>Maximum Average Subarray II_1.java | private boolean check(int[] nums, int k, double midAvg) {
double preSum = 0;
double sum = 0;
double minPreSum = 0;
for (int i = 0; i < k; i++) {
sum += nums[i] - midAvg;
}
if (sum >= 0) {
return true;
}
for (int i = k; i < nums.length; i++) {
sum += nums[i] - midAvg;
preSum += nums[i - k] - midAvg;
minPreSum = Math.min(preSum, minPreSum);
if (sum >= minPreSum) {
return true;
}
}
return false;
} | private boolean var_0 ( int [ ] var_1 , int var_2 , double var_3 ) {
double var_5 = 0 ;
double var_6 = 0 ;
double var_7 = 0 ;
for ( int var_8 = 0 ;
var_8 < var_2 ;
var_8 ++ ) {
var_6 += var_1 [ var_8 ] - var_3 ;
}
if ( var_6 >= 0 ) {
return true ;
}
for ( int var_8 = var_2 ;
var_8 < var_1 . length ;
var_8 ++ ) {
var_6 += var_1 [ var_8 ] - var_3 ;
var_5 += var_1 [ var_8 - var_2 ] - var_3 ;
var_7 = Math . min ( var_5 , var_7 ) ;
if ( var_6 >= var_7 ) {
return true ;
}
}
return false ;
}
|
799 | <awangdev>121. Best Time to Buy and Sell Stock_3.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) return 0;
int n = prices.length;
int[] dp = new int[n + 1];
dp[0] = Integer.MAX_VALUE;
int profit = 0;
for (int i = 1; i <= n; i++) {
dp[i] = Math.min(dp[i - 1], prices[i - 1]);
profit = Math.max(profit, prices[i - 1] - dp[i]);
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length ;
int [ ] var_6 = new int [ var_4 + 1 ] ;
var_6 [ 0 ] = Integer . MAX_VALUE ;
int var_9 = 0 ;
for ( int var_10 = 1 ;
var_10 <= var_4 ;
var_10 ++ ) {
var_6 [ var_10 ] = Math . min ( var_6 [ var_10 - 1 ] , var_0 [ var_10 - 1 ] ) ;
var_9 = Math . max ( var_9 , var_0 [ var_10 - 1 ] - var_6 [ var_10 ] ) ;
}
return var_9 ;
}
|
Subsets and Splits