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
⌀ |
|---|---|---|---|---|---|
620 | <awangdev>53. Maximum Subarray_8.java | public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
final int[] sums = new int[nums.length];
sums[0] = nums[0];
int maxSum = sums[0];
for (int i = 1; i < nums.length; i++) {
if (sums[i - 1] < 0) {
sums[i] = nums[i];
} else {
sums[i] = sums[i - 1] + nums[i];
}
maxSum = Math.max(maxSum, sums[i]);
}
return maxSum;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
final int [ ] var_1 = new int [ var_0 . length ] ;
var_1 [ 0 ] = var_0 [ 0 ] ;
int var_2 = var_1 [ 0 ] ;
for ( int var_3 = 1 ;
var_3 < var_0 . length ;
var_3 ++ ) {
if ( var_1 [ var_3 - 1 ] < 0 ) {
var_1 [ var_3 ] = var_0 [ var_3 ] ;
}
else {
var_1 [ var_3 ] = var_1 [ var_3 - 1 ] + var_0 [ var_3 ] ;
}
var_2 = Math . max ( var_2 , var_1 [ var_3 ] ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
621 | <awangdev>IndexMatch_1.java | public int indexMatch(int[] nums) {
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)/2;
if (nums[mid] == mid) {
return mid;
} else if (nums[mid] < mid) {
start = mid;
} else {
end = mid;
}
}
return -1;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_1 = 0 ;
int var_2 = var_0 . length - 1 ;
while ( var_1 + 1 < var_2 ) {
int var_3 = var_1 + ( var_2 - var_1 ) / 2 ;
if ( var_0 [ var_3 ] == var_3 ) {
return var_3 ;
}
else if ( var_0 [ var_3 ] < var_3 ) {
var_1 = var_3 ;
}
else {
var_2 = var_3 ;
}
}
return - 1 ;
}
| 3 | 2<SEP>0<SEP>1 |
622 | <awangdev>239. Sliding Window Maximum_1.java | private void inQueue(Deque<Integer> deque, int num) {
while (!deque.isEmpty() && deque.peekLast() < num) {
deque.pollLast();
}
deque.offerLast(num);
} | private void var_0 ( Deque < Integer > var_1 , int var_2 ) {
while ( ! var_1 . isEmpty ( ) && var_1 . peekLast ( ) < var_2 ) {
var_1 . pollLast ( ) ;
}
var_1 . offerLast ( var_2 ) ;
}
| 0 | null |
623 | <awangdev>8. String to Integer (atoi)_2.java | public int atoi(String str) {
if (str == null || str.length() == 0) {
return 0;
}
str = str.replaceAll("\\s","");
if (!str.matches("[+-]?(?:\\d+(?:\\.\\d*)?|\\.\\d+)")) {
return 0;
}
double rst = Double.parseDouble(str);
if (rst > Integer.MAX_VALUE) {
return Integer.MAX_VALUE;
} else if (rst < Integer.MIN_VALUE) {
return Integer.MIN_VALUE;
} else {
return (int)rst;
}
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
var_0 = var_0 . replaceAll ( "\\s" , "" ) ;
if ( ! var_0 . matches ( "[+-]?(?:\\d+(?:\\.\\d*)?|\\.\\d+)" ) ) {
return 0 ;
}
double var_1 = Double . parseDouble ( var_0 ) ;
if ( var_1 > Integer . MAX_VALUE ) {
return Integer . MAX_VALUE ;
}
else if ( var_1 < Integer . MIN_VALUE ) {
return Integer . MIN_VALUE ;
}
else {
return ( int ) var_1 ;
}
}
| 4 | 0<SEP><D_QUOTE>\\s<D_QUOTE><SEP><D_QUOTE><D_QUOTE><SEP><D_QUOTE>[+-]?(?:\\d+(?:\\.\\d*)?|\\.\\d+)<D_QUOTE> |
624 | <awangdev>57. Insert Interval_1.java | private boolean isEnd(int[][] intervals, int end, int i) {
return i + 1 < intervals.length && end < intervals[i+1][0];
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_3 + 1 < var_1 . length && var_2 < var_1 [ var_3 + 1 ] [ 0 ] ;
}
| 2 | 1<SEP>0 |
625 | <awangdev>727. Minimum Window Subsequence_3.java | public String minWindow(String s, String t) {
int sIndex = 0, tIndex = 0, start = -1;
int m = s.length(), n = t.length(), minLength = m;
char[] ss = s.toCharArray(), tt = t.toCharArray();
while (sIndex < m) {
if(ss[sIndex] == tt[tIndex]) {
if(++tIndex == n) {
int end = sIndex + 1;
while(--tIndex >= 0) {
while(ss[sIndex--] != tt[tIndex]);
}
sIndex++;
tIndex++;
if (end - sIndex < minLength) {
minLength = end - sIndex;
start = sIndex;
}
}
}
++sIndex;
}
return start == -1 ? "" : s.substring(start, start + minLength);
} | public String var_0 ( String var_1 , String var_2 ) {
int var_3 = 0 , var_4 = 0 , var_5 = - 1 ;
int var_6 = var_1 . length ( ) , var_7 = var_2 . length ( ) , var_8 = var_6 ;
char [ ] var_9 = var_1 . toCharArray ( ) , var_10 = var_2 . toCharArray ( ) ;
while ( var_3 < var_6 ) {
if ( var_9 [ var_3 ] == var_10 [ var_4 ] ) {
if ( ++ var_4 == var_7 ) {
int var_11 = var_3 + 1 ;
while ( -- var_4 >= 0 ) {
while ( var_9 [ var_3 -- ] != var_10 [ var_4 ] ) ;
}
var_3 ++ ;
var_4 ++ ;
if ( var_11 - var_3 < var_8 ) {
var_8 = var_11 - var_3 ;
var_5 = var_3 ;
}
}
}
++ var_3 ;
}
return var_5 == - 1 ? "" : var_1 . substring ( var_5 , var_5 + var_8 ) ;
}
| 3 | 0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
626 | <awangdev>The Maze_1.java | private boolean verify(int[] pos, int[] dest) {
return pos[0] == dest[0] && pos[1] == dest[1];
} | private boolean var_0 ( int [ ] var_1 , int [ ] var_2 ) {
return var_1 [ 0 ] == var_2 [ 0 ] && var_1 [ 1 ] == var_2 [ 1 ] ;
}
| 2 | 0<SEP>1 |
627 | <awangdev>Best Time to Buy and Sell Stock III_2.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int profit = 0;
int n = prices.length;
int[][] dp = new int[2][5];
dp[0][0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j < 5; j++) {
int dailyPartialProfit = prices[i] - prices[i - 1];
if (j % 2 == 0) {
dp[i % 2][j] = Math.max(dp[(i - 1) % 2][j], dp[(i - 1) % 2][j - 1] + dailyPartialProfit);
profit = Math.max(profit, dp[i % 2][j]);
} else {
dp[i % 2][j] = Math.max(dp[(i - 1) % 2][j] + dailyPartialProfit, dp[(i - 1) % 2][j - 1]);
}
}
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_1 = 0 ;
int var_2 = var_0 . length ;
int [ ] [ ] var_3 = new int [ 2 ] [ 5 ] ;
var_3 [ 0 ] [ 0 ] = 0 ;
for ( int var_4 = 1 ;
var_4 < var_2 ;
var_4 ++ ) {
for ( int var_5 = 1 ;
var_5 < 5 ;
var_5 ++ ) {
int var_6 = var_0 [ var_4 ] - var_0 [ var_4 - 1 ] ;
if ( var_5 % 2 == 0 ) {
var_3 [ var_4 % 2 ] [ var_5 ] = Math . max ( var_3 [ ( var_4 - 1 ) % 2 ] [ var_5 ] , var_3 [ ( var_4 - 1 ) % 2 ] [ var_5 - 1 ] + var_6 ) ;
var_1 = Math . max ( var_1 , var_3 [ var_4 % 2 ] [ var_5 ] ) ;
}
else {
var_3 [ var_4 % 2 ] [ var_5 ] = Math . max ( var_3 [ ( var_4 - 1 ) % 2 ] [ var_5 ] + var_6 , var_3 [ ( var_4 - 1 ) % 2 ] [ var_5 - 1 ] ) ;
}
}
}
return var_1 ;
}
| 4 | 0<SEP>5<SEP>1<SEP>2 |
628 | <awangdev>[lint]. Unique Characters_3.java | public boolean isUnique(String str) {
if (str == null || str.length() == 0) {
return true;
}
for (int i = 0; i < str.length(); i++) {
for (int j = i + 1; j < str.length(); j++) {
if (str.charAt(i) == str.charAt(j)) {
return false;
}
}
}
return true;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return true ;
}
for ( int var_2 = 0 ;
var_2 < var_1 . length ( ) ;
var_2 ++ ) {
for ( int var_3 = var_2 + 1 ;
var_3 < var_1 . length ( ) ;
var_3 ++ ) {
if ( var_1 . charAt ( var_2 ) == var_1 . charAt ( var_3 ) ) {
return false ;
}
}
}
return true ;
}
| 2 | 0<SEP>1 |
629 | <awangdev>159. Longest Substring with At Most Two Distinct Characters_1.java | public int lengthOfLongestSubstringTwoDistinct(String s) {
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() <= 2) max = Math.max(max, right - left);
if (freq.size() > 2) {
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 ) {
if ( var_0 == null ) return 0 ;
int var_1 = 0 , var_2 = 0 , max = 0 , var_3 = var_0 . length ( ) ;
Map < Character , Integer > var_4 = new HashMap < > ( ) ;
while ( var_2 < var_3 ) {
char var_5 = var_0 . charAt ( var_2 ++ ) ;
var_4 . put ( var_5 , var_4 . getOrDefault ( var_5 , 0 ) + 1 ) ;
if ( var_4 . size ( ) <= 2 ) max = Math . max ( max , var_2 - var_1 ) ;
if ( var_4 . size ( ) > 2 ) {
char var_6 = var_0 . charAt ( var_1 ++ ) ;
var_4 . put ( var_6 , var_4 . get ( var_6 ) - 1 ) ;
if ( var_4 . get ( var_6 ) == 0 ) var_4 . remove ( var_6 ) ;
}
}
return max ;
}
| 3 | 2<SEP>0<SEP>1 |
630 | <awangdev>Partition Array by Odd and Even_1.java | public void partitionArray(int[] nums) {
if (nums == null || nums.length == 0){
return;
}
int nextOddPt = -1;
int firstEvenPt = -1;
for (int i = 0; i < nums.length; i++) {
if (nums[i] % 2 == 1) {
nextOddPt = i;
} else {
if (firstEvenPt == -1) {
firstEvenPt = i;
}
}
if (nextOddPt > firstEvenPt && firstEvenPt != -1) {
int temp = nums[nextOddPt];
nums[nextOddPt] = nums[firstEvenPt];
nums[firstEvenPt] = temp;
i = firstEvenPt - 1;
firstEvenPt = -1;
}
}
} | public void var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return ;
}
int var_2 = - 1 ;
int var_3 = - 1 ;
for ( int var_4 = 0 ;
var_4 < var_1 . length ;
var_4 ++ ) {
if ( var_1 [ var_4 ] % 2 == 1 ) {
var_2 = var_4 ;
}
else {
if ( var_3 == - 1 ) {
var_3 = var_4 ;
}
}
if ( var_2 > var_3 && var_3 != - 1 ) {
int var_5 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_5 ;
var_4 = var_3 - 1 ;
var_3 = - 1 ;
}
}
}
| 3 | 2<SEP>0<SEP>1 |
631 | <awangdev>Permutation Sequence_2.java | public String getPermutation(int n, int k) {
if (n <= 0 || k <= 0) {
return "";
}
ArrayList<Integer> nums = new ArrayList<Integer>();
for (int i = 1; i <= n; i++) {
nums.add(i);
}
int frontInd = 0;
for (; frontInd < nums.size(); frontInd++) {
int factorio = 1;
for (int i = 1; i < n; i++) {
factorio = factorio * i;
}
int startInd = frontInd;
int numPermute = factorio;
while (numPermute < k) {
numPermute += factorio;
startInd++;
}
if (startInd != frontInd) {
int temp = nums.get(startInd);
nums.remove(startInd);
nums.add(frontInd, temp);
k = k - numPermute;
n--;
}
}
StringBuffer sb = new StringBuffer();
for (int num : nums) {
sb.append(num);
}
return sb.toString();
} | public String var_0 ( int var_1 , int var_2 ) {
if ( var_1 <= 0 || var_2 <= 0 ) {
return "" ;
}
ArrayList < Integer > var_3 = new ArrayList < Integer > ( ) ;
for ( int var_4 = 1 ;
var_4 <= var_1 ;
var_4 ++ ) {
var_3 . add ( var_4 ) ;
}
int var_5 = 0 ;
for ( ;
var_5 < var_3 . size ( ) ;
var_5 ++ ) {
int var_6 = 1 ;
for ( int var_4 = 1 ;
var_4 < var_1 ;
var_4 ++ ) {
var_6 = var_6 * var_4 ;
}
int var_7 = var_5 ;
int var_8 = var_6 ;
while ( var_8 < var_2 ) {
var_8 += var_6 ;
var_7 ++ ;
}
if ( var_7 != var_5 ) {
int var_9 = var_3 . get ( var_7 ) ;
var_3 . remove ( var_7 ) ;
var_3 . add ( var_5 , var_9 ) ;
var_2 = var_2 - var_8 ;
var_1 -- ;
}
}
StringBuffer var_10 = new StringBuffer ( ) ;
for ( int var_11 : var_3 ) {
var_10 . append ( var_11 ) ;
}
return var_10 . toString ( ) ;
}
| 3 | 0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
632 | <awangdev>207. Course Schedule_2.java | private boolean dfs(List[] edges, int[] visited, int node) {
if (visited[node] == 1) return true;
if (visited[node] == -1) return false;
visited[node] = -1;
List<Integer> childNodes = edges[node];
for (int childNode : childNodes) {
if (!dfs(edges, visited, childNode)) return false;
}
visited[node] = 1;
return true;
} | private boolean sample_funcname ( List [ ] edges , int [ ] visited , int node ) {
if ( visited [ node ] == 1 ) return true ;
if ( visited [ node ] == - 1 ) return false ;
visited [ node ] = - 1 ;
List < Integer > childNodes = edges [ node ] ;
for ( int childNode : childNodes ) {
if ( ! dfs ( edges , visited , childNode ) ) return false ;
}
visited [ node ] = 1 ;
return true ;
}
| 1 | 1 |
634 | <awangdev>Cracking the Safe_2.java | private void dfs(int n, int k, double total, Set<String> visited, StringBuffer sb) {
if (visited.size() == total) return;
String tail = sb.substring(sb.length() - n + 1);
for (int j = k - 1; j >= 0; j--) {
String newStr = tail + j;
if (visited.contains(newStr)) continue;
visited.add(newStr);
sb.append(j);
dfs(n, k, total, visited, sb);
}
} | private void sample_funcname ( int n , int k , double total , Set < String > visited , StringBuffer sb ) {
if ( visited . size ( ) == total ) return ;
String tail = sb . substring ( sb . length ( ) - n + 1 ) ;
for ( int j = k - 1 ;
j >= 0 ;
j -- ) {
String newStr = tail + j ;
if ( visited . contains ( newStr ) ) continue ;
visited . add ( newStr ) ;
sb . append ( j ) ;
dfs ( n , k , total , visited , sb ) ;
}
}
| 2 | 1<SEP>0 |
635 | <awangdev>Bricks Falling When Hit_1.java | private boolean validate(int[][] grid, int x, int y) {
return x >= 0 && x < grid.length && y >= 0 && y < grid[0].length && grid[x][y] == 1;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 ) {
return var_2 >= 0 && var_2 < var_1 . length && var_3 >= 0 && var_3 < var_1 [ 0 ] . length && var_1 [ var_2 ] [ var_3 ] == 1 ;
}
| 2 | 0<SEP>1 |
636 | <awangdev>743. Network Delay Time_1.java | private Map<Integer, List<int[]>> buildGraph(int[][] times) {
Map<Integer, List<int[]>> graph = new HashMap<>();
for (int[] record : times) {
graph.putIfAbsent(record[0], new ArrayList<>());
graph.get(record[0]).add(new int[]{record[1], record[2]});
}
return graph;
} | private Map < Integer , List < int [ ] >> var_0 ( int [ ] [ ] var_1 ) {
Map < Integer , List < int [ ] >> var_2 = new HashMap < > ( ) ;
for ( int [ ] var_3 : var_1 ) {
var_2 . putIfAbsent ( var_3 [ 0 ] , new ArrayList < > ( ) ) ;
var_2 . get ( var_3 [ 0 ] ) . add ( new int [ ] {
var_3 [ 1 ] , var_3 [ 2 ] }
) ;
}
return var_2 ;
}
| 3 | 2<SEP>0<SEP>1 |
637 | <awangdev>151. Reverse Words in a String_1.java | public String reverseWords(String s) {
if (s == null) return s;
String[] strs = s.split(" ");
StringBuffer sb = new StringBuffer();
for (String str : strs) {
if (str.length() != 0) sb.insert(0, str + " ");
}
return sb.toString().trim();
} | public String var_0 ( String var_1 ) {
if ( var_1 == null ) return var_1 ;
String [ ] var_2 = var_1 . split ( " " ) ;
StringBuffer var_3 = new StringBuffer ( ) ;
for ( String var_4 : var_2 ) {
if ( var_4 . length ( ) != 0 ) var_3 . insert ( 0 , var_4 + " " ) ;
}
return var_3 . toString ( ) . trim ( ) ;
}
| 2 | 0<SEP><D_QUOTE> <D_QUOTE> |
638 | <awangdev>611. Valid Triangle Number_1.java | public int triangleNumber(int[] nums) {
Arrays.sort(nums);
int n = nums.length, count = 0;
for (int k = n - 1; k >= 2; k--) {
for (int i = 0, j = k - 1; i < j;) {
if (nums[i] + nums[j] > nums[k]) {
count += j - i;
j--;
} else i++;
}
}
return count;
} | public int sample_funcname ( int [ ] var_0 ) {
Arrays . sort ( var_0 ) ;
int var_1 = var_0 . length , var_2 = 0 ;
for ( int var_3 = var_1 - 1 ;
var_3 >= 2 ;
var_3 -- ) {
for ( int var_4 = 0 , var_5 = var_3 - 1 ;
var_4 < var_5 ;
) {
if ( var_0 [ var_4 ] + var_0 [ var_5 ] > var_0 [ var_3 ] ) {
var_2 += var_5 - var_4 ;
var_5 -- ;
}
else var_4 ++ ;
}
}
return var_2 ;
}
| 3 | 2<SEP>0<SEP>1 |
639 | <awangdev>210. Course Schedule II_2.java | private List[] buildInDegreeEdges(int numCourses, int[][] prerequisites) {
List[] inDegreeEdges = new ArrayList[numCourses];
for (int i = 0; i < numCourses; i++) inDegreeEdges[i] = new ArrayList<Integer>();
for (int[] prerequisite : prerequisites) inDegreeEdges[prerequisite[1]].add(prerequisite[0]);
return inDegreeEdges;
} | private List [ ] var_0 ( int var_1 , int [ ] [ ] var_2 ) {
List [ ] var_3 = new ArrayList [ var_1 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) var_3 [ var_4 ] = new ArrayList < Integer > ( ) ;
for ( int [ ] var_5 : var_2 ) var_3 [ var_5 [ 1 ] ] . add ( var_5 [ 0 ] ) ;
return var_3 ;
}
| 2 | 0<SEP>1 |
640 | <awangdev>217. Contains Duplicate_1.java | public boolean containsDuplicate(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
HashSet<Integer> set = new HashSet<>();
for (int num : nums) {
if (set.contains(num)) {
return true;
}
set.add(num);
}
return false;
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
HashSet < Integer > var_2 = new HashSet < > ( ) ;
for ( int var_3 : var_1 ) {
if ( var_2 . contains ( var_3 ) ) {
return true ;
}
var_2 . add ( var_3 ) ;
}
return false ;
}
| 1 | 0 |
641 | <awangdev>76. Minimum Window Substring_1.java | public String minWindow(String s, String t) {
int left = 0, right = 0, start = 0, counter = t.length();
int minLen = Integer.MAX_VALUE, n = s.length();
int[] freq = new int[256];
for (char c : t.toCharArray()) freq[c]++;
while (right < n) {
char head = s.charAt(right++);
if (freq[head] > 0) counter--;
freq[head]--;
while (counter == 0) {
int len = right - left;
if (len < minLen) {
minLen = len;
start = left;
}
char tail = s.charAt(left++);
if (freq[tail] == 0) counter++;
freq[tail]++;
}
}
return minLen == Integer.MAX_VALUE ? "" : s.substring(start, start + minLen);
} | public String var_0 ( String var_1 , String var_2 ) {
int var_3 = 0 , var_4 = 0 , var_5 = 0 , var_6 = var_2 . length ( ) ;
int var_7 = Integer . MAX_VALUE , var_8 = var_1 . length ( ) ;
int [ ] var_9 = new int [ 256 ] ;
for ( char var_10 : var_2 . toCharArray ( ) ) var_9 [ var_10 ] ++ ;
while ( var_4 < var_8 ) {
char var_11 = var_1 . charAt ( var_4 ++ ) ;
if ( var_9 [ var_11 ] > 0 ) var_6 -- ;
var_9 [ var_11 ] -- ;
while ( var_6 == 0 ) {
int var_12 = var_4 - var_3 ;
if ( var_12 < var_7 ) {
var_7 = var_12 ;
var_5 = var_3 ;
}
char var_13 = var_1 . charAt ( var_3 ++ ) ;
if ( var_9 [ var_13 ] == 0 ) var_6 ++ ;
var_9 [ var_13 ] ++ ;
}
}
return var_7 == Integer . MAX_VALUE ? "" : var_1 . substring ( var_5 , var_5 + var_7 ) ;
}
| 3 | <D_QUOTE><D_QUOTE><SEP>0<SEP>256 |
642 | <awangdev>Sort Colors II_2.java | public void swap(int[] colors, int x, int y){
int temp = colors[x];
colors[x] = colors[y];
colors[y] = temp;
} | public 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 |
643 | <awangdev>Scramble String_1.java | public boolean isScramble(String s1, String s2) {
if (s1 == null || s2 == null) {
return s1 == null && s2 == null;
}
if (s1.length() != s2.length()) {
return false;
}
if (s1.equals(s2)) {
return true;
}
int n = s1.length();
boolean[][][] dp = new boolean[n][n][n + 1];
int len = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j][1] = s1.charAt(i) == s2.charAt(j);
}
}
for (len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
for (int j = 0; j <= n - len; j++) {
for (int w = 1; w < len; w++) {
dp[i][j][len] |= dp[i][j][w] && dp[i + w][j + w][len - w];
dp[i][j][len] |= dp[i][j + (len - w)][w] && dp[i + w][j][len - w];
}
}
}
}
return dp[0][0][n];
} | public boolean var_0 ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null ) {
return var_1 == null && var_2 == null ;
}
if ( var_1 . length ( ) != var_2 . length ( ) ) {
return false ;
}
if ( var_1 . equals ( var_2 ) ) {
return true ;
}
int var_3 = var_1 . length ( ) ;
boolean [ ] [ ] [ ] var_4 = new boolean [ var_3 ] [ var_3 ] [ var_3 + 1 ] ;
int var_5 = 1 ;
for ( int var_6 = 0 ;
var_6 < var_3 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 < var_3 ;
var_7 ++ ) {
var_4 [ var_6 ] [ var_7 ] [ 1 ] = var_1 . charAt ( var_6 ) == var_2 . charAt ( var_7 ) ;
}
}
for ( var_5 = 2 ;
var_5 <= var_3 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 <= var_3 - var_5 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 <= var_3 - var_5 ;
var_7 ++ ) {
for ( int var_8 = 1 ;
var_8 < var_5 ;
var_8 ++ ) {
var_4 [ var_6 ] [ var_7 ] [ var_5 ] |= var_4 [ var_6 ] [ var_7 ] [ var_8 ] && var_4 [ var_6 + var_8 ] [ var_7 + var_8 ] [ var_5 - var_8 ] ;
var_4 [ var_6 ] [ var_7 ] [ var_5 ] |= var_4 [ var_6 ] [ var_7 + ( var_5 - var_8 ) ] [ var_8 ] && var_4 [ var_6 + var_8 ] [ var_7 ] [ var_5 - var_8 ] ;
}
}
}
}
return var_4 [ 0 ] [ 0 ] [ var_3 ] ;
}
| 3 | 1<SEP>0<SEP>2 |
644 | <awangdev>Sliding Puzzle_1.java | private void swap(int[] nums, int x, int y, int mX, int mY) {
int oldIndex = x * 3 + y;
int newIndex = mX * 3 + mY;
int temp = nums[oldIndex];
nums[oldIndex] = nums[newIndex];
nums[newIndex] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 , int var_4 , int var_5 ) {
int var_6 = var_2 * 3 + var_3 ;
int var_7 = var_4 * 3 + var_5 ;
int var_8 = var_1 [ var_6 ] ;
var_1 [ var_6 ] = var_1 [ var_7 ] ;
var_1 [ var_7 ] = var_8 ;
}
| 1 | 3 |
645 | <awangdev>246. Strobogrammatic Number_1.java | private HashMap<Character, Character> buildMap() {
HashMap<Character, Character> map = new HashMap<>();
map.put('0','0');
map.put('1','1');
map.put('8','8');
map.put('6','9');
map.put('9','6');
return map;
} | private HashMap < Character , Character > var_0 ( ) {
HashMap < Character , Character > var_1 = new HashMap < > ( ) ;
var_1 . put ( '0' , '0' ) ;
var_1 . put ( '1' , '1' ) ;
var_1 . put ( '8' , '8' ) ;
var_1 . put ( '6' , '9' ) ;
var_1 . put ( '9' , '6' ) ;
return var_1 ;
}
| 5 | <S_QUOTE>9<S_QUOTE><SEP><S_QUOTE>8<S_QUOTE><SEP><S_QUOTE>6<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP><S_QUOTE>1<S_QUOTE> |
646 | <awangdev>58. Length of Last Word_1.java | public int lengthOfLastWord(String s) {
if (s == null || s.length() == 0) {
return 0;
}
s = s.trim();
for (int i = s.length() - 1; i >= 0; i--) {
if (s.charAt(i) == ' ') {
return s.length() - i - 1;
}
}
return s.length();
} | public int sample_funcname ( String var_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
var_0 = var_0 . trim ( ) ;
for ( int var_1 = var_0 . length ( ) - 1 ;
var_1 >= 0 ;
var_1 -- ) {
if ( var_0 . charAt ( var_1 ) == ' ' ) {
return var_0 . length ( ) - var_1 - 1 ;
}
}
return var_0 . length ( ) ;
}
| 3 | 0<SEP><S_QUOTE> <S_QUOTE><SEP>1 |
647 | <awangdev>Word Search II_1.java | private boolean validateInput(char[][] board, String[] words) {
return board == null || board.length == 0 || board[0] == null || board[0].length == 0
|| words == null || words.length == 0;
} | private boolean var_0 ( char [ ] [ ] var_1 , String [ ] var_2 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 || var_2 == null || var_2 . length == 0 ;
}
| 1 | 0 |
648 | <awangdev>Longest Common Substring_3.java | public int longestCommonSubstring(String A, String B) {
if (A == null || B == null || A.length() == 0 || B.length() == 0) {
return 0;
}
int n = A.length();
int max = 0;
for (int i = 0; i < n; i++) {
for(int j = 0; j <= i; j++) {
String subStr = A.substring(j, i + 1);
if (B.contains(subStr)) {
max = Math.max(max, subStr.length());
}
}
}
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 = var_0 . length ( ) ;
int max = 0 ;
for ( int var_3 = 0 ;
var_3 < var_2 ;
var_3 ++ ) {
for ( int var_4 = 0 ;
var_4 <= var_3 ;
var_4 ++ ) {
String var_5 = var_0 . substring ( var_4 , var_3 + 1 ) ;
if ( var_1 . contains ( var_5 ) ) {
max = Math . max ( max , var_5 . length ( ) ) ;
}
}
}
return max ;
}
| 2 | 0<SEP>1 |
649 | <awangdev>Median of two Sorted Arrays_1.java | private int findKth(int[] numsA, int startA, int[] numsB, int startB, int k) {
if (startA >= numsA.length) return numsB[startB + k - 1];
if (startB >= numsB.length) return numsA[startA + k - 1];
if (k == 1) return Math.min(numsA[startA], numsB[startB]);
int halfKthOfA = startA + k / 2 - 1 < numsA.length ? numsA[startA + k / 2 - 1] : Integer.MAX_VALUE;
int halfKthOfB = startB + k / 2 - 1 < numsB.length ? numsB[startB + k / 2 - 1] : Integer.MAX_VALUE;
if (halfKthOfA < halfKthOfB) {
return findKth(numsA, startA + k / 2, numsB, startB, k - k / 2);
} else {
return findKth(numsA, startA, numsB, startB + k / 2, k - k / 2);
}
} | private int sample_funcname ( int [ ] numsA , int startA , int [ ] numsB , int startB , int k ) {
if ( startA >= numsA . length ) return numsB [ startB + k - 1 ] ;
if ( startB >= numsB . length ) return numsA [ startA + k - 1 ] ;
if ( k == 1 ) return Math . min ( numsA [ startA ] , numsB [ startB ] ) ;
int halfKthOfA = startA + k / 2 - 1 < numsA . length ? numsA [ startA + k / 2 - 1 ] : Integer . MAX_VALUE ;
int halfKthOfB = startB + k / 2 - 1 < numsB . length ? numsB [ startB + k / 2 - 1 ] : Integer . MAX_VALUE ;
if ( halfKthOfA < halfKthOfB ) {
return findKth ( numsA , startA + k / 2 , numsB , startB , k - k / 2 ) ;
}
else {
return findKth ( numsA , startA , numsB , startB + k / 2 , k - k / 2 ) ;
}
}
| 2 | 1<SEP>2 |
650 | <awangdev>311. Sparse Matrix Multiplication_2.java | private int multiple(int[][] A, int[][] B, int row, int col) {
int sum = 0;
for (int i = 0; i < B.length; i++) sum += A[row][i] * B[i][col];
return sum;
} | private int sample_funcname ( int [ ] [ ] var_0 , int [ ] [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_1 . length ;
var_5 ++ ) var_4 += var_0 [ var_2 ] [ var_5 ] * var_1 [ var_5 ] [ var_3 ] ;
return var_4 ;
}
| 1 | 0 |
651 | <awangdev>265. Paint House II_4.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, k = costs[0].length;
int[][] dp = new int[2][k];
for (int i = 1; i <= n; i++) {
int minIndex = -1, minSecIndex = -1;
for (int j = 0; j < k; j++) {
if (minIndex == -1 || dp[(i - 1) % 2][j] < dp[(i - 1) % 2][minIndex]) {
minSecIndex = minIndex;
minIndex = j;
} else if (minSecIndex == -1 || dp[(i - 1) % 2][j] < dp[(i - 1) % 2][minSecIndex]) {
minSecIndex = j;
}
}
for (int j = 0; j < k; j++) {
if (j == minIndex) dp[i % 2][j] = dp[(i - 1) % 2][minSecIndex] + costs[i - 1][j];
else dp[i % 2][j] = dp[(i - 1) % 2][minIndex] + costs[i - 1][j];
if (i == n) minCost = Math.min(minCost, dp[i % 2][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 , var_3 = var_0 [ 0 ] . length ;
int [ ] [ ] var_4 = new int [ 2 ] [ var_3 ] ;
for ( int var_5 = 1 ;
var_5 <= var_2 ;
var_5 ++ ) {
int var_6 = - 1 , var_7 = - 1 ;
for ( int var_8 = 0 ;
var_8 < var_3 ;
var_8 ++ ) {
if ( var_6 == - 1 || var_4 [ ( var_5 - 1 ) % 2 ] [ var_8 ] < var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 ] ) {
var_7 = var_6 ;
var_6 = var_8 ;
}
else if ( var_7 == - 1 || var_4 [ ( var_5 - 1 ) % 2 ] [ var_8 ] < var_4 [ ( var_5 - 1 ) % 2 ] [ var_7 ] ) {
var_7 = var_8 ;
}
}
for ( int var_8 = 0 ;
var_8 < var_3 ;
var_8 ++ ) {
if ( var_8 == var_6 ) var_4 [ var_5 % 2 ] [ var_8 ] = var_4 [ ( var_5 - 1 ) % 2 ] [ var_7 ] + var_0 [ var_5 - 1 ] [ var_8 ] ;
else var_4 [ var_5 % 2 ] [ var_8 ] = var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 ] + var_0 [ var_5 - 1 ] [ var_8 ] ;
if ( var_5 == var_2 ) var_1 = Math . min ( var_1 , var_4 [ var_5 % 2 ] [ var_8 ] ) ;
}
}
return var_1 ;
}
| 3 | 2<SEP>0<SEP>1 |
652 | <awangdev>Minimum Swaps To Make Sequences Increasing_1.java | public int minSwap(int[] A, int[] B) {
if (A.length != B.length) return 0;
int n = A.length;
int[][] dp = new int[n][2];
dp[0][0] = 0;
dp[0][1] = 1;
for (int i = 1; i < n; i++) {
dp[i][0] = dp[i][1] = Integer.MAX_VALUE;
if (A[i] > A[i - 1] && B[i] > B[i - 1]) {
dp[i][0] = dp[i - 1][0];
dp[i][1] = dp[i - 1][1] + 1;
}
if (A[i] > B[i - 1] && B[i] > A[i - 1]) {
dp[i][0] = Math.min(dp[i][0], dp[i - 1][1]);
dp[i][1] = Math.min(dp[i][1], dp[i - 1][0] + 1);
}
}
return Math.min(dp[n-1][0], dp[n-1][1]);
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
if ( var_0 . length != var_1 . length ) return 0 ;
int var_2 = var_0 . length ;
int [ ] [ ] var_3 = new int [ var_2 ] [ 2 ] ;
var_3 [ 0 ] [ 0 ] = 0 ;
var_3 [ 0 ] [ 1 ] = 1 ;
for ( int var_4 = 1 ;
var_4 < var_2 ;
var_4 ++ ) {
var_3 [ var_4 ] [ 0 ] = var_3 [ var_4 ] [ 1 ] = Integer . MAX_VALUE ;
if ( var_0 [ var_4 ] > var_0 [ var_4 - 1 ] && var_1 [ var_4 ] > var_1 [ var_4 - 1 ] ) {
var_3 [ var_4 ] [ 0 ] = var_3 [ var_4 - 1 ] [ 0 ] ;
var_3 [ var_4 ] [ 1 ] = var_3 [ var_4 - 1 ] [ 1 ] + 1 ;
}
if ( var_0 [ var_4 ] > var_1 [ var_4 - 1 ] && var_1 [ var_4 ] > var_0 [ var_4 - 1 ] ) {
var_3 [ var_4 ] [ 0 ] = Math . min ( var_3 [ var_4 ] [ 0 ] , var_3 [ var_4 - 1 ] [ 1 ] ) ;
var_3 [ var_4 ] [ 1 ] = Math . min ( var_3 [ var_4 ] [ 1 ] , var_3 [ var_4 - 1 ] [ 0 ] + 1 ) ;
}
}
return Math . min ( var_3 [ var_2 - 1 ] [ 0 ] , var_3 [ var_2 - 1 ] [ 1 ] ) ;
}
| 3 | 0<SEP>1<SEP>2 |
653 | <awangdev>134. Gas Station_1.java | public int canCompleteCircuit(int[] gas, int[] cost) {
if (gas == null || cost == null || gas.length == 0 || cost.length == 0) {
return -1;
}
int startIndex = 0, remain = 0, total = 0;
for (int i = 0; i < gas.length; i++) {
total += gas[i] - cost[i];
remain += gas[i] - cost[i];
if (remain < 0) {
remain = 0;
startIndex = i + 1;
}
}
return total < 0 ? -1 : startIndex;
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
if ( var_0 == null || var_1 == null || var_0 . length == 0 || var_1 . length == 0 ) {
return - 1 ;
}
int var_2 = 0 , var_3 = 0 , var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
var_4 += var_0 [ var_5 ] - var_1 [ var_5 ] ;
var_3 += var_0 [ var_5 ] - var_1 [ var_5 ] ;
if ( var_3 < 0 ) {
var_3 = 0 ;
var_2 = var_5 + 1 ;
}
}
return var_4 < 0 ? - 1 : var_2 ;
}
| 2 | 0<SEP>1 |
654 | <awangdev>311. Sparse Matrix Multiplication_3.java | private boolean validate(int[][] A, int[][] B) {
if (A == null || B == null) return true;
if (A[0].length != B.length) return true;
return false;
} | private boolean var_0 ( int [ ] [ ] var_1 , int [ ] [ ] var_2 ) {
if ( var_1 == null || var_2 == null ) return true ;
if ( var_1 [ 0 ] . length != var_2 . length ) return true ;
return false ;
}
| 1 | 0 |
655 | <awangdev>350. Intersection of Two Arrays II_1.java | private Map<Integer, Integer> buildCountMap(int[] nums) {
Map<Integer, Integer> map = new HashMap<>();
for (int num : nums) {
map.putIfAbsent(num, 0);
map.put(num, map.get(num) + 1);
}
return map;
} | private Map < Integer , Integer > var_0 ( int [ ] var_1 ) {
Map < Integer , Integer > var_2 = new HashMap < > ( ) ;
for ( int var_3 : var_1 ) {
var_2 . putIfAbsent ( var_3 , 0 ) ;
var_2 . put ( var_3 , var_2 . get ( var_3 ) + 1 ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
656 | <awangdev>621. Task Scheduler_2.java | public int leastInterval(char[] tasks, int n) {
if (tasks == null) return 0;
int[] count = new int[26];
for (char c : tasks) count[c - 'A']++;
Arrays.sort(count);
int max = count[25], i = 25;
while (i >= 0 && count[i] == max) i--;
int countRepeatedTopTask = 25 - i;
return Math.max(tasks.length, (max - 1) * (n + 1) + countRepeatedTopTask);
} | public int sample_funcname ( char [ ] var_0 , int var_1 ) {
if ( var_0 == null ) return 0 ;
int [ ] var_2 = new int [ 26 ] ;
for ( char var_3 : var_0 ) var_2 [ var_3 - 'A' ] ++ ;
Arrays . sort ( var_2 ) ;
int max = var_2 [ 25 ] , var_4 = 25 ;
while ( var_4 >= 0 && var_2 [ var_4 ] == max ) var_4 -- ;
int var_5 = 25 - var_4 ;
return Math . max ( var_0 . length , ( max - 1 ) * ( var_1 + 1 ) + var_5 ) ;
}
| 5 | 25<SEP>0<SEP>1<SEP><S_QUOTE>A<S_QUOTE><SEP>26 |
657 | <awangdev>64. Minimum Path Sum_1.java | public int minPathSum(int[][] grid) {
if (grid == null || grid.length == 0 || grid[0] == null || grid[0].length == 0) return 0;
int m = grid.length, n = grid[0].length;
int[][] dp = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = grid[i][j];
if (i == 0 && j == 0) continue;
int fromUp = i == 0 ? Integer.MAX_VALUE : dp[i - 1][j];
int fromLeft = j == 0 ? Integer.MAX_VALUE : dp[i][j - 1];
dp[i][j] += Math.min(fromUp, fromLeft);
}
}
return dp[m - 1][n - 1];
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) return 0 ;
int var_1 = var_0 . length , var_2 = var_0 [ 0 ] . length ;
int [ ] [ ] var_3 = new int [ var_1 ] [ var_2 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_2 ;
var_5 ++ ) {
var_3 [ var_4 ] [ var_5 ] = var_0 [ var_4 ] [ var_5 ] ;
if ( var_4 == 0 && var_5 == 0 ) continue ;
int var_6 = var_4 == 0 ? Integer . MAX_VALUE : var_3 [ var_4 - 1 ] [ var_5 ] ;
int var_7 = var_5 == 0 ? Integer . MAX_VALUE : var_3 [ var_4 ] [ var_5 - 1 ] ;
var_3 [ var_4 ] [ var_5 ] += Math . min ( var_6 , var_7 ) ;
}
}
return var_3 [ var_1 - 1 ] [ var_2 - 1 ] ;
}
| 2 | 0<SEP>1 |
658 | <awangdev>361. Bomb Enemy_2.java | public int maxKilledEnemies(char[][] grid) {
if (grid == null || grid.length == 0 || grid[0].length == 0) return 0;
int m = grid.length, n = grid[0].length;
int[] colSum = new int[n];
int max = 0;
int row = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (j == 0 || grid[i][j - 1] == 'W') {
row = 0;
for (int k = j; k < n && grid[i][k] != 'W'; k++) {
row += grid[i][k] == 'E' ? 1 : 0;
}
}
if (i == 0 || grid[i - 1][j] == 'W') {
colSum[j] = 0;
for (int k = i; k < m && grid[k][j] != 'W'; k++) {
colSum[j] += grid[k][j] == 'E' ? 1 : 0;
}
}
if (grid[i][j] == '0') max = Math.max(max, colSum[j] + row);
}
}
return max;
} | public int sample_funcname ( char [ ] [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] . length == 0 ) return 0 ;
int var_1 = var_0 . length , var_2 = var_0 [ 0 ] . length ;
int [ ] var_3 = new int [ var_2 ] ;
int max = 0 ;
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_1 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 < var_2 ;
var_6 ++ ) {
if ( var_6 == 0 || var_0 [ var_5 ] [ var_6 - 1 ] == 'W' ) {
var_4 = 0 ;
for ( int var_7 = var_6 ;
var_7 < var_2 && var_0 [ var_5 ] [ var_7 ] != 'W' ;
var_7 ++ ) {
var_4 += var_0 [ var_5 ] [ var_7 ] == 'E' ? 1 : 0 ;
}
}
if ( var_5 == 0 || var_0 [ var_5 - 1 ] [ var_6 ] == 'W' ) {
var_3 [ var_6 ] = 0 ;
for ( int var_7 = var_5 ;
var_7 < var_1 && var_0 [ var_7 ] [ var_6 ] != 'W' ;
var_7 ++ ) {
var_3 [ var_6 ] += var_0 [ var_7 ] [ var_6 ] == 'E' ? 1 : 0 ;
}
}
if ( var_0 [ var_5 ] [ var_6 ] == '0' ) max = Math . max ( max , var_3 [ var_6 ] + var_4 ) ;
}
}
return max ;
}
| 5 | 0<SEP>1<SEP><S_QUOTE>E<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP><S_QUOTE>W<S_QUOTE> |
659 | <awangdev>518. Coin Change 2_1.java | public int change(int amount, int[] coins) {
if (amount == 0) return 1;
int[] dp = new int[amount + 1];
dp[0] = 1;
for (int coin : coins) {
for (int i = coin; i <= amount; i++) {
dp[i] += dp[i - coin];
}
}
return dp[amount];
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_0 == 0 ) return 1 ;
int [ ] var_2 = new int [ var_0 + 1 ] ;
var_2 [ 0 ] = 1 ;
for ( int var_3 : var_1 ) {
for ( int var_4 = var_3 ;
var_4 <= var_0 ;
var_4 ++ ) {
var_2 [ var_4 ] += var_2 [ var_4 - var_3 ] ;
}
}
return var_2 [ var_0 ] ;
}
| 2 | 0<SEP>1 |
660 | <awangdev>Longest Common Substring_2.java | public int longestCommonSubstring(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 max = 0;
for (int i = 0; i <= m; i++) {
for(int j = 0; j <= n; j++) {
if (i == 0 || j == 0) {
dp[i % 2][j] = 0;
continue;
}
if (A.charAt(i - 1) == B.charAt(j - 1)) {
dp[i % 2][j] = dp[(i - 1) % 2][j - 1] + 1;
} else {
dp[i % 2][j] = 0;
}
max = Math.max(max, dp[i % 2][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 = var_0 . length ( ) ;
int var_3 = var_1 . length ( ) ;
int [ ] [ ] var_4 = new int [ 2 ] [ var_3 + 1 ] ;
int max = 0 ;
for ( int var_5 = 0 ;
var_5 <= var_2 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 <= var_3 ;
var_6 ++ ) {
if ( var_5 == 0 || var_6 == 0 ) {
var_4 [ var_5 % 2 ] [ var_6 ] = 0 ;
continue ;
}
if ( var_0 . charAt ( var_5 - 1 ) == var_1 . charAt ( var_6 - 1 ) ) {
var_4 [ var_5 % 2 ] [ var_6 ] = var_4 [ ( var_5 - 1 ) % 2 ] [ var_6 - 1 ] + 1 ;
}
else {
var_4 [ var_5 % 2 ] [ var_6 ] = 0 ;
}
max = Math . max ( max , var_4 [ var_5 % 2 ] [ var_6 ] ) ;
}
}
return max ;
}
| 3 | 0<SEP>1<SEP>2 |
661 | <awangdev>Power of Two_1.java | public boolean isPowerOfTwo(int n) {
if (n <= 0) {
return false;
}
while (n != 1) {
if (n % 2 != 0 || n / 2 == 0) {
return false;
}
n/=2;
}
return true;
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
while ( var_1 != 1 ) {
if ( var_1 % 2 != 0 || var_1 / 2 == 0 ) {
return false ;
}
var_1 /= 2 ;
}
return true ;
}
| 3 | 2<SEP>0<SEP>1 |
662 | <awangdev>Backpack_1.java | public int backPack(int m, int[] A) {
if (A == null || A.length < 0) {
return 0;
}
int n = A.length;
int[][] dp = new int[n + 1][m + 1];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
dp[i][j] = dp[i - 1][j];
if (j - A[i - 1] >= 0) {
dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - A[i - 1]] + A[i - 1]);
}
}
}
return dp[n][m];
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length < 0 ) {
return 0 ;
}
int var_2 = var_1 . length ;
int [ ] [ ] var_3 = new int [ var_2 + 1 ] [ var_0 + 1 ] ;
for ( int var_4 = 1 ;
var_4 <= var_2 ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 <= var_0 ;
var_5 ++ ) {
var_3 [ var_4 ] [ var_5 ] = var_3 [ var_4 - 1 ] [ var_5 ] ;
if ( var_5 - var_1 [ var_4 - 1 ] >= 0 ) {
var_3 [ var_4 ] [ var_5 ] = Math . max ( var_3 [ var_4 ] [ var_5 ] , var_3 [ var_4 - 1 ] [ var_5 - var_1 [ var_4 - 1 ] ] + var_1 [ var_4 - 1 ] ) ;
}
}
}
return var_3 [ var_2 ] [ var_0 ] ;
}
| 2 | 0<SEP>1 |
663 | <awangdev>850. Rectangle Area II_1.java | private int calcHeightDiff(TreeMap<Integer, Integer> map) {
int height = 0, pre = 0, count = 0;
for (Map.Entry<Integer, Integer> e : map.entrySet()) {
if (count > 0) height += e.getKey() - pre;
count += e.getValue();
pre = e.getKey();
}
return height;
} | private int sample_funcname ( TreeMap < Integer , Integer > var_0 ) {
int var_1 = 0 , var_2 = 0 , var_3 = 0 ;
for ( Map . Entry < Integer , Integer > var_4 : var_0 . entrySet ( ) ) {
if ( var_3 > 0 ) var_1 += var_4 . getKey ( ) - var_2 ;
var_3 += var_4 . getValue ( ) ;
var_2 = var_4 . getKey ( ) ;
}
return var_1 ;
}
| 1 | 0 |
664 | <awangdev>Find Minimum in Rotated Sorted Array II_2.java | public int findMin(int[] num) {
if (num == null || num.length == 0) {
return -1;
}
int min = Integer.MAX_VALUE;
for (int i = 0; i < num.length; i++) {
if (min > num[i]) {
min = num[i];
}
}
return min;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_1 = Integer . MAX_VALUE ;
for ( int var_2 = 0 ;
var_2 < var_0 . length ;
var_2 ++ ) {
if ( var_1 > var_0 [ var_2 ] ) {
var_1 = var_0 [ var_2 ] ;
}
}
return var_1 ;
}
| 2 | 0<SEP>1 |
665 | <awangdev>Gray Code_1.java | public void helper(List<Integer> rst, char[] list, int index) {
rst.add(Integer.parseInt(new String(list), 2));
list[index] = list[index] == '0' ? '1' : '0';
int num = Integer.parseInt(new String(list), 2);
if (!rst.contains(num)) {
helper(rst, list, index);
}
list[index] = list[index] == '0' ? '1' : '0';
if (index -1 >= 0) {
list[index - 1] = list[index - 1] == '0' ? '1' : '0';
num = Integer.parseInt(new String(list), 2);
if (!rst.contains(num)) {
helper(rst, list, index - 1);
}
list[index - 1] = list[index - 1] == '0' ? '1' : '0';
}
if (index + 1 < list.length) {
list[index + 1] = list[index + 1] == '0' ? '1' : '0';
num = Integer.parseInt(new String(list), 2);
if (!rst.contains(num)) {
helper(rst, list, index + 1);
}
list[index + 1] = list[index + 1] == '0' ? '1' : '0';
}
} | public void sample_funcname ( List < Integer > rst , char [ ] list , int index ) {
rst . add ( Integer . parseInt ( new String ( list ) , 2 ) ) ;
list [ index ] = list [ index ] == '0' ? '1' : '0' ;
int num = Integer . parseInt ( new String ( list ) , 2 ) ;
if ( ! rst . contains ( num ) ) {
helper ( rst , list , index ) ;
}
list [ index ] = list [ index ] == '0' ? '1' : '0' ;
if ( index - 1 >= 0 ) {
list [ index - 1 ] = list [ index - 1 ] == '0' ? '1' : '0' ;
num = Integer . parseInt ( new String ( list ) , 2 ) ;
if ( ! rst . contains ( num ) ) {
helper ( rst , list , index - 1 ) ;
}
list [ index - 1 ] = list [ index - 1 ] == '0' ? '1' : '0' ;
}
if ( index + 1 < list . length ) {
list [ index + 1 ] = list [ index + 1 ] == '0' ? '1' : '0' ;
num = Integer . parseInt ( new String ( list ) , 2 ) ;
if ( ! rst . contains ( num ) ) {
helper ( rst , list , index + 1 ) ;
}
list [ index + 1 ] = list [ index + 1 ] == '0' ? '1' : '0' ;
}
}
| 5 | 2<SEP>0<SEP>1<SEP><S_QUOTE>0<S_QUOTE><SEP><S_QUOTE>1<S_QUOTE> |
666 | <awangdev>80.Remove Duplicates from Sorted Array II_1.java | public int removeDuplicates(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int index = 1;
for (int i = 2; i < nums.length; i++) {
if (nums[i] != nums[index] || (nums[i] == nums[index] && nums[i] != nums[index - 1])) {
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 = 1 ;
for ( int var_2 = 2 ;
var_2 < var_0 . length ;
var_2 ++ ) {
if ( var_0 [ var_2 ] != var_0 [ var_1 ] || ( var_0 [ var_2 ] == var_0 [ var_1 ] && var_0 [ var_2 ] != var_0 [ var_1 - 1 ] ) ) {
var_0 [ ++ var_1 ] = var_0 [ var_2 ] ;
}
}
return var_1 + 1 ;
}
| 3 | 2<SEP>0<SEP>1 |
667 | <awangdev>Kth Largest Element in an Array_1.java | public int findKthLargest(int[] nums, int k) {
if (nums == null || nums.length == 0) return -1;
PriorityQueue<Integer> queue = new PriorityQueue<>();
for (int i = 0; i < nums.length; i++) {
if (i < k || nums[i] > queue.peek()) queue.offer(nums[i]);
if (queue.size() > k) queue.poll();
}
return queue.poll();
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) return - 1 ;
PriorityQueue < Integer > var_2 = new PriorityQueue < > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
if ( var_3 < var_1 || var_0 [ var_3 ] > var_2 . peek ( ) ) var_2 . offer ( var_0 [ var_3 ] ) ;
if ( var_2 . size ( ) > var_1 ) var_2 . poll ( ) ;
}
return var_2 . poll ( ) ;
}
| 2 | 0<SEP>1 |
668 | <awangdev>Encode and Decode Strings_2.java | public List<String> decode(String s) {
List<String> strs = new ArrayList<>();
if (s == null || s.length() == 0) {
return strs;
}
int start = 0;
while (start < s.length()) {
int ind = s.indexOf("#", start);
int leng = Integer.parseInt(s.substring(start, ind));
int end = ind + 1 + leng;
strs.add(s.substring(ind + 1, end));
start = end;
}
return strs;
} | public List < String > var_0 ( String var_1 ) {
List < String > var_2 = new ArrayList < > ( ) ;
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return var_2 ;
}
int var_3 = 0 ;
while ( var_3 < var_1 . length ( ) ) {
int var_4 = var_1 . indexOf ( "#" , var_3 ) ;
int var_5 = Integer . parseInt ( var_1 . substring ( var_3 , var_4 ) ) ;
int var_6 = var_4 + 1 + var_5 ;
var_2 . add ( var_1 . substring ( var_4 + 1 , var_6 ) ) ;
var_3 = var_6 ;
}
return var_2 ;
}
| 3 | 0<SEP><D_QUOTE>#<D_QUOTE><SEP>1 |
669 | <awangdev>698. Partition to K Equal Sum Subsets_1.java | private boolean dfs(Queue<Integer> queue, int size, int k, int sum, int target) {
if (k == 0) return true;
if (sum == target) return dfs(queue, queue.size(), k - 1, 0, target);
while (size-- > 0) {
int num = queue.poll();
if (sum + num <= target && dfs(queue, size+1, k, sum + num, target)) return true;
queue.offer(num);
}
return false;
} | private boolean sample_funcname ( Queue < Integer > queue , int size , int k , int sum , int target ) {
if ( k == 0 ) return true ;
if ( sum == target ) return dfs ( queue , queue . size ( ) , k - 1 , 0 , target ) ;
while ( size -- > 0 ) {
int num = queue . poll ( ) ;
if ( sum + num <= target && dfs ( queue , size + 1 , k , sum + num , target ) ) return true ;
queue . offer ( num ) ;
}
return false ;
}
| 2 | 0<SEP>1 |
670 | <awangdev>105. Construct Binary Tree from Preorder and Inorder Traversal_2.java | private Map<Integer, Integer> buildMap(int[] inorder) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < inorder.length; i++) map.put(inorder[i], i);
return map;
} | private Map < Integer , Integer > var_0 ( int [ ] var_1 ) {
Map < Integer , Integer > var_2 = new HashMap < > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) var_2 . put ( var_1 [ var_3 ] , var_3 ) ;
return var_2 ;
}
| 1 | 0 |
671 | <awangdev>[lint]. Unique Characters_2.java | public boolean isUnique(String str) {
if (str == null || str.length() == 0) {
return true;
}
HashSet<Character> set = new HashSet<Character>();
for (int i = 0; i < str.length(); i++) {
if (!set.contains(str.charAt(i))) {
set.add(str.charAt(i));
} else {
return false;
}
}
return true;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return true ;
}
HashSet < Character > var_2 = new HashSet < Character > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . length ( ) ;
var_3 ++ ) {
if ( ! var_2 . contains ( var_1 . charAt ( var_3 ) ) ) {
var_2 . add ( var_1 . charAt ( var_3 ) ) ;
}
else {
return false ;
}
}
return true ;
}
| 1 | 0 |
672 | <awangdev>207. Course Schedule_3.java | private List[] buildIndegreeEdges(int numCourses, int[][] prerequisites) {
List[] edges = new ArrayList[numCourses];
for (int i = 0; i < numCourses; i++) edges[i] = new ArrayList<>();
for (int[] prerequisite : prerequisites) {
edges[prerequisite[1]].add(prerequisite[0]);
}
return edges;
} | private List [ ] var_0 ( int var_1 , int [ ] [ ] var_2 ) {
List [ ] var_3 = new ArrayList [ var_1 ] ;
for ( int var_4 = 0 ;
var_4 < var_1 ;
var_4 ++ ) var_3 [ var_4 ] = new ArrayList < > ( ) ;
for ( int [ ] var_5 : var_2 ) {
var_3 [ var_5 [ 1 ] ] . add ( var_5 [ 0 ] ) ;
}
return var_3 ;
}
| 2 | 0<SEP>1 |
673 | <awangdev>Unique Binary Search Tree_1.java | public int numTrees(int n) {
if ( n <= 1) {
return 1;
}
final int[] numTree = new int[n + 1];
numTree[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < i; j++) {
numTree[i] += numTree[j] * numTree[i - j - 1];
}
}
return numTree[n];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
final int [ ] var_1 = new int [ var_0 + 1 ] ;
var_1 [ 0 ] = 1 ;
for ( int var_2 = 1 ;
var_2 <= var_0 ;
var_2 ++ ) {
for ( int var_3 = 0 ;
var_3 < var_2 ;
var_3 ++ ) {
var_1 [ var_2 ] += var_1 [ var_3 ] * var_1 [ var_2 - var_3 - 1 ] ;
}
}
return var_1 [ var_0 ] ;
}
| 2 | 1<SEP>0 |
674 | <awangdev>139. Word Break_1.java | public boolean wordBreak(String s, List<String> dict) {
Set<String> words = new HashSet<>(dict);
int n = s.length();
boolean[] dp = new boolean[n + 1];
dp[0] = true;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < i; j++) {
dp[i] |= dp[j] && words.contains(s.substring(j, i));
if (dp[i]) break;
}
}
return dp[n];
} | public boolean var_0 ( String var_1 , List < String > var_2 ) {
Set < String > var_3 = new HashSet < > ( var_2 ) ;
int var_4 = var_1 . length ( ) ;
boolean [ ] var_5 = new boolean [ var_4 + 1 ] ;
var_5 [ 0 ] = true ;
for ( int var_6 = 1 ;
var_6 <= var_4 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 < var_6 ;
var_7 ++ ) {
var_5 [ var_6 ] |= var_5 [ var_7 ] && var_3 . contains ( var_1 . substring ( var_7 , var_6 ) ) ;
if ( var_5 [ var_6 ] ) break ;
}
}
return var_5 [ var_4 ] ;
}
| 2 | 1<SEP>0 |
675 | <awangdev>Add Digits_2.java | public int addDigits(int num) {
return (num - 1) % 9 + 1;
} | public int sample_funcname ( int var_0 ) {
return ( var_0 - 1 ) % 9 + 1 ;
}
| 2 | 1<SEP>9 |
676 | <awangdev>Majority Number II_1.java | public int majorityNumber(List<Integer> nums) {
if (nums == null || nums.size() == 0) {
return -1;
}
int valA = 0;
int valB = 0;
int countA = 0;
int countB = 0;
for (int num : nums) {
if (num == valA) {
countA++;
} else if (num == valB) {
countB++;
} else if (countA == 0) {
valA = num;
countA++;
} else if (countB == 0){
valB = num;
countB++;
} else {
countA--;
countB--;
}
}
countA = 0;
countB = 0;
for (int num : nums) {
if (num == valA) {
countA++;
} else if (num == valB) {
countB++;
}
}
return countA > countB ? valA : valB;
} | public int sample_funcname ( List < Integer > var_0 ) {
if ( var_0 == null || var_0 . size ( ) == 0 ) {
return - 1 ;
}
int var_1 = 0 ;
int var_2 = 0 ;
int var_3 = 0 ;
int var_4 = 0 ;
for ( int var_5 : var_0 ) {
if ( var_5 == var_1 ) {
var_3 ++ ;
}
else if ( var_5 == var_2 ) {
var_4 ++ ;
}
else if ( var_3 == 0 ) {
var_1 = var_5 ;
var_3 ++ ;
}
else if ( var_4 == 0 ) {
var_2 = var_5 ;
var_4 ++ ;
}
else {
var_3 -- ;
var_4 -- ;
}
}
var_3 = 0 ;
var_4 = 0 ;
for ( int var_5 : var_0 ) {
if ( var_5 == var_1 ) {
var_3 ++ ;
}
else if ( var_5 == var_2 ) {
var_4 ++ ;
}
}
return var_3 > var_4 ? var_1 : var_2 ;
}
| 2 | 0<SEP>1 |
677 | <awangdev>Basic Calculator_2.java | private boolean isDigit(char c) {
return c >= '0' && c <= '9';
} | private boolean var_0 ( char var_1 ) {
return var_1 >= '0' && var_1 <= '9' ;
}
| 2 | <S_QUOTE>9<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE> |
678 | <awangdev>727. Minimum Window Subsequence_2.java | public String minWindow(String s, String t) {
int sIndex = 0, tIndex = 0, start = -1;
int m = s.length(), n = t.length(), minLength = m;
char[] ss = s.toCharArray(), tt = t.toCharArray();
while (sIndex < m) {
if(ss[sIndex] == tt[tIndex]) {
if(tIndex++ == n - 1) {
int end = sIndex + 1;
while(tIndex-- > 0) {
while(ss[sIndex--] != tt[tIndex]);
}
sIndex++;
tIndex++;
if (end - sIndex < minLength) {
minLength = end - sIndex;
start = sIndex;
}
}
}
sIndex++;
}
return start == -1 ? "" : s.substring(start, start + minLength);
} | public String var_0 ( String var_1 , String var_2 ) {
int var_3 = 0 , var_4 = 0 , var_5 = - 1 ;
int var_6 = var_1 . length ( ) , var_7 = var_2 . length ( ) , var_8 = var_6 ;
char [ ] var_9 = var_1 . toCharArray ( ) , var_10 = var_2 . toCharArray ( ) ;
while ( var_3 < var_6 ) {
if ( var_9 [ var_3 ] == var_10 [ var_4 ] ) {
if ( var_4 ++ == var_7 - 1 ) {
int var_11 = var_3 + 1 ;
while ( var_4 -- > 0 ) {
while ( var_9 [ var_3 -- ] != var_10 [ var_4 ] ) ;
}
var_3 ++ ;
var_4 ++ ;
if ( var_11 - var_3 < var_8 ) {
var_8 = var_11 - var_3 ;
var_5 = var_3 ;
}
}
}
var_3 ++ ;
}
return var_5 == - 1 ? "" : var_1 . substring ( var_5 , var_5 + var_8 ) ;
}
| 3 | 0<SEP><D_QUOTE><D_QUOTE><SEP>1 |
679 | <awangdev>Best Time to Buy and Sell Stock III_3.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int[] leftProfit = new int[prices.length];
int[] rightProfit = new int[prices.length];
int min = prices[0];
for (int i = 1; i < prices.length; i++) {
min = Math.min(min, prices[i]);
leftProfit[i] = Math.max(leftProfit[i - 1], prices[i] - min);
}
int max = prices[prices.length - 1];
for (int i = prices.length - 2; i >= 0; i--) {
max = Math.max(max, prices[i]);
rightProfit[i] = Math.max(rightProfit[i + 1], max - prices[i]);
}
int profit = 0;
for (int i = 0; i < prices.length; i++) {
profit = Math.max(profit, leftProfit[i] + rightProfit[i]);
}
return profit;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int [ ] var_1 = new int [ var_0 . length ] ;
int [ ] var_2 = new int [ var_0 . length ] ;
int min = var_0 [ 0 ] ;
for ( int var_3 = 1 ;
var_3 < var_0 . length ;
var_3 ++ ) {
min = Math . min ( min , var_0 [ var_3 ] ) ;
var_1 [ var_3 ] = Math . max ( var_1 [ var_3 - 1 ] , var_0 [ var_3 ] - min ) ;
}
int max = var_0 [ var_0 . length - 1 ] ;
for ( int var_3 = var_0 . length - 2 ;
var_3 >= 0 ;
var_3 -- ) {
max = Math . max ( max , var_0 [ var_3 ] ) ;
var_2 [ var_3 ] = Math . max ( var_2 [ var_3 + 1 ] , max - var_0 [ var_3 ] ) ;
}
int var_4 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
var_4 = Math . max ( var_4 , var_1 [ var_3 ] + var_2 [ var_3 ] ) ;
}
return var_4 ;
}
| 3 | 2<SEP>0<SEP>1 |
680 | <awangdev>Restore IP Addresses_1.java | public boolean isValid(String str) {
if (str.charAt(0) == '0') {
return str.equals("0");
}
int num = Integer.parseInt(str);
return num <= 255 && num >= 0;
} | public boolean var_0 ( String var_1 ) {
if ( var_1 . charAt ( 0 ) == '0' ) {
return var_1 . equals ( "0" ) ;
}
int var_2 = Integer . parseInt ( var_1 ) ;
return var_2 <= 255 && var_2 >= 0 ;
}
| 4 | <D_QUOTE>0<D_QUOTE><SEP>0<SEP>255<SEP><S_QUOTE>0<S_QUOTE> |
681 | <awangdev>Walls and Gates_6.java | private boolean validate(int[][] rooms) {
return rooms == null || rooms.length == 0 || rooms[0] == null || rooms[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
| 1 | 0 |
682 | <awangdev>[lint]. Longest Words_1.java | public List<String> longestWords(String[] dictionary) {
if (dictionary == null || dictionary.length == 0) {
return null;
}
Map<Integer, List<String>> map = new HashMap<>();
int max = 0;
for (String word : dictionary) {
int length = word.length();
map.putIfAbsent(length, new ArrayList<>());
map.get(length).add(word);
max = Math.max(max, length);
}
return map.get(max);
} | public List < String > var_0 ( String [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return null ;
}
Map < Integer , List < String >> var_2 = new HashMap < > ( ) ;
int max = 0 ;
for ( String var_3 : var_1 ) {
int length = var_3 . length ( ) ;
var_2 . putIfAbsent ( length , new ArrayList < > ( ) ) ;
var_2 . get ( length ) . add ( var_3 ) ;
max = Math . max ( max , length ) ;
}
return var_2 . get ( max ) ;
}
| 1 | 0 |
683 | <awangdev>1021. Remove Outermost Parentheses_2.java | public String removeOuterParentheses(String S) {
StringBuilder s = new StringBuilder();
int count = 0;
for (char c : S.toCharArray()) {
if (c == '(' && count++ > 0) s.append(c);
if (c == ')' && count-- > 1) s.append(c);
}
return s.toString();
} | public String var_0 ( String var_1 ) {
StringBuilder var_2 = new StringBuilder ( ) ;
int var_3 = 0 ;
for ( char var_4 : var_1 . toCharArray ( ) ) {
if ( var_4 == '(' && var_3 ++ > 0 ) var_2 . append ( var_4 ) ;
if ( var_4 == ')' && var_3 -- > 1 ) var_2 . append ( var_4 ) ;
}
return var_2 . toString ( ) ;
}
| 4 | 0<SEP><S_QUOTE>)<S_QUOTE><SEP><S_QUOTE>(<S_QUOTE><SEP>1 |
684 | <awangdev>739. Daily Temperatures_1.java | public int[] dailyTemperatures(int[] T) {
int n = T.length;
int[] rst = new int[n];
Stack<Integer> stack = new Stack<>();
for (int i = n - 1; i >= 0; i--) {
int num = T[i];
while (!stack.isEmpty() && num >= T[stack.peek()]) stack.pop();
if (!stack.isEmpty() && num < T[stack.peek()]) rst[i] = stack.peek() - i;
else rst[i] = 0;
stack.push(i);
}
return rst;
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
int var_1 = var_0 . length ;
int [ ] var_2 = new int [ var_1 ] ;
Stack < Integer > var_3 = new Stack < > ( ) ;
for ( int var_4 = var_1 - 1 ;
var_4 >= 0 ;
var_4 -- ) {
int var_5 = var_0 [ var_4 ] ;
while ( ! var_3 . isEmpty ( ) && var_5 >= var_0 [ var_3 . peek ( ) ] ) var_3 . pop ( ) ;
if ( ! var_3 . isEmpty ( ) && var_5 < var_0 [ var_3 . peek ( ) ] ) var_2 [ var_4 ] = var_3 . peek ( ) - var_4 ;
else var_2 [ var_4 ] = 0 ;
var_3 . push ( var_4 ) ;
}
return var_2 ;
}
| 2 | 1<SEP>0 |
685 | <awangdev>Convert Expression to Reverse Polish Notation_1.java | public int getWeight(int base, String s) {
if (s.equals("+") || s.equals("-")) {
return base + 1;
}
if (s.equals("*") || s.equals("/")) {
return base + 2;
}
return Integer.MAX_VALUE;
} | public int sample_funcname ( int var_0 , String var_1 ) {
if ( var_1 . equals ( "+" ) || var_1 . equals ( "-" ) ) {
return var_0 + 1 ;
}
if ( var_1 . equals ( "*" ) || var_1 . equals ( "/" ) ) {
return var_0 + 2 ;
}
return Integer . MAX_VALUE ;
}
| 6 | <D_QUOTE>-<D_QUOTE><SEP>2<SEP><D_QUOTE>/<D_QUOTE><SEP>1<SEP><D_QUOTE>+<D_QUOTE><SEP><D_QUOTE>*<D_QUOTE> |
687 | <awangdev>Search Insert Position_2.java | public int searchInsert(ArrayList<Integer> A, int target) {
int start = 0;
int end = A.size() - 1;
int mid;
if (A == null || A.size() == 0 || target <= A.get(0)) {
return 0;
}
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (A.get(mid) == target) {
return mid;
} else if (A.get(mid) < target) {
start = mid;
} else {
end = mid;
}
}
if (A.get(end) == target) {
return end;
}
if (A.get(end) < target) {
return end + 1;
}
if (A.get(start) == target) {
return start;
}
return start + 1;
} | public int sample_funcname ( ArrayList < Integer > var_0 , int var_1 ) {
int var_2 = 0 ;
int var_3 = var_0 . size ( ) - 1 ;
int var_4 ;
if ( var_0 == null || var_0 . size ( ) == 0 || var_1 <= var_0 . get ( 0 ) ) {
return 0 ;
}
while ( var_2 + 1 < var_3 ) {
var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
if ( var_0 . get ( var_4 ) == var_1 ) {
return var_4 ;
}
else if ( var_0 . get ( var_4 ) < var_1 ) {
var_2 = var_4 ;
}
else {
var_3 = var_4 ;
}
}
if ( var_0 . get ( var_3 ) == var_1 ) {
return var_3 ;
}
if ( var_0 . get ( var_3 ) < var_1 ) {
return var_3 + 1 ;
}
if ( var_0 . get ( var_2 ) == var_1 ) {
return var_2 ;
}
return var_2 + 1 ;
}
| 3 | 2<SEP>0<SEP>1 |
688 | <awangdev>238. Product of Array Except Self_1.java | private int multiply(int[] rst, int nums[], int i, int carry) {
rst[i] *= carry;
return carry * nums[i];
} | private int sample_funcname ( int [ ] var_0 , int var_1 [ ] , int var_2 , int var_3 ) {
var_0 [ var_2 ] *= var_3 ;
return var_3 * var_1 [ var_2 ] ;
}
| 0 | null |
689 | <awangdev>169. Majority Element_4.java | public int majorityElement(int[] nums) {
if (nums == null || nums.length == 0) {
return -1;
}
int majorityNum = nums[0];
int vote = 0;
for (int num : nums) {
vote += num == majorityNum ? 1 : -1;
if (vote == 0) {
majorityNum = num;
vote = 1;
}
}
return majorityNum;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
int var_1 = var_0 [ 0 ] ;
int var_2 = 0 ;
for ( int var_3 : var_0 ) {
var_2 += var_3 == var_1 ? 1 : - 1 ;
if ( var_2 == 0 ) {
var_1 = var_3 ;
var_2 = 1 ;
}
}
return var_1 ;
}
| 2 | 0<SEP>1 |
690 | <awangdev>Number Of Corner Rectangles_2.java | private boolean validateRect(int[][] grid, int i, int j, int h, int k) {
return grid[i][j] == 1 && grid[h][k] == 1 && grid[i][k] == 1 && grid[h][j] == 1;
} | private boolean var_0 ( int [ ] [ ] var_1 , int var_2 , int var_3 , int var_4 , int var_5 ) {
return var_1 [ var_2 ] [ var_3 ] == 1 && var_1 [ var_4 ] [ var_5 ] == 1 && var_1 [ var_2 ] [ var_5 ] == 1 && var_1 [ var_4 ] [ var_3 ] == 1 ;
}
| 1 | 1 |
691 | <awangdev>Power of Three_4.java | public boolean isPowerOfThree(int n) {
return (n > 0 && Math.pow(3, 19) % n == 0);
} | public boolean var_0 ( int var_1 ) {
return ( var_1 > 0 && Math . pow ( 3 , 19 ) % var_1 == 0 ) ;
}
| 3 | 19<SEP>0<SEP>3 |
692 | <awangdev>Reverse Words in a String II_1.java | public void reverse(char[] s, int start, int end) {
while (start < end) {
char temp = s[start];
s[start] = s[end];
s[end] = temp;
start++;
end--;
}
} | public void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
while ( var_2 < var_3 ) {
char var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
var_2 ++ ;
var_3 -- ;
}
}
| 0 | null |
693 | <awangdev>53. Maximum Subarray_9.java | public int maxSubArray(ArrayList<Integer> nums) {
if (nums == null || nums.size() == 0) {
return 0;
}
int[] sums = new int[nums.size()];
sums[0] = nums.get(0);
int maxSum = sums[0];
for (int i = 1; i < sums.length; i++) {
if (sums[i - 1] < 0) {
sums[i] = nums.get(i);
} else {
sums[i] = sums[i - 1] + nums.get(i);
}
maxSum = Math.max(maxSum, sums[i]);
}
return maxSum;
} | public int sample_funcname ( ArrayList < Integer > var_0 ) {
if ( var_0 == null || var_0 . size ( ) == 0 ) {
return 0 ;
}
int [ ] var_1 = new int [ var_0 . size ( ) ] ;
var_1 [ 0 ] = var_0 . get ( 0 ) ;
int var_2 = var_1 [ 0 ] ;
for ( int var_3 = 1 ;
var_3 < var_1 . length ;
var_3 ++ ) {
if ( var_1 [ var_3 - 1 ] < 0 ) {
var_1 [ var_3 ] = var_0 . get ( var_3 ) ;
}
else {
var_1 [ var_3 ] = var_1 [ var_3 - 1 ] + var_0 . get ( var_3 ) ;
}
var_2 = Math . max ( var_2 , var_1 [ var_3 ] ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
694 | <awangdev>Distinct Subsequences_2.java | public int numDistinct(String s, String t) {
if (s == null || t == null || t.length() > s.length()) {
return 0;
} else if (s.equals(t)) {
return 1;
}
int m = s.length();
int n = t.length();
int[][] dp = new int[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 (j == 0) {
dp[curr][j] = 1;
continue;
}
if (i == 0) {
dp[curr][j] = 0;
continue;
}
dp[curr][j] = dp[prev][j];
if (s.charAt(i - 1) == t.charAt(j - 1)) {
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 || var_1 . length ( ) > var_0 . length ( ) ) {
return 0 ;
}
else if ( var_0 . equals ( var_1 ) ) {
return 1 ;
}
int var_2 = var_0 . length ( ) ;
int var_3 = var_1 . length ( ) ;
int [ ] [ ] var_4 = new int [ 2 ] [ var_3 + 1 ] ;
int var_5 = 0 ;
int var_6 = 0 ;
for ( int var_7 = 0 ;
var_7 <= var_2 ;
var_7 ++ ) {
var_6 = var_5 ;
var_5 = 1 - var_6 ;
for ( int var_8 = 0 ;
var_8 <= var_3 ;
var_8 ++ ) {
if ( var_8 == 0 ) {
var_4 [ var_5 ] [ var_8 ] = 1 ;
continue ;
}
if ( var_7 == 0 ) {
var_4 [ var_5 ] [ var_8 ] = 0 ;
continue ;
}
var_4 [ var_5 ] [ var_8 ] = var_4 [ var_6 ] [ var_8 ] ;
if ( var_0 . charAt ( var_7 - 1 ) == var_1 . charAt ( var_8 - 1 ) ) {
var_4 [ var_5 ] [ var_8 ] += var_4 [ var_6 ] [ var_8 - 1 ] ;
}
}
}
return var_4 [ var_5 ] [ var_3 ] ;
}
| 3 | 2<SEP>0<SEP>1 |
695 | <awangdev>9. Palindrome Number_1.java | public boolean isPalindrome(int x) {
if (x < 0 || (x != 0 && x % 10 == 0)) return false;
int reverse = 0;
while (x > reverse){
reverse = reverse * 10 + x % 10;
x = x/10;
}
return (x == reverse || x == reverse / 10);
} | public boolean var_0 ( int var_1 ) {
if ( var_1 < 0 || ( var_1 != 0 && var_1 % 10 == 0 ) ) return false ;
int var_2 = 0 ;
while ( var_1 > var_2 ) {
var_2 = var_2 * 10 + var_1 % 10 ;
var_1 = var_1 / 10 ;
}
return ( var_1 == var_2 || var_1 == var_2 / 10 ) ;
}
| 2 | 10<SEP>0 |
696 | <awangdev>Coins in a Line_2.java | public boolean firstWillWin(int n) {
if (n <= 0) {
return false;
}
boolean[] dp = new boolean[2];
dp[0] = false;
dp[1] = true;
for (int i = 2; i <= n; i++) {
dp[i % 2] = !dp[(i - 1) % 2] || !dp[(i - 2) % 2];
}
return dp[n % 2];
} | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
boolean [ ] var_2 = new boolean [ 2 ] ;
var_2 [ 0 ] = false ;
var_2 [ 1 ] = true ;
for ( int var_3 = 2 ;
var_3 <= var_1 ;
var_3 ++ ) {
var_2 [ var_3 % 2 ] = ! var_2 [ ( var_3 - 1 ) % 2 ] || ! var_2 [ ( var_3 - 2 ) % 2 ] ;
}
return var_2 [ var_1 % 2 ] ;
}
| 3 | 0<SEP>1<SEP>2 |
697 | <awangdev>785. Is Graph Bipartite_1.java | private boolean dfs(int[][] graph, int[] states, int state, int node) {
if (states[node] != 0) return states[node] == state;
if (graph[node].length == 0) return true;
states[node] = state;
for (int val : graph[node]) {
if (!dfs(graph, states, - state, val)) return false;
}
return true;
} | private boolean sample_funcname ( int [ ] [ ] graph , int [ ] states , int state , int node ) {
if ( states [ node ] != 0 ) return states [ node ] == state ;
if ( graph [ node ] . length == 0 ) return true ;
states [ node ] = state ;
for ( int val : graph [ node ] ) {
if ( ! dfs ( graph , states , - state , val ) ) return false ;
}
return true ;
}
| 1 | 0 |
698 | <awangdev>301. Remove Invalid Parentheses_2.java | private void dfs(List<String> rst, String s, int x, int y, char open, char close) {
for (int count = 0, i = x; i < s.length(); i++) {
if (s.charAt(i) == open) count++;
if (s.charAt(i) == close) count--;
if (count < 0) {
for (int j = y; j <= i; j++) {
if (s.charAt(j) == close && (j == y || s.charAt(j - 1) != close)) {
dfs(rst, s.substring(0, j) + s.substring(j+1), i, j, open, close);
}
}
return;
}
}
String reverse = new StringBuffer(s).reverse().toString();
if (open == '(') {
dfs(rst, reverse, 0, 0, close, open);
} else {
rst.add(reverse);
}
} | private void sample_funcname ( List < String > rst , String s , int x , int y , char open , char close ) {
for ( int count = 0 , i = x ;
i < s . length ( ) ;
i ++ ) {
if ( s . charAt ( i ) == open ) count ++ ;
if ( s . charAt ( i ) == close ) count -- ;
if ( count < 0 ) {
for ( int j = y ;
j <= i ;
j ++ ) {
if ( s . charAt ( j ) == close && ( j == y || s . charAt ( j - 1 ) != close ) ) {
dfs ( rst , s . substring ( 0 , j ) + s . substring ( j + 1 ) , i , j , open , close ) ;
}
}
return ;
}
}
String reverse = new StringBuffer ( s ) . reverse ( ) . toString ( ) ;
if ( open == '(' ) {
dfs ( rst , reverse , 0 , 0 , close , open ) ;
}
else {
rst . add ( reverse ) ;
}
}
| 3 | 0<SEP><S_QUOTE>(<S_QUOTE><SEP>1 |
699 | <awangdev>Counting Bits_1.java | public int[] countBits(int num) {
if (num < 0) {
return null;
}
int[] dp = new int[num + 1];
dp[0] = 0;
for (int i = 1; i <= num; i++) {
int prevNum = i >> 1;
dp[i] = dp[prevNum] + (i % 2);
}
return dp;
} | public int [ ] sample_funcname ( int var_0 ) {
if ( var_0 < 0 ) {
return null ;
}
int [ ] var_1 = new int [ var_0 + 1 ] ;
var_1 [ 0 ] = 0 ;
for ( int var_2 = 1 ;
var_2 <= var_0 ;
var_2 ++ ) {
int var_3 = var_2 >> 1 ;
var_1 [ var_2 ] = var_1 [ var_3 ] + ( var_2 % 2 ) ;
}
return var_1 ;
}
| 3 | 2<SEP>0<SEP>1 |
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_3 = var_0 . length ;
int [ ] var_4 = new int [ var_3 ] ;
var_4 [ var_3 - var_2 ] = var_3 - var_2 ;
for ( int var_5 = var_3 - var_2 - 1 , var_6 = var_1 [ var_3 ] - var_1 [ var_3 - var_2 ] ;
var_5 >= 0 ;
var_5 -- ) {
int var_7 = var_1 [ var_5 + var_2 ] - var_1 [ var_5 ] ;
if ( var_7 >= var_6 ) {
var_4 [ var_5 ] = var_5 ;
var_6 = var_7 ;
}
else var_4 [ var_5 ] = var_4 [ var_5 + 1 ] ;
}
return var_4 ;
}
| 2 | 1<SEP>0 |
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 ) ;
}
}
| 2 | 1<SEP><D_QUOTE> <D_QUOTE> |
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_0 ( ArrayList < Integer > var_1 ) {
if ( var_1 == null || var_1 . size ( ) == 0 ) {
return null ;
}
ArrayList < Long > var_2 = new ArrayList < Long > ( ) ;
for ( int var_3 = 0 ;
var_3 < var_1 . size ( ) ;
var_3 ++ ) {
long var_4 = 1 ;
for ( int var_5 = 0 ;
var_5 < var_1 . size ( ) ;
var_5 ++ ) {
if ( var_5 != var_3 ) {
var_4 *= var_1 . get ( var_5 ) ;
}
}
var_2 . add ( var_4 ) ;
}
return var_2 ;
}
| 2 | 0<SEP>1 |
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_1 = var_0 . length , var_2 = 0 , var_3 = 0 , min = var_1 ;
int max = Math . max ( var_0 [ var_1 - 1 ] - var_0 [ 1 ] - var_1 + 2 , var_0 [ var_1 - 2 ] - var_0 [ 0 ] - var_1 + 2 ) ;
while ( var_3 < var_1 ) {
while ( var_0 [ var_3 ] - var_0 [ var_2 ] + 1 > var_1 ) var_2 ++ ;
int var_4 = var_3 - var_2 + 1 ;
if ( var_4 == var_1 - 1 && var_0 [ var_3 ] - var_0 [ var_2 ] + 1 == var_1 - 1 ) {
min = Math . min ( min , 2 ) ;
}
else {
min = Math . min ( min , var_1 - var_4 ) ;
}
var_3 ++ ;
}
return new int [ ] {
min , max };
}
| 3 | 2<SEP>0<SEP>1 |
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_0 ( ArrayList < Integer > var_1 ) {
ArrayList < ArrayList < Integer >> var_2 = new ArrayList < ArrayList < Integer >> ( ) ;
if ( var_1 == null || var_1 . size ( ) == 0 ) {
return var_2 ;
}
Collections . sort ( var_1 ) ;
Queue < ArrayList < Integer >> var_3 = new LinkedList < ArrayList < Integer >> ( ) ;
ArrayList < Integer > var_4 = new ArrayList < Integer > ( ) ;
var_3 . offer ( new ArrayList < Integer > ( var_4 ) ) ;
var_2 . add ( new ArrayList < Integer > ( var_4 ) ) ;
for ( int var_5 = 0 ;
var_5 < var_1 . size ( ) ;
var_5 ++ ) {
int var_6 = var_1 . get ( var_5 ) ;
int size = var_3 . size ( ) ;
while ( size > 0 ) {
var_4 = var_3 . poll ( ) ;
var_4 . add ( var_6 ) ;
if ( ! var_2 . contains ( var_4 ) ) {
var_2 . add ( new ArrayList < Integer > ( var_4 ) ) ;
}
var_3 . offer ( new ArrayList < Integer > ( var_4 ) ) ;
var_4 . remove ( var_4 . size ( ) - 1 ) ;
var_3 . offer ( new ArrayList < Integer > ( var_4 ) ) ;
size -- ;
}
}
return var_2 ;
}
| 2 | 0<SEP>1 |
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_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
var_2 = var_2 * 33 + ( int ) ( var_0 [ var_3 ] ) ;
var_2 = var_2 % var_1 ;
}
return ( int ) var_2 ;
}
| 2 | 0<SEP>33 |
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 ] ;
}
| 2 | 0<SEP>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_0 ( String var_1 , String var_2 ) {
List < Integer > var_3 = new ArrayList < > ( ) ;
if ( var_1 == null || var_1 . length ( ) == 0 || var_1 . length ( ) < var_2 . length ( ) ) return var_3 ;
int var_4 = var_1 . length ( ) , var_5 = var_2 . length ( ) ;
int [ ] var_6 = new int [ 256 ] ;
for ( char var_7 : var_2 . toCharArray ( ) ) var_6 [ var_7 ] ++ ;
int var_8 = 0 , var_9 = 0 ;
int var_10 = var_5 ;
while ( var_9 < var_4 ) {
char var_7 = var_1 . charAt ( var_9 ++ ) ;
if ( var_6 [ var_7 ] > 0 ) var_10 -- ;
var_6 [ var_7 ] -- ;
if ( var_10 == 0 ) var_3 . add ( var_8 ) ;
if ( var_9 - var_8 == var_5 ) {
var_7 = var_1 . charAt ( var_8 ++ ) ;
if ( var_6 [ var_7 ] >= 0 ) var_10 ++ ;
var_6 [ var_7 ] ++ ;
}
}
return var_3 ;
}
| 2 | 0<SEP>256 |
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 ;
}
}
| 6 | <D_QUOTE>-<D_QUOTE><SEP><D_QUOTE>++<D_QUOTE><SEP>2<SEP>0<SEP>1<SEP><D_QUOTE>--<D_QUOTE> |
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_2 = var_1 . length ;
Map < Integer , Set < Integer >> var_3 = new HashMap < > ( ) ;
for ( int var_4 : var_1 ) {
var_3 . put ( var_4 , new HashSet < > ( ) ) ;
}
var_3 . get ( 0 ) . add ( 0 ) ;
for ( int var_4 : var_1 ) {
for ( int var_5 : var_3 . get ( var_4 ) ) {
if ( var_5 - 1 > 0 && var_3 . containsKey ( var_4 + var_5 - 1 ) ) {
var_3 . get ( var_4 + var_5 - 1 ) . add ( var_5 - 1 ) ;
}
if ( var_5 > 0 && var_3 . containsKey ( var_4 + var_5 ) ) {
var_3 . get ( var_4 + var_5 ) . add ( var_5 ) ;
}
if ( var_5 + 1 > 0 && var_3 . containsKey ( var_4 + var_5 + 1 ) ) {
var_3 . get ( var_4 + var_5 + 1 ) . add ( var_5 + 1 ) ;
}
}
}
int var_6 = var_1 [ var_2 - 1 ] ;
return ! var_3 . get ( var_6 ) . isEmpty ( ) ;
}
| 2 | 0<SEP>1 |
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_0 ( int var_1 , int var_2 ) {
List < List < Integer >> var_3 = new ArrayList < > ( ) ;
int sqrt = ( int ) Math . sqrt ( var_2 ) ;
for ( int var_4 = var_1 ;
var_4 <= sqrt ;
var_4 ++ ) {
int var_5 = var_2 / var_4 ;
if ( var_4 * var_5 == var_2 ) var_3 . add ( Arrays . asList ( var_4 , var_5 ) ) ;
}
return var_3 ;
}
| 0 | null |
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_0 ) {
if ( var_0 == null || var_0 . length ( ) == 0 ) {
return 0 ;
}
boolean [ ] var_1 = new boolean [ 256 ] ;
int var_2 = 0 ;
int var_3 = 0 ;
int var_4 = 0 ;
while ( var_3 < var_0 . length ( ) ) {
while ( var_4 < var_0 . length ( ) && ! var_1 [ var_0 . charAt ( var_4 ) ] ) {
var_1 [ var_0 . charAt ( var_4 ) ] = true ;
var_2 = Math . max ( var_2 , var_4 - var_3 + 1 ) ;
var_4 ++ ;
}
var_1 [ var_0 . charAt ( var_3 ) ] = false ;
var_3 ++ ;
}
return var_2 ;
}
| 3 | 0<SEP>256<SEP>1 |
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_1 = var_0 . length - 1 ;
var_1 > 0 ;
var_1 -- ) {
if ( var_0 [ var_1 ] == 10 ) {
var_0 [ var_1 ] = 0 ;
var_0 [ var_1 - 1 ] += 1 ;
}
else return var_0 ;
}
if ( var_0 [ 0 ] == 10 ) {
int [ ] var_2 = new int [ var_0 . length + 1 ] ;
var_2 [ 0 ] = 1 ;
var_2 [ 1 ] = 0 ;
for ( int var_1 = 2 ;
var_1 < var_2 . length - 1 ;
var_1 ++ ) {
var_2 [ var_1 ] = var_0 [ var_1 - 1 ] ;
}
return var_2 ;
}
else return var_0 ;
}
| 4 | 2<SEP>10<SEP>0<SEP>1 |
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 ;
}
| 1 | 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_1 = 0 ;
int var_2 = 0 ;
int var_3 = 1 ;
while ( var_1 < var_0 . length ) {
while ( var_3 < var_0 . length && var_0 [ var_3 - 1 ] <= var_0 [ var_3 ] ) {
var_3 ++ ;
}
var_2 += var_0 [ var_3 - 1 ] - var_0 [ var_1 ] ;
var_1 = var_3 ;
var_3 = var_1 + 1 ;
}
return var_2 ;
}
| 2 | 1<SEP>0 |
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_1 = 0 ;
var_1 < var_0 . length ;
var_1 ++ ) {
if ( var_0 [ var_1 ] == 0 ) var_0 [ var_1 ] = - 1 ;
}
Map < Integer , Integer > var_2 = new HashMap < > ( ) ;
var_2 . put ( 0 , - 1 ) ;
int var_3 = 0 , max = 0 ;
for ( int var_1 = 0 ;
var_1 < var_0 . length ;
var_1 ++ ) {
var_3 += var_0 [ var_1 ] ;
if ( var_2 . containsKey ( var_3 ) ) {
max = Math . max ( max , var_1 - var_2 . get ( var_3 ) ) ;
}
if ( ! var_2 . containsKey ( var_3 ) ) {
var_2 . put ( var_3 , var_1 ) ;
}
}
return max ;
}
| 2 | 0<SEP>1 |
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_2 = 0 ;
int var_3 = 0 ;
int var_4 = 0 ;
int var_5 = 0 ;
int var_6 = var_1 . length ;
for ( int var_7 = var_6 / 2 - 1 ;
var_7 >= 0 ;
var_7 -- ) {
var_3 = var_7 ;
while ( var_3 * 2 + 1 < var_6 ) {
var_4 = var_3 * 2 + 1 ;
var_5 = var_3 * 2 + 2 ;
if ( var_5 >= var_6 || var_1 [ var_4 ] <= var_1 [ var_5 ] ) {
var_2 = var_4 ;
}
else {
var_2 = var_5 ;
}
if ( var_1 [ var_3 ] <= var_1 [ var_2 ] ) {
break ;
}
else {
int var_8 = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_8 ;
}
var_3 = var_2 ;
}
}
}
| 3 | 0<SEP>1<SEP>2 |
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_0 ) {
int [ ] var_1 = new int [ 26 ] ;
for ( char var_2 : var_0 . toCharArray ( ) ) var_1 [ var_2 - 'a' ] ++ ;
for ( int var_3 : var_1 ) if ( var_3 != 0 ) return var_3 ;
return 0 ;
}
| 3 | 0<SEP>26<SEP><S_QUOTE>a<S_QUOTE> |
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 ;
}
| 2 | 1<SEP>2 |
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_0 ( String var_1 ) {
List < String > var_2 = new ArrayList < String > ( ) ;
if ( var_1 == null || var_1 . length ( ) == 0 ) {
return var_2 ;
}
ArrayList < Integer > var_3 = new ArrayList < Integer > ( ) ;
StringBuffer var_4 = new StringBuffer ( var_1 ) ;
while ( var_4 . indexOf ( "++" ) != - 1 ) {
int var_5 = var_4 . indexOf ( "++" ) ;
var_3 . add ( var_5 ) ;
var_4 . replace ( var_5 , var_5 + 1 , "*" ) ;
}
for ( int var_5 : var_3 ) {
var_2 . add ( var_1 . substring ( 0 , var_5 ) + "--" + var_1 . substring ( var_5 + 2 ) ) ;
}
return var_2 ;
}
| 6 | <D_QUOTE>++<D_QUOTE><SEP>2<SEP>0<SEP>1<SEP><D_QUOTE>--<D_QUOTE><SEP><D_QUOTE>*<D_QUOTE> |
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_1 ) {
if ( var_1 . length ( ) == 0 || var_1 . equals ( "0" ) ) {
return var_1 ;
}
int var_2 = Integer . parseInt ( var_1 ) ;
StringBuffer var_3 = new StringBuffer ( ) ;
while ( var_2 != 0 ) {
var_3 . insert ( 0 , var_2 % 2 ) ;
var_2 = var_2 / 2 ;
}
return var_3 . toString ( ) ;
}
| 3 | <D_QUOTE>0<D_QUOTE><SEP>0<SEP>2 |
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_2 = var_0 . length ;
int var_3 = var_0 [ 0 ] . length ;
int var_4 = var_2 - 1 ;
int var_5 = 0 ;
int var_6 = 0 ;
while ( var_4 >= 0 && var_5 < var_3 ) {
if ( var_0 [ var_4 ] [ var_5 ] < var_1 ) {
var_5 ++ ;
}
else if ( var_0 [ var_4 ] [ var_5 ] > var_1 ) {
var_4 -- ;
}
else {
var_6 ++ ;
var_4 -- ;
var_5 ++ ;
}
}
return var_6 ;
}
| 2 | 0<SEP>1 |
Subsets and Splits