id int64 0 1.17k | comefrom stringlengths 21 84 | code stringlengths 50 1.89k | masked stringlengths 63 2.47k |
|---|---|---|---|
800 | <awangdev>523. Continuous Subarray Sum_2.java | public boolean checkSubarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) return false;
int n = nums.length;
int[] dp = new int[n];
dp[0] = nums[0];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + nums[i];
}
for (int i = 0; i < n; i... | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 ) return false ;
int var_6 = var_1 . length ;
int [ ] var_7 = new int [ var_6 ] ;
var_7 [ 0 ] = var_1 [ 0 ] ;
for ( int var_9 = 1 ;
var_9 < var_6 ;
var_9 ++ ) {
var_7 [ var_9 ] = var_7 [ var_9 - 1 ] + var_1 ... |
801 | <awangdev>46. Permutations_3.java | private void dfs(List<List<Integer>> result, List<Integer> list, int[] nums, boolean[] visited) {
if (list.size() == nums.length) {
result.add(new ArrayList<>(list));
return;
}
for (int i = 0; i < nums.length; i++) {
if (visited[i]) continue;
lis... | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] nums , boolean [ ] visited ) {
if ( list . size ( ) == nums . length ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
for ( int i = 0 ;
i < nums . length ;
i ++ ) {
if ( visited [ i ] ) con... |
802 | <awangdev>53. Maximum Subarray_2.java | public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int preSum = 0, minPreSum = 0;
int max = Integer.MIN_VALUE;
for (int num : nums) {
preSum += num;
max = Math.max(max, preSum - minPreSum);
minPreSum = Math.min(minPreS... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = 0 , var_5 = 0 ;
int max = Integer . MIN_VALUE ;
for ( int var_9 : var_0 ) {
var_4 += var_9 ;
max = Math . max ( max , var_4 - var_5 ) ;
var_5 = Math . min ( var_5 , var_4 ) ;
}
retur... |
803 | <awangdev>1094. Car Pooling_1.java | public boolean carPooling(int[][] trips, int capacity) {
if (trips == null || trips.length == 0) return true;
int[] bucket = new int[1000];
for (int[] trip : trips) {
bucket[trip[1]] += trip[0];
bucket[trip[2]] += -trip[0];
}
int cap = 0;
... | public boolean var_0 ( int [ ] [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 ) return true ;
int [ ] var_7 = new int [ 1000 ] ;
for ( int [ ] var_8 : var_1 ) {
var_7 [ var_8 [ 1 ] ] += var_8 [ 0 ] ;
var_7 [ var_8 [ 2 ] ] += - var_8 [ 0 ] ;
}
int var_11 = 0 ;
for ( int var_12 : ... |
804 | <awangdev>205. Isomorphic Strings_1.java | public boolean isIsomorphic(String s, String t) {
if (s == null || t == null || s.length() != t.length()) return false;
Map<Character, Character> map = new HashMap<>();
for (int i = 0; i < s.length(); i++) {
char charS = s.charAt(i), charT = t.charAt(i);
if (map.... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null || var_2 . length ( ) != var_3 . length ( ) ) return false ;
Map < Character , Character > var_9 = new HashMap < > ( ) ;
for ( int var_11 = 0 ;
var_11 < var_2 . length ( ) ;
var_11 ++ ) {
char var_13 = var_2 . charA... |
805 | <awangdev>[tool] Quick Select - Median_1.java | private void swap(int[] nums, int x, int y) {
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
806 | <awangdev>315. Count of Smaller Numbers After Self_1.java | private int search(List<Integer> list, int target) {
if (list.size() == 0) return 0;
int start = 0, end = list.size() - 1;
if (target <= list.get(start)) return start;
if (target > list.get(end)) return end + 1;
while (start + 1 < end) {
int mid = start + (end - star... | private int sample_funcname ( List < Integer > var_2 , int var_3 ) {
if ( var_2 . size ( ) == 0 ) return 0 ;
int var_6 = 0 , var_8 = var_2 . size ( ) - 1 ;
if ( var_3 <= var_2 . get ( var_6 ) ) return var_6 ;
if ( var_3 > var_2 . get ( var_8 ) ) return var_8 + 1 ;
while ( var_6 + 1 < var_8 ) {
int var_11 ... |
807 | <awangdev>1060. Missing Element in Sorted Array_2.java | public int missingElement(int[] nums, int k) {
int start = 0, end = nums.length - 1;
int count = nums[end] - nums[0] - end;
if (count < k) {
return nums[end] + k - count;
}
while (start + 1 < end) {
int mid = start + (end - start) / 2;
... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_3 = 0 , var_6 = var_0 . length - 1 ;
int var_7 = var_0 [ var_6 ] - var_0 [ 0 ] - var_6 ;
if ( var_7 < var_1 ) {
return var_0 [ var_6 ] + var_1 - var_7 ;
}
while ( var_3 + 1 < var_6 ) {
int var_9 = var_3 + ( var_6 - var_3 ) / 2 ;
va... |
808 | <awangdev>Backpack II_5.java | public int backPackII(int m, int[] A, int V[]) {
if (A == null || V == null || A.length != V.length) {
return 0;
}
int n = A.length;
int[][] dp = new int[n + 1][m + 1];
dp[0][0] = 0;
for (int j = 0; j <= m; j++) {
dp[0][j] = 0;
}
... | 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_8 = new int [ var_6 + 1 ] [ var_0 + 1 ] ;
var_8 [ 0 ] [ 0 ] = 0 ;
for ( int var_9 = 0 ;
var_9... |
809 | <awangdev>Coins in a Line III_3.java | private void search(int i, int j, int[][] dp, int[][] sum, int[] values) {
if (dp[i][j] > 0) {
return;
}
if (i == j) {
dp[i][j] = values[i];
} else if (i > j) {
dp[i][j] = 0;
} else if (i + 1 == j) {
dp[i][j] = Math.max(values[i],... | private void sample_funcname ( int i , int j , int [ ] [ ] dp , int [ ] [ ] sum , int [ ] values ) {
if ( dp [ i ] [ j ] > 0 ) {
return ;
}
if ( i == j ) {
dp [ i ] [ j ] = values [ i ] ;
}
else if ( i > j ) {
dp [ i ] [ j ] = 0 ;
}
else if ( i + 1 == j ) {
dp [ i ] [ j ] = Math . max ( va... |
810 | <awangdev>Perfect Rectangle_1.java | private String buildKey(int x, int y) {
return x + "@" + y;
} | private String var_0 ( int var_1 , int var_2 ) {
return var_1 + "@" + var_2 ;
}
|
811 | <awangdev>Two Strings Are Anagrams_1.java | public boolean anagram(String s, String t) {
if (s == null || t == null) {
return false;
} else if (s.length() != t.length()) {
return false;
} else if (s.length() == 0 && t.length() == 0) {
return true;
}
int[] count = new int[256];
fo... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null ) {
return false ;
}
else if ( var_2 . length ( ) != var_3 . length ( ) ) {
return false ;
}
else if ( var_2 . length ( ) == 0 && var_3 . length ( ) == 0 ) {
return true ;
}
int [ ] var_8 = new int [ 256... |
812 | <awangdev>33. Search in Rotated Sorted Array_2.java | public int search(int[] A, int target) {
if (A == null || A.length == 0) {
return -1;
}
int p1 = 0;
int p2 = A.length - 1;
int start = p1;
int end = p2;
int mid = start + (end - start)/2;
int breakPoint = 0;
while (start + 1 < end) {
... | 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 ;
int var_8 = var_6 ;
int var_9 = var_7 ;
int var_11 = var_8 + ( var_9 - var_8 ) / 2 ;
int var_12 = 0 ;
while ( var_8 + 1 < var_9 )... |
813 | <awangdev>Backpack V_1.java | public int backPackV(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return 0;
}
int n = nums.length;
int[][] dp = new int[n + 1][target + 1];
dp[0][0] = 1;
for (int j = 1; j <= target; j++) {
dp[0][j] = 0;
}
for... | 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 ] ;
var_7 [ 0 ] [ 0 ] = 1 ;
for ( int var_8 = 1 ;
var_8 <= var_1 ;
var_8 ++ ) {
var_7 [ 0 ] [ v... |
814 | <awangdev>Compare Version Numbers_1.java | public int compareVersion(String version1, String version2) {
if (version1.equals(version2)) {
return 0;
}
String[] subVersion1 = version1.split("\\.");
String[] subVersion2 = version2.split("\\.");
int size = Math.max(subVersion1.length, subVersion2.length);
... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 . equals ( var_2 ) ) {
return 0 ;
}
String [ ] var_7 = var_1 . split ( "\\." ) ;
String [ ] var_8 = var_2 . split ( "\\." ) ;
int var_12 = Math . max ( var_7 . length , var_8 . length ) ;
int var_13 = 0 ;
for ( int var_14 = 0 ;
... |
815 | <awangdev>215. Kth Largest Element in an Array_1.java | public int findKthLargest(int[] nums, int k) {
if (nums == null || nums.length == 0) return -1;
PriorityQueue<Integer> queue = new PriorityQueue<>();
for (int i = 0; i < nums.length; i++) {
if (i < k || nums[i] > queue.peek()) queue.offer(nums[i]);
if (queue.s... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) return - 1 ;
PriorityQueue < Integer > var_8 = new PriorityQueue < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_0 . length ;
var_9 ++ ) {
if ( var_9 < var_1 || var_0 [ var_9 ] > var_8 . peek ( ) ) var_8 . o... |
816 | <awangdev>1033. Moving Stones Until Consecutive_2.java | private int calDist(int start, int end) {
return end - start - 1;
} | private int sample_funcname ( int var_0 , int var_1 ) {
return var_1 - var_0 - 1 ;
}
|
817 | <awangdev>Remove Duplicate Letters_1.java | String removeDuplicateLetters(String s) {
if (s == null || s.length() <= 1) {
return s;
}
char[] arr = s.toCharArray();
int[] count = new int[256];
boolean[] visited = new boolean[256];
for (char c : arr) {
count[c]++;
}
StringBuff... | String var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . length ( ) <= 1 ) {
return var_2 ;
}
char [ ] var_7 = var_2 . toCharArray ( ) ;
int [ ] var_9 = new int [ 256 ] ;
boolean [ ] var_11 = new boolean [ 256 ] ;
for ( char var_12 : var_7 ) {
var_9 [ var_12 ] ++ ;
}
StringBuffer var_15 = n... |
818 | <awangdev>12. Integer to Roman_1.java | private String repeat(String curr, int num) {
StringBuffer sb = new StringBuffer();
while (num-- > 0) {
sb.append(curr);
}
return sb.toString();
} | private String var_0 ( String var_2 , int var_3 ) {
StringBuffer var_5 = new StringBuffer ( ) ;
while ( var_3 -- > 0 ) {
var_5 . append ( var_2 ) ;
}
return var_5 . toString ( ) ;
}
|
819 | <awangdev>256. Paint House_1.java | public int minCost(int[][] costs) {
int n = costs.length;
int[][] dp = new int[2][3];
for (int i = 1; i <= n; i++) {
int last = (i - 1) % 2, curr = i % 2;
for (int j = 0; j < 3; j++) {
dp[curr][j] = Math.min(dp[last][(j + 1) % 3], dp[last][(j +... | public int sample_funcname ( int [ ] [ ] var_0 ) {
int var_2 = var_0 . length ;
int [ ] [ ] var_5 = new int [ 2 ] [ 3 ] ;
for ( int var_7 = 1 ;
var_7 <= var_2 ;
var_7 ++ ) {
int var_8 = ( var_7 - 1 ) % 2 , var_9 = var_7 % 2 ;
for ( int var_11 = 0 ;
var_11 < 3 ;
var_11 ++ ) {
var_5 [ var_... |
820 | <awangdev>717. 1-bit and 2-bit Characters_2.java | public boolean isOneBitCharacter(int[] bits) {
if (bits == null || bits.length == 0) {
return false;
}
int n = bits.length;
if (n == 1) {
return bits[0] == 0;
}
if (bits[n - 1] != 0) {
return false;
}
boolean[] ... | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
int var_5 = var_1 . length ;
if ( var_5 == 1 ) {
return var_1 [ 0 ] == 0 ;
}
if ( var_1 [ var_5 - 1 ] != 0 ) {
return false ;
}
boolean [ ] var_8 = new boolean [ var_5 ] ;
var_8 [ 0 ] = ... |
821 | <awangdev>Interleaving Positive and Negative Numbers_2.java | public void rerange(int[] A) {
if (A == null || A.length <= 1) {
return;
}
List<Integer> positive = new ArrayList<>();
List<Integer> negative = new ArrayList<>();
for (int num : A) {
if (num >= 0) {
positive.add(num);
} else {
... | public void var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length <= 1 ) {
return ;
}
List < Integer > var_8 = new ArrayList < > ( ) ;
List < Integer > var_9 = new ArrayList < > ( ) ;
for ( int var_10 : var_1 ) {
if ( var_10 >= 0 ) {
var_8 . add ( var_10 ) ;
}
else {
var_9... |
822 | <awangdev>Minimum Size Subarray Sum_2.java | public int minSubArrayLen(int s, int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int result = Integer.MAX_VALUE;
for (int i = 0; i < nums.length - 1; i++) {
int sum = nums[i];
if (sum >= s) {
result = 1;
... | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return 0 ;
}
int var_7 = Integer . MAX_VALUE ;
for ( int var_8 = 0 ;
var_8 < var_1 . length - 1 ;
var_8 ++ ) {
int var_10 = var_1 [ var_8 ] ;
if ( var_10 >= var_0 ) {
var_7 = 1 ;
... |
823 | <awangdev>387. First Unique Character in a String_2.java | public int firstUniqChar(String s) {
if (s == null || s.length() == 0) return -1;
for (int i = 0; i < s.length(); i++) {
if (s.indexOf(s.charAt(i)) == s.lastIndexOf(s.charAt(i))) {
return i;
}
}
return -1;
} | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) return - 1 ;
for ( int var_6 = 0 ;
var_6 < var_1 . length ( ) ;
var_6 ++ ) {
if ( var_1 . indexOf ( var_1 . charAt ( var_6 ) ) == var_1 . lastIndexOf ( var_1 . charAt ( var_6 ) ) ) {
return var_6 ;
}
}
... |
824 | <awangdev>4Sum_1.java | private String buildKey(List<Integer> list) {
StringBuffer sb = new StringBuffer();
for (int num : list) sb.append(num + "@");
return sb.toString();
} | private String var_0 ( List < Integer > var_3 ) {
StringBuffer var_5 = new StringBuffer ( ) ;
for ( int var_6 : var_3 ) var_5 . append ( var_6 + "@" ) ;
return var_5 . toString ( ) ;
}
|
825 | <awangdev>68. Text Justification_1.java | private int getRowLength(List<String> list, int width) {
return width + (list.size() - 1);
} | private int sample_funcname ( List < String > var_2 , int var_3 ) {
return var_3 + ( var_2 . size ( ) - 1 ) ;
}
|
826 | <awangdev>Ones and Zeroes_1.java | public int findMaxForm(String[] strs, int m, int n) {
if (strs == null || strs.length == 0 || (m == 0 && n == 0)) {
return 0;
}
int len = strs.length;
int[][][] dp = new int[m + 1][n + 1][len + 1];
int[] ones = new int[len];
int[] zeros = new int[len]... | public int sample_funcname ( String [ ] var_1 , int var_2 , int var_3 ) {
if ( var_1 == null || var_1 . length == 0 || ( var_2 == 0 && var_3 == 0 ) ) {
return 0 ;
}
int var_7 = var_1 . length ;
int [ ] [ ] [ ] var_9 = new int [ var_2 + 1 ] [ var_3 + 1 ] [ var_7 + 1 ] ;
int [ ] var_10 = new int [ var_7 ] ;... |
827 | <awangdev>720. Longest Word in Dictionary_1.java | public String longestWord(String[] words) {
if (words == null || words.length == 0) {
return null;
}
String result = "";
Arrays.sort(words);
Set<String> set = new HashSet<>();
set.add(result);
for (String word : words) {
i... | public String var_0 ( String [ ] var_2 ) {
if ( var_2 == null || var_2 . length == 0 ) {
return null ;
}
String var_7 = "" ;
Arrays . sort ( var_2 ) ;
Set < String > var_12 = new HashSet < > ( ) ;
var_12 . add ( var_7 ) ;
for ( String var_14 : var_2 ) {
if ( var_12 . contains ( var_14 . substring ... |
828 | <awangdev>69. Sqrt(x)_3.java | public double mySqrt(double x) {
double start = 0;
double end = x;
double eps = 1e-12;
while (end - start > eps) {
double mid = start + (end - start) / 2;
if (mid * mid < x) {
start = mid;
} else {
end = mid;
... | public double sample_funcname ( double var_0 ) {
double var_2 = 0 ;
double var_3 = var_0 ;
double var_5 = 1e-12 ;
while ( var_3 - var_2 > var_5 ) {
double var_7 = var_2 + ( var_3 - var_2 ) / 2 ;
if ( var_7 * var_7 < var_0 ) {
var_2 = var_7 ;
}
else {
var_3 = var_7 ;
}
}
if ( ... |
829 | <awangdev>72. Edit Distance_4.java | public int minDistance(String word1, String word2) {
if (word1 == null && word2 == null) {
return 0;
}
char[] words1 = word1 == null ? new char[0] : word1.toCharArray();
char[] words2 = word2 == null ? new char[0] : word2.toCharArray();
int m = word1.length()... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null && var_2 == null ) {
return 0 ;
}
char [ ] var_6 = var_1 == null ? new char [ 0 ] : var_1 . toCharArray ( ) ;
char [ ] var_7 = var_2 == null ? new char [ 0 ] : var_2 . toCharArray ( ) ;
int var_9 = var_1 . length ( ) ;
int v... |
830 | <awangdev>Sort Letters by Case_3.java | private void swap(char[] chars, int x, int y) {
char temp = chars[x];
chars[x] = chars[y];
chars[y] = temp;
} | private void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
char var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
831 | <awangdev>218. The Skyline Problem_3.java | int parent(int id) {
if (id == 0) {
return -1;
}
return (id - 1) / 2;
} | int sample_funcname ( int var_0 ) {
if ( var_0 == 0 ) {
return - 1 ;
}
return ( var_0 - 1 ) / 2 ;
}
|
832 | <awangdev>88. Search in Rotated Sorted Array II_1.java | public boolean search(int[] nums, int target) {
if (nums == null || nums.length == 0) return false;
int start = 0, end = nums.length - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
if (nums[mid] == target) return true;
if (nums[start] < num... | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 ) return false ;
int var_6 = 0 , var_8 = var_1 . length - 1 ;
while ( var_6 + 1 < var_8 ) {
int var_10 = var_6 + ( var_8 - var_6 ) / 2 ;
if ( var_1 [ var_10 ] == var_2 ) return true ;
if ( var_1 [ var_6 ] < ... |
833 | <awangdev>299. Bulls and Cows_1.java | public String getHint(String secret, String guess) {
if (secret == null || guess == null || secret.length() == 0 || guess.length() == 0) {
return "0A0B";
}
int[] nums = new int[10];
int bulls = 0, cows = 0;
for (int i = 0; i < secret.length(); i++) {
... | public String var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null || var_2 . length ( ) == 0 || var_3 . length ( ) == 0 ) {
return "0A0B" ;
}
int [ ] var_9 = new int [ 10 ] ;
int var_10 = 0 , var_11 = 0 ;
for ( int var_12 = 0 ;
var_12 < var_2 . length ( ) ;
var_12 ++ ) {
in... |
834 | <awangdev>261. Graph Valid Tree_2.java | private boolean dfs(Map<Integer, Set<Integer>> graph, Set<Integer> visited, int curr, int pre) {
if (visited.contains(curr)) return false;
visited.add(curr);
for (int child : graph.get(curr)) {
if (child == pre) continue;
if (!dfs(graph, visited, child, curr)) return fal... | private boolean sample_funcname ( Map < Integer , Set < Integer >> graph , Set < Integer > visited , int curr , int pre ) {
if ( visited . contains ( curr ) ) return false ;
visited . add ( curr ) ;
for ( int child : graph . get ( curr ) ) {
if ( child == pre ) continue ;
if ( ! dfs ( graph , visited , ch... |
835 | <awangdev>741. Cherry Pickup_3.java | private void flipRow(int[] nums) {
int i = 0, j = nums.length - 1;
while (i != j) {
int temp = nums[j];
nums[j--] = nums[i];
nums[i++] = temp;
}
} | private void var_0 ( int [ ] var_1 ) {
int var_3 = 0 , var_6 = var_1 . length - 1 ;
while ( var_3 != var_6 ) {
int var_7 = var_1 [ var_6 ] ;
var_1 [ var_6 -- ] = var_1 [ var_3 ] ;
var_1 [ var_3 ++ ] = var_7 ;
}
}
|
836 | <awangdev>253. Meeting Rooms II_1.java | private int[] extract(int[][] intervals, int index) {
int[] array = new int[intervals.length];
for (int i = 0; i < intervals.length; i++) {
array[i] = intervals[i][index];
}
Arrays.sort(array);
return array;
} | private int [ ] sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
int [ ] var_3 = new int [ var_0 . length ] ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
var_3 [ var_5 ] = var_0 [ var_5 ] [ var_1 ] ;
}
Arrays . sort ( var_3 ) ;
return var_3 ;
}
|
837 | <awangdev>Number of Digit One_1.java | public int countDigitOne(int n) {
int count = 0;
for (long i = 1; i <= n; i *= 10) {
count += (n / i + 8) / 10 * i;
if (n / i % 10 == 1) {
count += n % i + 1;
}
}
return count;
} | public int sample_funcname ( int var_0 ) {
int var_2 = 0 ;
for ( long var_4 = 1 ;
var_4 <= var_0 ;
var_4 *= 10 ) {
var_2 += ( var_0 / var_4 + 8 ) / 10 * var_4 ;
if ( var_0 / var_4 % 10 == 1 ) {
var_2 += var_0 % var_4 + 1 ;
}
}
return var_2 ;
}
|
838 | <awangdev>Rehashing_1.java | public int hashcode(int key, int capacity) {
if (key < 0) {
return (key % capacity + capacity) % capacity;
} else {
return key % capacity;
}
} | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 < 0 ) {
return ( var_0 % var_1 + var_1 ) % var_1 ;
}
else {
return var_0 % var_1 ;
}
}
|
839 | <awangdev>[lint]. HashHeap_2.java | int lson(int id) {
return id * 2 + 1;
} | int sample_funcname ( int var_0 ) {
return var_0 * 2 + 1 ;
}
|
840 | <awangdev>122. Best Time to Buy and Sell Stock II_5.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length <= 1) {
return 0;
}
int[] buyOn = new int[prices.length];
int[] sellOn = new int[prices.length];
int length = prices.length;
buyOn[length - 1] = 0;
sellOn[length - 1] = prices[len... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) {
return 0 ;
}
int [ ] var_5 = new int [ var_0 . length ] ;
int [ ] var_6 = new int [ var_0 . length ] ;
int length = var_0 . length ;
var_5 [ length - 1 ] = 0 ;
var_6 [ length - 1 ] = var_0 [ length - 1 ] ;
f... |
841 | <awangdev>Flip Game II_2.java | public static boolean canWin(String s) {
if (s == null || s.length() <= 1) {
return false;
}
StringBuilder sb = new StringBuilder(s);
while (sb.indexOf("++") != -1) {
int index = sb.indexOf("++");
if(!canWin(s.substring(0, index) + "--" + s.substring(i... | public static boolean sample_funcname ( String s ) {
if ( s == null || s . length ( ) <= 1 ) {
return false ;
}
StringBuilder sb = new StringBuilder ( s ) ;
while ( sb . indexOf ( "++" ) != - 1 ) {
int index = sb . indexOf ( "++" ) ;
if ( ! canWin ( s . substring ( 0 , index ) + "--" + s . substring... |
842 | <awangdev>416. Partition Equal Subset Sum_3.java | public boolean dfs(int[] nums, int index, int target) {
if (index == nums.length) return false;
if (target == nums[index]) return true;
if (target < nums[index]) return false;
return dfs(nums, index + 1, target - nums[index])
|| dfs(nums, index + 1, target);
} | public boolean sample_funcname ( int [ ] nums , int index , int target ) {
if ( index == nums . length ) return false ;
if ( target == nums [ index ] ) return true ;
if ( target < nums [ index ] ) return false ;
return dfs ( nums , index + 1 , target - nums [ index ] ) || dfs ( nums , index + 1 , target ) ;
}
|
843 | <awangdev>Triangle Count_2.java | public int triangleCount(int S[]) {
if (S == null || S.length == 0) {
return 0;
}
Arrays.sort(S);
int count = 0;
for (int i = 0; i < S.length; i++) {
int left = 0;
int right = i - 1;
while (left < right){
if (S[left] + S[right] > S[i]) {
count += (right -... | public int sample_funcname ( int var_0 [ ] ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
Arrays . sort ( var_0 ) ;
int var_6 = 0 ;
for ( int var_7 = 0 ;
var_7 < var_0 . length ;
var_7 ++ ) {
int var_8 = 0 ;
int var_10 = var_7 - 1 ;
while ( var_8 < var_10 ) {
if ( var... |
844 | <awangdev>41. First Missing Positive_1.java | public int firstMissingPositive(int[] nums) {
if (nums == null || nums.length == 0) {
return 1;
}
if (nums.length == 1) {
return nums[0] == 1 ? 2 : 1;
}
int n = nums.length;
int i = 0;
while (i < n) {
int val = nums[i];
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 1 ;
}
if ( var_0 . length == 1 ) {
return var_0 [ 0 ] == 1 ? 2 : 1 ;
}
int var_6 = var_0 . length ;
int var_7 = 0 ;
while ( var_7 < var_6 ) {
int var_8 = var_0 [ var_7 ] ;
if ( var_8 != var_... |
845 | <awangdev>Number of Longest Increasing Subsequence_2.java | public int findNumberOfLIS(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length, maxLen = 0, maxFreq = 0;
int[] len = new int[n + 1];
int[] count = new int[n + 1];
for (int i = 1; i <= n; i++) {
len[i] = 1;
c... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_4 = var_0 . length , var_5 = 0 , var_6 = 0 ;
int [ ] var_8 = new int [ var_4 + 1 ] ;
int [ ] var_9 = new int [ var_4 + 1 ] ;
for ( int var_10 = 1 ;
var_10 <= var_4 ;
var_10 ++ ) {
var_8 [ var_... |
846 | <awangdev>Subsets II_3.java | public void dfs(List<List<Integer>> rst, ArrayList<Integer> list, int index, int[] nums) {
rst.add(new ArrayList<Integer>(list));
for (int i = index; i < nums.length; i++) {
if (i != index && nums[i] == nums[i - 1]) {
continue;
}
list.add(nums... | public void sample_funcname ( List < List < Integer >> rst , ArrayList < Integer > list , int index , int [ ] nums ) {
rst . add ( new ArrayList < Integer > ( list ) ) ;
for ( int i = index ;
i < nums . length ;
i ++ ) {
if ( i != index && nums [ i ] == nums [ i - 1 ] ) {
continue ;
}
list . a... |
847 | <awangdev>42. Trapping Rain Water_1.java | public int trap(int[] height) {
if (height == null || height.length == 0) return 0;
int n = height.length;
int[] maxLeft = new int[n], maxRight = new int[n];
maxLeft[0] = height[0];
maxRight[n - 1] = height[n - 1];
for (int i = 1; i < n; i++) maxLeft[i] = Math.max(maxLeft... | 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 = new int [ var_4 ] , var_6 = new int [ var_4 ] ;
var_5 [ 0 ] = var_0 [ 0 ] ;
var_6 [ var_4 - 1 ] = var_0 [ var_4 - 1 ] ;
for ( int var_8 = 1 ;
var_8 < var_4 ;
... |
848 | <awangdev>Kth Smallest Element in a Sorted Matrix_1.java | private int countSmallerItem(int[][] matrix, int target) {
int n = matrix.length;
int count = 0;
int i = 0, j = n - 1;
while (i < n && j >= 0) {
if (matrix[i][j] > target) {
j--;
} else {
count += j + 1;
i++;
... | private int sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
int var_3 = var_0 . length ;
int var_5 = 0 ;
int var_6 = 0 , var_8 = var_3 - 1 ;
while ( var_6 < var_3 && var_8 >= 0 ) {
if ( var_0 [ var_6 ] [ var_8 ] > var_1 ) {
var_8 -- ;
}
else {
var_5 += var_8 + 1 ;
var_6 ++ ;
... |
849 | <awangdev>219. Contains Duplicate II_2.java | public boolean containsNearbyDuplicate(int[] nums, int k) {
if (nums == null || nums.length == 0 || k <= 0) {
return false;
}
Map<Integer, List<Integer>> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
if (map.containsKey(nums[i])) {
... | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 || var_2 <= 0 ) {
return false ;
}
Map < Integer , List < Integer >> var_10 = new HashMap < > ( ) ;
for ( int var_11 = 0 ;
var_11 < var_1 . length ;
var_11 ++ ) {
if ( var_10 . containsKey ( var_1 [ var_11... |
850 | <awangdev>70. Climbing Stairs_2.java | public int climbStairs(int n) {
if (n <= 1) {
return 1;
}
int[] dp = new int[2];
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i % 2] = dp[(i - 1) % 2] + dp[(i - 2) % 2];
}
return dp[n % 2];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 1 ;
}
int [ ] var_3 = new int [ 2 ] ;
var_3 [ 0 ] = 1 ;
var_3 [ 1 ] = 1 ;
for ( int var_5 = 2 ;
var_5 <= var_0 ;
var_5 ++ ) {
var_3 [ var_5 % 2 ] = var_3 [ ( var_5 - 1 ) % 2 ] + var_3 [ ( var_5 - 2 ) % 2 ] ;
}
return var_3... |
851 | <awangdev>Subsets II_2.java | public List<List<Integer>> subsetsWithDup(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
if (nums == null || nums.length == 0) {
return result;
}
Arrays.sort(nums);
Queue<List<Integer>> queue = new LinkedList<>();
List<Integer> initialList = new... | 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 ;
}
Arrays . sort ( var_3 ) ;
Queue < List < Integer >> var_13 = new LinkedList < > ( ) ;
List < Integer > var_14 = new ArrayList ... |
852 | <awangdev>[lint]. Compare Strings_2.java | public boolean compareStrings(String A, String B) {
if (A == null || B == null || A.length() < B.length()) {
return false;
}
int[] countA = new int[26];
int[] countB = new int[26];
for (int i = 0; i < A.length(); i++) {
countA[A.charAt(i) - 'A']++;
... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null || var_2 . length ( ) < var_3 . length ( ) ) {
return false ;
}
int [ ] var_7 = new int [ 26 ] ;
int [ ] var_8 = new int [ 26 ] ;
for ( int var_10 = 0 ;
var_10 < var_2 . length ( ) ;
var_10 ++ ) {
var_7 [ va... |
853 | <awangdev>416. Partition Equal Subset Sum_2.java | public boolean dfs(int[] nums, int index, int target) {
if (target < 0) return false;
if (target == 0) return true;
for (int i = index; i < nums.length; i++) {
if (dfs(nums, i + 1, target - nums[i])) return true;
}
return false;
} | public boolean sample_funcname ( int [ ] nums , int index , int target ) {
if ( target < 0 ) return false ;
if ( target == 0 ) return true ;
for ( int i = index ;
i < nums . length ;
i ++ ) {
if ( dfs ( nums , i + 1 , target - nums [ i ] ) ) return true ;
}
return false ;
}
|
854 | <awangdev>26.Remove Duplicates from Sorted Array_1.java | public int removeDuplicates(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int index = 0;
for (int i = 1; i < nums.length; i++) {
if (nums[i] != nums[index]) {
nums[++index] = nums[i];
}
}
return index... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = 0 ;
for ( int var_6 = 1 ;
var_6 < var_0 . length ;
var_6 ++ ) {
if ( var_0 [ var_6 ] != var_0 [ var_4 ] ) {
var_0 [ ++ var_4 ] = var_0 [ var_6 ] ;
}
}
return var_4 + 1 ... |
855 | <awangdev>Flip Game II_3.java | public boolean canWin(String s) {
if (s == null || s.length() <= 1) {
return false;
}
String str = new String(s);
for (int i = str.indexOf("++"); i >= 0 && i < str.length() - 1; i = str.indexOf("++")) {
if (!canWin( s.substring(0, i) + "--" + s.substring(i + 2))) {... | public boolean sample_funcname ( String s ) {
if ( s == null || s . length ( ) <= 1 ) {
return false ;
}
String str = new String ( s ) ;
for ( int i = str . indexOf ( "++" ) ;
i >= 0 && i < str . length ( ) - 1 ;
i = str . indexOf ( "++" ) ) {
if ( ! canWin ( s . substring ( 0 , i ) + "--" + s . sub... |
856 | <awangdev>340. Longest Substring with At Most K Distinct Characters_1.java | public int lengthOfLongestSubstringKDistinct(String s, int k) {
if (s == null) return 0;
int left = 0, right = 0, max = 0, n = s.length();
Map<Character, Integer> freq = new HashMap<>();
while (right < n) {
char head = s.charAt(right++);
freq.put(head, freq.getO... | public int sample_funcname ( String var_1 , int var_2 ) {
if ( var_1 == null ) return 0 ;
int var_5 = 0 , var_6 = 0 , max = 0 , var_9 = var_1 . length ( ) ;
Map < Character , Integer > var_14 = new HashMap < > ( ) ;
while ( var_6 < var_9 ) {
char var_16 = var_1 . charAt ( var_6 ++ ) ;
var_14 . put ( var... |
857 | <awangdev>Fast Power_1.java | public int fastPower(int a, int b, int n) {
if (n == 0) {
return 1 % b;
}
if (n == 1) {
return a % b;
}
long recurPow = fastPower(a, b, n / 2);
recurPow = (recurPow * recurPow) % b;
if (n % 2 == 1) {
recurPow = recurPow * a % ... | public int sample_funcname ( int a , int b , int n ) {
if ( n == 0 ) {
return 1 % b ;
}
if ( n == 1 ) {
return a % b ;
}
long recurPow = fastPower ( a , b , n / 2 ) ;
recurPow = ( recurPow * recurPow ) % b ;
if ( n % 2 == 1 ) {
recurPow = recurPow * a % b ;
}
return ( int ) recurPow ;
}
|
858 | <awangdev>Target Sum_1.java | public int findTargetSumWays(int[] nums, int S) {
if (nums == null || nums.length == 0) return 0;
int sum = 0;
for (int num : nums) sum += num;
if (sum < Math.abs(S)) return 0;
int n = nums.length, m = (sum << 1) + 1;
int[][] dp = new int[n][m];
... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 ) return 0 ;
int var_5 = 0 ;
for ( int var_6 : var_0 ) var_5 += var_6 ;
if ( var_5 < Math . abs ( var_1 ) ) return 0 ;
int var_9 = var_0 . length , var_11 = ( var_5 << 1 ) + 1 ;
int [ ] [ ] var_12 = new int ... |
859 | <awangdev>122. Best Time to Buy and Sell Stock II_4.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) {
return 0;
}
int n = prices.length;
int[][] dp = new int[2][2];
dp[0][0] = dp[0][1] = 0;
dp[1][0] = - prices[0];
for (int i = 2; i <= n; i++) {
dp[i % 2][0] = M... | 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 ] [ 2 ] ;
var_6 [ 0 ] [ 0 ] = var_6 [ 0 ] [ 1 ] = 0 ;
var_6 [ 1 ] [ 0 ] = - var_0 [ 0 ] ;
for ( int var_8 = 2 ;
var_8 <= var_4 ;
va... |
860 | <awangdev>[lint]. HashHeap_3.java | int rson(int id) {
return id * 2 + 2;
} | int sample_funcname ( int var_0 ) {
return var_0 * 2 + 2 ;
}
|
861 | <awangdev>218. The Skyline Problem_2.java | private boolean isInvalid(int[][] buildings) {
return buildings == null || buildings.length == 0 || buildings[0] == null || buildings[0].length == 0;
} | private boolean var_0 ( int [ ] [ ] var_1 ) {
return var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ;
}
|
862 | <awangdev>261. Graph Valid Tree_3.java | private Map<Integer, Set<Integer>> buildGraph(int n, int[][] edges) {
Map<Integer, Set<Integer>> graph = new HashMap<>();
for (int i = 0; i < n; i++) graph.putIfAbsent(i, new HashSet<>());
for (int[] edge: edges) {
graph.get(edge[0]).add(edge[1]);
graph.get(edg... | private Map < Integer , Set < Integer >> var_2 ( int var_3 , int [ ] [ ] var_4 ) {
Map < Integer , Set < Integer >> var_7 = new HashMap < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_3 ;
var_9 ++ ) var_7 . putIfAbsent ( var_9 , new HashSet < > ( ) ) ;
for ( int [ ] var_12 : var_4 ) {
var_7 . get ( var_12 [ 0... |
863 | <awangdev>741. Cherry Pickup_2.java | private void updateGrid(int[][] grid, List<int[]> path) {
for (int[] pos : path) {
grid[pos[0]][pos[1]] = 0;
}
} | private void var_0 ( int [ ] [ ] var_1 , List < int [ ] > var_3 ) {
for ( int [ ] var_4 : var_3 ) {
var_1 [ var_4 [ 0 ] ] [ var_4 [ 1 ] ] = 0 ;
}
}
|
864 | <awangdev>Update Bits_1.java | public int updateBits(int n, int m, int i, int j) {
int mask = -1;
mask = -1 >>> (32 - (j - i + 1));
mask = mask << i;
mask = ~mask;
n = n & mask;
return n | (m << i);
} | public int sample_funcname ( int var_0 , int var_1 , int var_2 , int var_3 ) {
int var_5 = - 1 ;
var_5 = - 1 >>> ( 32 - ( var_3 - var_2 + 1 ) ) ;
var_5 = var_5 << var_2 ;
var_5 = ~ var_5 ;
var_0 = var_0 & var_5 ;
return var_0 | ( var_1 << var_2 ) ;
}
|
865 | <awangdev>House Robber II_1.java | public int rob(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
} else if (nums.length == 1) {
return nums[0];
}
int n = nums.length;
long[][] dp = new long[n + 1][2];
dp[0][0] = 0;
dp[1][0] = 0;
dp[1][1] = nums[0];... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
else if ( var_0 . length == 1 ) {
return var_0 [ 0 ] ;
}
int var_5 = var_0 . length ;
long [ ] [ ] var_7 = new long [ var_5 + 1 ] [ 2 ] ;
var_7 [ 0 ] [ 0 ] = 0 ;
var_7 [ 1 ] [ 0 ] = 0 ;
va... |
866 | <awangdev>69. Sqrt(x)_2.java | public int mySqrt(int x) {
long start = 0;
long end = x;
while(start <= end) {
long mid = (start + end) / 2;
if (mid * mid < x) {
start = mid + 1;
} else if (mid * mid > x){
end = mid - 1;
} else {
... | public int sample_funcname ( int var_0 ) {
long var_2 = 0 ;
long var_3 = var_0 ;
while ( var_2 <= var_3 ) {
long var_5 = ( var_2 + var_3 ) / 2 ;
if ( var_5 * var_5 < var_0 ) {
var_2 = var_5 + 1 ;
}
else if ( var_5 * var_5 > var_0 ) {
var_3 = var_5 - 1 ;
}
else {
return ( ... |
867 | <awangdev>Predict the Winner_1.java | public boolean PredictTheWinner(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
int n = nums.length;
int[][] dp = new int[n][n];
for (int i = 0; i < n; i++) {
dp[i][i] = nums[i];
}
for (int len = 2; len <= n... | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
int var_5 = var_1 . length ;
int [ ] [ ] var_6 = new int [ var_5 ] [ var_5 ] ;
for ( int var_7 = 0 ;
var_7 < var_5 ;
var_7 ++ ) {
var_6 [ var_7 ] [ var_7 ] = var_1 [ var_7 ] ;
}
for ( int va... |
868 | <awangdev>78. Subsets_1.java | private void dfs(List<List<Integer>> result, List<Integer> list, int[] nums, int depth) {
if (depth >= nums.length) {
result.add(new ArrayList<>(list));
return;
}
list.add(nums[depth]);
dfs(result, list, nums, depth + 1);
list.remove(list.size() - 1);
... | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] nums , int depth ) {
if ( depth >= nums . length ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
list . add ( nums [ depth ] ) ;
dfs ( result , list , nums , depth + 1 ) ;
list . remove ( list... |
869 | <awangdev>72. Edit Distance_5.java | public int minDistance(String word1, String word2) {
if (word1 == null && word2 == null) {
return 0;
}
char[] words1 = word1 == null ? new char[0] : word1.toCharArray();
char[] words2 = word2 == null ? new char[0] : word2.toCharArray();
int m = word1.length()... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null && var_2 == null ) {
return 0 ;
}
char [ ] var_6 = var_1 == null ? new char [ 0 ] : var_1 . toCharArray ( ) ;
char [ ] var_7 = var_2 == null ? new char [ 0 ] : var_2 . toCharArray ( ) ;
int var_9 = var_1 . length ( ) ;
int v... |
870 | <awangdev>Sort Letters by Case_2.java | private void swap(char[] chars, int x, int y) {
char temp = chars[x];
chars[x] = chars[y];
chars[y] = temp;
} | private void var_0 ( char [ ] var_1 , int var_2 , int var_3 ) {
char var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
871 | <awangdev>387. First Unique Character in a String_3.java | public int firstUniqChar(String s) {
if (s == null || s.length() == 0) return -1;
Map<Character, Integer> map = new HashMap<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
map.putIfAbsent(c, 0);
map.put(c, map.get(c) + 1);
}
... | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) return - 1 ;
Map < Character , Integer > var_10 = new HashMap < > ( ) ;
for ( int var_11 = 0 ;
var_11 < var_1 . length ( ) ;
var_11 ++ ) {
char var_13 = var_1 . charAt ( var_11 ) ;
var_10 . putIfAbsent ( var_... |
872 | <awangdev>1203. Sort Items by Groups Respecting Dependencies_1.java | private Map<Integer, List<Integer>> buildGroup(int n, int m, int[] group) {
Map<Integer, List<Integer>> map = new HashMap<>();
for (int i = 0; i < n; i++) {
int groupId = group[i] == -1 ? m++ : group[i];
group[i] = groupId;
map.putIfAbsent(groupId, new ArrayList<>())... | private Map < Integer , List < Integer >> var_2 ( int var_3 , int var_4 , int [ ] var_5 ) {
Map < Integer , List < Integer >> var_8 = new HashMap < > ( ) ;
for ( int var_10 = 0 ;
var_10 < var_3 ;
var_10 ++ ) {
int var_12 = var_5 [ var_10 ] == - 1 ? var_4 ++ : var_5 [ var_10 ] ;
var_5 [ var_10 ] = var_12... |
873 | <awangdev>7. Reverse Integer_1.java | public int reverse(int x) {
int result = 0;
while (x != 0) {
int tail = x % 10;
int newResult = result * 10 + tail;
if ((newResult - tail) / 10 != result) return 0;
result = newResult;
x = x / 10;
}
return result;
} | public int sample_funcname ( int var_0 ) {
int var_2 = 0 ;
while ( var_0 != 0 ) {
int var_4 = var_0 % 10 ;
int var_5 = var_2 * 10 + var_4 ;
if ( ( var_5 - var_4 ) / 10 != var_2 ) return 0 ;
var_2 = var_5 ;
var_0 = var_0 / 10 ;
}
return var_2 ;
}
|
874 | <awangdev>Interleaving Positive and Negative Numbers_3.java | public void rerange(int[] A) {
if (A == null || A.length == 0) {
return;
}
Arrays.sort(A);
int count = 0;
for (int num : A){
count += num >= 0 ? 1 : -1;
}
int start = 0;
int end = A.length - 1;
if (count < 0) {
start++;
} else if (count > 0){
end... | public void var_0 ( int [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return ;
}
Arrays . sort ( var_1 ) ;
int var_7 = 0 ;
for ( int var_8 : var_1 ) {
var_7 += var_8 >= 0 ? 1 : - 1 ;
}
int var_10 = 0 ;
int var_11 = var_1 . length - 1 ;
if ( var_7 < 0 ) {
var_10 ++ ;
}
els... |
875 | <awangdev>149. Max Points on a Line_1.java | private int findGCD(int a, int b) {
if (b == 0) return a;
return findGCD(b, a % b);
} | private int sample_funcname ( int a , int b ) {
if ( b == 0 ) return a ;
return findGCD ( b , a % b ) ;
}
|
876 | <awangdev>Minimum Size Subarray Sum_3.java | public int minimumSize(int[] nums, int s) {
if (nums == null || nums.length == 0) {
return -1;
}
int start = 0;
int end = 0;
int min = Integer.MAX_VALUE;
int sum = 0;
for (; start < nums.length; start++) {
while(end < nums.length && sum < s) {
sum += nums[end];
... | 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 = 0 ;
int min = Integer . MAX_VALUE ;
int var_11 = 0 ;
for ( ;
var_6 < var_0 . length ;
var_6 ++ ) {
while ( var_7 < var_0 . length && var_11 < var_... |
877 | <awangdev>13. Roman to Integer_1.java | private int countCombo(final String pattern, String str) {
int count = 0;
while (str.contains(pattern)) {
count++;
str = str.substring(str.indexOf(pattern) + pattern.length());
}
return count;
} | private int sample_funcname ( final String var_1 , String var_2 ) {
int var_4 = 0 ;
while ( var_2 . contains ( var_1 ) ) {
var_4 ++ ;
var_2 = var_2 . substring ( var_2 . indexOf ( var_1 ) + var_1 . length ( ) ) ;
}
return var_4 ;
}
|
878 | <awangdev>1106. Parsing A Boolean Expression_1.java | private String findExpBlock(String s, int i) {
StringBuffer sb = new StringBuffer();
Stack<Character> stack = new Stack<>();
while (sb.length() == 0 || !stack.isEmpty()) {
char c = s.charAt(i++);
sb.append(c);
if (c == '(') stack.push(c);
if (c ==... | private String var_0 ( String var_2 , int var_3 ) {
StringBuffer var_5 = new StringBuffer ( ) ;
Stack < Character > var_8 = new Stack < > ( ) ;
while ( var_5 . length ( ) == 0 || ! var_8 . isEmpty ( ) ) {
char var_13 = var_2 . charAt ( var_3 ++ ) ;
var_5 . append ( var_13 ) ;
if ( var_13 == '(' ) var_... |
879 | <awangdev>Search a 2D Matrix_2.java | public boolean searchMatrix(ArrayList<ArrayList<Integer>> matrix, int target) {
if(matrix.size() == 0) {
return false;
}
int rows = matrix.size();
int cols = matrix.get(0).size();
int start = 0;
int end = rows * cols - 1;
int mid;
whil... | public boolean var_0 ( ArrayList < ArrayList < Integer >> var_3 , int var_4 ) {
if ( var_3 . size ( ) == 0 ) {
return false ;
}
int var_7 = var_3 . size ( ) ;
int var_9 = var_3 . get ( 0 ) . size ( ) ;
int var_10 = 0 ;
int var_12 = var_7 * var_9 - 1 ;
int var_13 ;
while ( var_10 + 1 < var_12 ) {
... |
880 | <awangdev>242. Valid Anagram_1.java | private int[] countChars(String s, String t) {
int[] count = new int[26];
for (int i = 0; i < s.length(); i++) {
count[s.charAt(i) - 'a'] += 1;
count[t.charAt(i) - 'a'] -= 1;
}
return count;
} | private int [ ] sample_funcname ( String var_1 , String var_2 ) {
int [ ] var_4 = new int [ 26 ] ;
for ( int var_6 = 0 ;
var_6 < var_1 . length ( ) ;
var_6 ++ ) {
var_4 [ var_1 . charAt ( var_6 ) - 'a' ] += 1 ;
var_4 [ var_2 . charAt ( var_6 ) - 'a' ] -= 1 ;
}
return var_4 ;
}
|
881 | <awangdev>345. Reverse Vowels of a String_1.java | public String reverseVowels(String s) {
if (s == null || s.length() == 0) {
return s;
}
List<Character> vowels = Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U');
StringBuffer sb = new StringBuffer(s);
int maxIndex = sb.length() - 1;
in... | public String var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . length ( ) == 0 ) {
return var_2 ;
}
List < Character > var_20 = Arrays . asList ( 'a' , 'e' , 'i' , 'o' , 'u' , 'A' , 'E' , 'I' , 'O' , 'U' ) ;
StringBuffer var_22 = new StringBuffer ( var_2 ) ;
int var_24 = var_22 . length ( ) - 1 ;
... |
882 | <awangdev>560. Subarray Sum Equals K_1.java | public int subarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) return 0;
Map<Integer, Integer> preSumCount = new HashMap<>();
int n = nums.length, sum = 0, count = 0;
preSumCount.put(0, 1);
for (int num : nums) {
sum += num;
int priorSu... | 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 < > ( ) ;
int var_9 = var_0 . length , var_10 = 0 , var_11 = 0 ;
var_8 . put ( 0 , 1 ) ;
for ( int var_14 : var_0 ) {
var_10 += var_14 ;
int v... |
883 | <awangdev>Backpack II_4.java | public int backPackII(int m, int[] A, int V[]) {
if (A == null || V == null || A.length != V.length) {
return 0;
}
int n = A.length;
int[][] dp = new int[2][m + 1];
for (int j = 0; j <= m; j++) {
dp[0][j] = -1;
}
dp[0][0] = 0;
int curr = 0, p... | 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 = 0 ;
var_10 <= var_0 ;
var_10 ++ ) {
... |
884 | <awangdev>Coins in a Line III_2.java | private void search(int i, int j, boolean[][] visited, int[][] dp, int[][] sum, int[] values) {
if (visited[i][j]) {
return;
}
visited[i][j] = true;
if (i == j) {
dp[i][j] = values[i];
} else if (i > j) {
dp[i][j] = 0;
} else... | private void sample_funcname ( int i , int j , boolean [ ] [ ] visited , int [ ] [ ] dp , int [ ] [ ] sum , int [ ] values ) {
if ( visited [ i ] [ j ] ) {
return ;
}
visited [ i ] [ j ] = true ;
if ( i == j ) {
dp [ i ] [ j ] = values [ i ] ;
}
else if ( i > j ) {
dp [ i ] [ j ] = 0 ;
}
els... |
885 | <awangdev>287. Find the Duplicate Number_2.java | private boolean validate(int candidate, int[] nums) {
int count = 0;
for (int num: nums) {
count += num <= candidate ? 1 : 0;
}
return count <= candidate;
} | private boolean var_0 ( int var_1 , int [ ] var_2 ) {
int var_4 = 0 ;
for ( int var_5 : var_2 ) {
var_4 += var_5 <= var_1 ? 1 : 0 ;
}
return var_4 <= var_1 ;
}
|
886 | <awangdev>[lint]. Subarray Sum_1.java | public List<Integer> subarraySum(int[] nums) {
List<Integer> rst = new ArrayList<>();
if (nums == null || nums.length == 0) {
return rst;
}
int preSum = 0;
Map<Integer, Integer> map = new HashMap<>();
map.put(preSum, -1);
for (int i = 0; i < nums.lengt... | public List < Integer > var_1 ( int [ ] var_2 ) {
List < Integer > var_5 = new ArrayList < > ( ) ;
if ( var_2 == null || var_2 . length == 0 ) {
return var_5 ;
}
int var_9 = 0 ;
Map < Integer , Integer > var_12 = new HashMap < > ( ) ;
var_12 . put ( var_9 , - 1 ) ;
for ( int var_15 = 0 ;
var_15 < va... |
887 | <awangdev>Wiggle Sort_1.java | private void swap(int[] nums, int x, int y) {
int temp = nums[x];
nums[x] = nums[y];
nums[y] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
888 | <awangdev>Redundant Connection_2.java | public int[] findRedundantConnection(int[][] edges) {
Map<Integer, Set<Integer>> graph = new HashMap<>();
for (int[] edge : edges) {
int x = edge[0], y = edge[1];
Set<Integer> visited = new HashSet<>();
Queue<Integer> queue = new LinkedList<>();
q... | public int [ ] sample_funcname ( int [ ] [ ] var_0 ) {
Map < Integer , Set < Integer >> var_5 = new HashMap < > ( ) ;
for ( int [ ] var_6 : var_0 ) {
int var_8 = var_6 [ 0 ] , var_10 = var_6 [ 1 ] ;
Set < Integer > var_12 = new HashSet < > ( ) ;
Queue < Integer > var_15 = new LinkedList < > ( ) ;
va... |
889 | <awangdev>39. Combination Sum_4.java | private boolean validate(int[] candidates, int target) {
return candidates == null || candidates.length == 0 || target <= 0;
} | private boolean var_0 ( int [ ] var_1 , int var_2 ) {
return var_1 == null || var_1 . length == 0 || var_2 <= 0 ;
}
|
890 | <awangdev>47. Permutations II_2.java | private void swap(List<Integer> list, int x, int y) {
int temp = list.get(x);
list.set(x, list.get(y));
list.set(y, temp);
} | private void var_0 ( List < Integer > var_3 , int var_4 , int var_5 ) {
int var_7 = var_3 . get ( var_4 ) ;
var_3 . set ( var_4 , var_3 . get ( var_5 ) ) ;
var_3 . set ( var_5 , var_7 ) ;
}
|
891 | <awangdev>523. Continuous Subarray Sum_3.java | public boolean checkSubarraySum(int[] nums, int k) {
if (nums == null || nums.length == 0) {
return false;
}
int n = nums.length;
for (int i = 0; i < n; i++) {
int sum = nums[i];
for (int j = i + 1; j < n; j++) {
sum += nums[j];
... | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
if ( var_1 == null || var_1 . length == 0 ) {
return false ;
}
int var_6 = var_1 . length ;
for ( int var_7 = 0 ;
var_7 < var_6 ;
var_7 ++ ) {
int var_8 = var_1 [ var_7 ] ;
for ( int var_10 = var_7 + 1 ;
var_10 < var_6 ;
var_10 ++ ) {
... |
892 | <awangdev>14. Longest Common Prefix_2.java | public String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length == 0) {
return "";
}
if (strs.length == 1) {
return strs[0];
}
String prefix = "";
int ind = 0;
while (ind < strs[0].length()) {
char c = strs[0]... | public String var_0 ( String [ ] var_2 ) {
if ( var_2 == null || var_2 . length == 0 ) {
return "" ;
}
if ( var_2 . length == 1 ) {
return var_2 [ 0 ] ;
}
String var_8 = "" ;
int var_9 = 0 ;
while ( var_9 < var_2 [ 0 ] . length ( ) ) {
char var_11 = var_2 [ 0 ] . charAt ( var_9 ) ;
boolean... |
893 | <awangdev>46. Permutations_2.java | private void dfs(List<List<Integer>> result, List<Integer> list, int[] nums) {
if (list.size() == nums.length) {
result.add(new ArrayList<>(list));
return;
}
for (int i = 0; i < nums.length; i++) {
if (list.contains(nums[i])) continue;
list.add(nu... | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] nums ) {
if ( list . size ( ) == nums . length ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
for ( int i = 0 ;
i < nums . length ;
i ++ ) {
if ( list . contains ( nums [ i ] ) ) continue... |
894 | <awangdev>152. Maximum Product Subarray_4.java | int maxProduct(int nums[]) {
int max = nums[0];
for (int i = 1, imax = max, imin = max; i < nums.length; i++) {
if (nums[i] < 0) {
int temp = imax;
imax = imin;
imin = temp;
}
imax = Math.max(nums[i], imax * nums[i]);
... | int sample_funcname ( int var_0 [ ] ) {
int max = var_0 [ 0 ] ;
for ( int var_4 = 1 , var_5 = max , var_6 = max ;
var_4 < var_0 . length ;
var_4 ++ ) {
if ( var_0 [ var_4 ] < 0 ) {
int var_8 = var_5 ;
var_5 = var_6 ;
var_6 = var_8 ;
}
var_5 = Math . max ( var_0 [ var_4 ] , var_5 * ... |
895 | <awangdev>53. Maximum Subarray_3.java | public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int n = nums.length, max = Integer.MIN_VALUE;
int[] dp = new int[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = Math.max(dp[i - 1] + nums[i - 1], nums[i - 1]);
... | 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 ] = Math . max ... |
896 | <awangdev>1306. Jump Game III_2.java | private boolean dfs(int[] arr, Set<Integer> visited, int index) {
if (arr[index] == 0) return true;
if (!visited.add(index)) return false;
if (visited.size() == arr.length) return false;
int left = index - arr[index], right = index + arr[index];
return (left >=... | private boolean sample_funcname ( int [ ] arr , Set < Integer > visited , int index ) {
if ( arr [ index ] == 0 ) return true ;
if ( ! visited . add ( index ) ) return false ;
if ( visited . size ( ) == arr . length ) return false ;
int left = index - arr [ index ] , right = index + arr [ index ] ;
return ( l... |
897 | <awangdev>Word Pattern_2.java | public boolean wordPattern(String pattern, String str) {
if (pattern != null && str != null && pattern.length() == 0 && str.length() == 0) {
return true;
}
if (pattern == null || pattern.length() == 0 || str == null || str.length() == 0) {
return false;
}
String[] strArr =... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 != null && var_3 != null && var_2 . length ( ) == 0 && var_3 . length ( ) == 0 ) {
return true ;
}
if ( var_2 == null || var_2 . length ( ) == 0 || var_3 == null || var_3 . length ( ) == 0 ) {
return false ;
}
String [ ] var_9 = var_3 .... |
898 | <awangdev>121. Best Time to Buy and Sell Stock_2.java | public int maxProfit(int[] prices) {
if (prices == null || prices.length <= 1) return 0;
int profit = 0, min = prices[0];
for (int i = 1; i < prices.length; i++) {
if (prices[i] < min) min = prices[i];
else profit = Math.max(profit, prices[i] - min);
}
ret... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) return 0 ;
int var_5 = 0 , var_6 = var_0 [ 0 ] ;
for ( int var_7 = 1 ;
var_7 < var_0 . length ;
var_7 ++ ) {
if ( var_0 [ var_7 ] < var_6 ) var_6 = var_0 [ var_7 ] ;
else var_5 = Math . max ( var_5 , var_0 [ var... |
899 | <awangdev>Jump Game II_1.java | public int jump(int[] nums) {
if (nums == null || nums.length <= 1) return 0;
int count = 0, farest = 0, maxRange = 0, n = nums.length;
for (int i = 0; i < n - 1; i++) {
maxRange = Math.max(maxRange, i + nums[i]);
if (i == farest) {
count++;
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length <= 1 ) return 0 ;
int var_5 = 0 , var_6 = 0 , var_7 = 0 , var_8 = var_0 . length ;
for ( int var_9 = 0 ;
var_9 < var_8 - 1 ;
var_9 ++ ) {
var_7 = Math . max ( var_7 , var_9 + var_0 [ var_9 ] ) ;
if ( var_9 == var_6 ) {... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.