id int64 0 1.17k | comefrom stringlengths 21 84 | code stringlengths 50 1.89k | masked stringlengths 63 2.47k |
|---|---|---|---|
900 | <awangdev>509. Fibonacci Number_1.java | public int fibonacci(int n) {
if (n <= 1) {
return 0;
}
int first = 0;
int second = 1;
for (int i = 2; i < n; i++) {
int temp = second;
second = first + second;
first = temp;
}
return second;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 1 ) {
return 0 ;
}
int var_3 = 0 ;
int var_4 = 1 ;
for ( int var_6 = 2 ;
var_6 < var_0 ;
var_6 ++ ) {
int var_7 = var_4 ;
var_4 = var_3 + var_4 ;
var_3 = var_7 ;
}
return var_4 ;
}
|
901 | <awangdev>Minimum Height Trees_1.java | public List<Integer> findMinHeightTrees(int n, int[][] edges) {
List<Integer> rst = new ArrayList<Integer>();
if (n == 1) {
rst.add(0);
return rst;
}else if (n == 0 || edges == null || edges.length == 0 || edges.length != n - 1) {
return rst;
}
... | public List < Integer > var_1 ( int var_2 , int [ ] [ ] var_3 ) {
List < Integer > var_6 = new ArrayList < Integer > ( ) ;
if ( var_2 == 1 ) {
var_6 . add ( 0 ) ;
return var_6 ;
}
else if ( var_2 == 0 || var_3 == null || var_3 . length == 0 || var_3 . length != var_2 - 1 ) {
return var_6 ;
}
boo... |
902 | <awangdev>40. Combination Sum II_1.java | private void dfs(List<List<Integer>> result, List<Integer> list,
int[] candidates, int index, int target) {
if (target == 0) {
result.add(new ArrayList<>(list));
return;
}
for (int i = index; i < candidates.length; i++) {
if (i > index &&... | private void sample_funcname ( List < List < Integer >> result , List < Integer > list , int [ ] candidates , int index , int target ) {
if ( target == 0 ) {
result . add ( new ArrayList < > ( list ) ) ;
return ;
}
for ( int i = index ;
i < candidates . length ;
i ++ ) {
if ( i > index && candidat... |
903 | <awangdev>One Edit Distance_1.java | private boolean compareStr(String s, String t, int x, int y) {
return s.substring(x).equals(t.substring(y));
} | private boolean var_0 ( String var_2 , String var_3 , int var_4 , int var_5 ) {
return var_2 . substring ( var_4 ) . equals ( var_3 . substring ( var_5 ) ) ;
}
|
904 | <awangdev>Max Sum of Rectangle No Larger Than K_2.java | public int maxSumSubmatrix(int[][] matrix, int k) {
if (matrix == null || matrix.length == 0 || matrix[0] == null || matrix[0].length == 0) {
return -1;
}
int m = matrix.length, n = matrix[0].length;
int max = Integer.MIN_VALUE;
for (int row = 0; row < m; row++) {
... | public int sample_funcname ( int [ ] [ ] var_0 , int var_1 ) {
if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) {
return - 1 ;
}
int var_6 = var_0 . length , var_7 = var_0 [ 0 ] . length ;
int max = Integer . MIN_VALUE ;
for ( int var_11 = 0 ;
var_11 < var_... |
905 | <awangdev>265. Paint House II_3.java | public int minCostII(int[][] costs) {
if (costs == null || costs.length == 0) {
return 0;
} else if (costs.length == 1 && costs[0].length == 1) {
return costs[0][0];
}
int minCost = Integer.MAX_VALUE;
int n = costs.length;
int k = costs[0].length;
... | 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_7 = Integer . MAX_VALUE ;
int var_8 = var_0 . length ;
int var_9 = var_0 [ 0 ] . length ... |
906 | <awangdev>Longest Valid Parentheses_3.java | public int longestValidParentheses(String s) {
if (s == null || s.length() == 0) return 0;
int n = s.length();
Stack<Integer> stack = new Stack<>();
char[] arr = s.toCharArray();
for (int i = 0; i < n; i++) {
if (arr[i] == ')' && !stack.isEmpty() && arr[stack.peek()] ... | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . length ( ) == 0 ) return 0 ;
int var_5 = var_1 . length ( ) ;
Stack < Integer > var_8 = new Stack < > ( ) ;
char [ ] var_10 = var_1 . toCharArray ( ) ;
for ( int var_11 = 0 ;
var_11 < var_5 ;
var_11 ++ ) {
if ( var_10 [ var_11... |
907 | <awangdev>62. Unique Path_2.java | public int uniquePaths(int m, int n) {
if (m == 0 || n == 0) return 0;
int[][] dp = new int[2][n];
for (int i = 0; i < 2; i++) dp[i][0] = 1;
for (int i = 0; i < n; i++) dp[0][i] = 1;
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[i%2][... | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 == 0 || var_1 == 0 ) return 0 ;
int [ ] [ ] var_4 = new int [ 2 ] [ var_1 ] ;
for ( int var_5 = 0 ;
var_5 < 2 ;
var_5 ++ ) var_4 [ var_5 ] [ 0 ] = 1 ;
for ( int var_5 = 0 ;
var_5 < var_1 ;
var_5 ++ ) var_4 [ 0 ] [ var_5 ] = 1 ;
for ( in... |
908 | <awangdev>Longest Common Substring_4.java | public int longestCommonSubstring(String A, String B) {
if (A == null || B == null || A.length() == 0 || B.length() == 0) {
return 0;
}
int [][] D = new int[A.length() + 1][B.length() + 1];
int max = 0;
for (int i = 0; i <= A.length(); i++) {
for(int j = 0; j <= B.length(); j++) ... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null || var_1 . length ( ) == 0 || var_2 . length ( ) == 0 ) {
return 0 ;
}
int [ ] [ ] var_7 = new int [ var_1 . length ( ) + 1 ] [ var_2 . length ( ) + 1 ] ;
int max = 0 ;
for ( int var_9 = 0 ;
var_9 <= var_1 .... |
909 | <awangdev>Last Position of Target_1.java | public int lastPosition(int[] A, int target) {
if (A == null || A.length == 0) {
return -1;
}
int start = 0;
int end = A.length - 1;
int mid;
while(start + 1 < end) {
mid = start + (end - start)/2;
if (A[mid] == target) {
if (mid + 1 < A.length && A[mid + 1] == ta... | 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 ;
while ( var_6 + 1 < var_7 ) {
var_8 = var_6 + ( var_7 - var_6 ) / 2 ;
if ( var_0 [ var_8 ] == var_1 ) {
if ( ... |
910 | <awangdev>Pow(x, n)_2.java | public double pow(double x, int n) {
if (n == 0) {
return 1;
}
double num = pow(x, n/2);
if (n % 2 == 0) {
return num * num;
}
return num * num * x;
} | public double sample_funcname ( double x , int n ) {
if ( n == 0 ) {
return 1 ;
}
double num = pow ( x , n / 2 ) ;
if ( n % 2 == 0 ) {
return num * num ;
}
return num * num * x ;
}
|
911 | <awangdev>31. Next Permutation_2.java | private int findHigh(int[] nums, int low) {
int end = nums.length - 1;
while (end > low) {
if (nums[end] > nums[low]) return end;
end--;
}
return -1;
} | private int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_4 = var_0 . length - 1 ;
while ( var_4 > var_1 ) {
if ( var_0 [ var_4 ] > var_0 [ var_1 ] ) return var_4 ;
var_4 -- ;
}
return - 1 ;
}
|
912 | <awangdev>88. Merge Sorted Array_3.java | public void merge(int[] nums1, int m, int[] nums2, int n) {
if (nums1 == null || nums1.length == 0 || nums2 == null || nums2.length == 0) {
return;
}
int end = m + n - 1;
m--;
n--;
for (int i = end; i >= 0; i--) {
if (m >= 0 && n >= 0) {
... | public void var_0 ( int [ ] var_1 , int var_2 , int [ ] var_3 , int var_4 ) {
if ( var_1 == null || var_1 . length == 0 || var_3 == null || var_3 . length == 0 ) {
return ;
}
int var_9 = var_2 + var_4 - 1 ;
var_2 -- ;
var_4 -- ;
for ( int var_10 = var_9 ;
var_10 >= 0 ;
var_10 -- ) {
if ( var_2 >... |
913 | <awangdev>Line Reflection_1.java | public boolean isReflected(int[][] points) {
if (points == null || points.length == 0 || points[0] == null || points[0].length == 0) return true;
Map<Integer, Set<Double>> map = new HashMap<>();
for (int[] point : points) {
map.putIfAbsent(point[1], new HashSet<>());
... | public boolean var_0 ( int [ ] [ ] var_1 ) {
if ( var_1 == null || var_1 . length == 0 || var_1 [ 0 ] == null || var_1 [ 0 ] . length == 0 ) return true ;
Map < Integer , Set < Double >> var_10 = new HashMap < > ( ) ;
for ( int [ ] var_11 : var_1 ) {
var_10 . putIfAbsent ( var_11 [ 1 ] , new HashSet < > ( ) )... |
914 | <awangdev>Longest Increasing Continuous subsequence_2.java | public int dfs(int[] A, int[] dp, int[] flag, int i){
if (flag[i] == 1) {
return dp[i];
}
int ansLeft = 1;
int ansRight = 1;
flag[i] = -1;
if (i - 1 >= 0 && A[i - 1] < A[i] && flag[i - 1] != -1) {
ansLeft = dfs(A, dp, flag, i - 1) + 1;
}
... | public int sample_funcname ( int [ ] A , int [ ] dp , int [ ] flag , int i ) {
if ( flag [ i ] == 1 ) {
return dp [ i ] ;
}
int ansLeft = 1 ;
int ansRight = 1 ;
flag [ i ] = - 1 ;
if ( i - 1 >= 0 && A [ i - 1 ] < A [ i ] && flag [ i - 1 ] != - 1 ) {
ansLeft = dfs ( A , dp , flag , i - 1 ) + 1 ;
}
... |
915 | <awangdev>1048. Longest String Chain_1.java | public int longestStrChain(String[] words) {
int rst = 0;
Arrays.sort(words, Comparator.comparing(a -> a.length()));
HashMap<String, Integer> wordChainMap = new HashMap();
for (String word : words) {
if (wordChainMap.containsKey(word)) continue;
wordChainMap.put(w... | public int sample_funcname ( String [ ] var_1 ) {
int var_3 = 0 ;
Arrays . sort ( var_1 , Comparator . comparing ( var_8 -> var_8 . length ( ) ) ) ;
HashMap < String , Integer > var_12 = new HashMap ( ) ;
for ( String var_13 : var_1 ) {
if ( var_12 . containsKey ( var_13 ) ) continue ;
var_12 . put ( va... |
916 | <awangdev>1007. Minimum Domino Rotations For Equal Row_1.java | public int minDominoRotations(int[] A, int[] B) {
int[] countA = new int[7], countB = new int[7], overlap = new int[7];
int n = A.length;
for (int i = 0; i < n; ++i) {
countA[A[i]]++;
countB[B[i]]++;
if (A[i] == B[i]) overlap[A[i]]++;
}
for (in... | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
int [ ] var_3 = new int [ 7 ] , var_4 = new int [ 7 ] , var_5 = new int [ 7 ] ;
int var_7 = var_0 . length ;
for ( int var_9 = 0 ;
var_9 < var_7 ;
++ var_9 ) {
var_3 [ var_0 [ var_9 ] ] ++ ;
var_4 [ var_1 [ var_9 ] ] ++ ;
if ( var_0 [ ... |
917 | <awangdev>Interleaving String_1.java | public boolean isInterleave(String s1, String s2, String s3) {
if (s1 == null || s2 == null || s1.length() + s2.length() != s3.length()) {
return false;
}
int m = s1.length();
int n = s2.length();
boolean[][] dp = new boolean[m + 1][n + 1];
for (int i... | public boolean var_0 ( String var_2 , String var_3 , String var_4 ) {
if ( var_2 == null || var_3 == null || var_2 . length ( ) + var_3 . length ( ) != var_4 . length ( ) ) {
return false ;
}
int var_7 = var_2 . length ( ) ;
int var_8 = var_3 . length ( ) ;
boolean [ ] [ ] var_11 = new boolean [ var_7 + 1... |
918 | <awangdev>Decode String_1.java | private String popStack(Stack<Object> stack) {
StringBuffer sb = new StringBuffer();
while (!stack.isEmpty() && (stack.peek() instanceof String)) {
sb.insert(0, stack.pop());
}
return sb.toString();
} | private String var_0 ( Stack < Object > var_3 ) {
StringBuffer var_5 = new StringBuffer ( ) ;
while ( ! var_3 . isEmpty ( ) && ( var_3 . peek ( ) instanceof String ) ) {
var_5 . insert ( 0 , var_3 . pop ( ) ) ;
}
return var_5 . toString ( ) ;
}
|
919 | <awangdev>125. Valid Palindrome_2.java | public boolean isPalindrome(String s) {
if (s == null || s.length() <= 1) {
return true;
}
String str = s.replaceAll("[^a-zA-Z0-9]", "").toLowerCase();
int start = 0;
int end = str.length() - 1;
while (start < end) {
if (str.charAt(start) != str.ch... | public boolean var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . length ( ) <= 1 ) {
return true ;
}
String var_10 = var_2 . replaceAll ( "[^a-zA-Z0-9]" , "" ) . toLowerCase ( ) ;
int var_12 = 0 ;
int var_13 = var_10 . length ( ) - 1 ;
while ( var_12 < var_13 ) {
if ( var_10 . charAt ( var_12 )... |
920 | <awangdev>Find Peak Element II_2.java | private List<Integer> find(int x1, int x2, int y1, int y2, int[][] A) {
int midX = x1 + ((x2 - x1) >> 1);
int midY = y1 + ((y2 - y1) >> 1);
int x = midX, y = midY;
int max = A[x][y];
for (int j = y1; j <= y2; j++) {
if (A[midX][j] > max) {
max = A[... | private List < Integer > sample_funcname ( int x1 , int x2 , int y1 , int y2 , int [ ] [ ] A ) {
int midX = x1 + ( ( x2 - x1 ) >> 1 ) ;
int midY = y1 + ( ( y2 - y1 ) >> 1 ) ;
int x = midX , y = midY ;
int max = A [ x ] [ y ] ;
for ( int j = y1 ;
j <= y2 ;
j ++ ) {
if ( A [ midX ] [ j ] > max ) {
... |
921 | <awangdev>Ugly Number_2.java | public long kthPrimeNumber(int k) {
if (k == 0) {
return 0;
}
PriorityQueue<Long> queue = new PriorityQueue<Long>();
queue.offer((long)3);
queue.offer((long)5);
queue.offer((long)7);
long num = 0;
for (int i = 0; i < k; i++) {
num = queue.poll();
if (num % 3 == 0) {
... | public long sample_funcname ( int var_0 ) {
if ( var_0 == 0 ) {
return 0 ;
}
PriorityQueue < Long > var_4 = new PriorityQueue < Long > ( ) ;
var_4 . offer ( ( long ) 3 ) ;
var_4 . offer ( ( long ) 5 ) ;
var_4 . offer ( ( long ) 7 ) ;
long var_9 = 0 ;
for ( int var_10 = 0 ;
var_10 < var_0 ;
var_1... |
922 | <awangdev>Encode and Decode Strings_4.java | public static List<String> decode(String s) {
List<String> rst = new ArrayList<String>();
if (s.equals("NULL")) {
return rst;
}
int index = s.indexOf("LINE");
while (index != -1) {
String str = s.substring(0, index);
StringBuffer sb = new Stri... | public static List < String > var_1 ( String var_2 ) {
List < String > var_5 = new ArrayList < String > ( ) ;
if ( var_2 . equals ( "NULL" ) ) {
return var_5 ;
}
int var_10 = var_2 . indexOf ( "LINE" ) ;
while ( var_10 != - 1 ) {
String var_14 = var_2 . substring ( 0 , var_10 ) ;
StringBuffer var_... |
923 | <awangdev>Backpack III_1.java | public int backPackIII(int[] A, int[] V, int m) {
if (A == null || A.length == 0 || V == null || V.length == 0 || m <= 0) {
return 0;
}
int n = A.length;
int[][] dp = new int[n + 1][m + 1];
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for... | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 , int var_2 ) {
if ( var_0 == null || var_0 . length == 0 || var_1 == null || var_1 . length == 0 || var_2 <= 0 ) {
return 0 ;
}
int var_6 = var_0 . length ;
int [ ] [ ] var_8 = new int [ var_6 + 1 ] [ var_2 + 1 ] ;
var_8 [ 0 ] [ 0 ] = 0 ;
for (... |
924 | <awangdev>Wildcard Matching_1.java | public boolean isMatch(String s, String p) {
if (s == null || p == null) return false;
int m = s.length(), n = p.length();
boolean[][] dp = new boolean[m + 1][n + 1];
char[] ss = s.toCharArray();
char[] pp = p.toCharArray();
for (int i = 0; i <= m; i++) {
... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 == null || var_3 == null ) return false ;
int var_6 = var_2 . length ( ) , var_7 = var_3 . length ( ) ;
boolean [ ] [ ] var_10 = new boolean [ var_6 + 1 ] [ var_7 + 1 ] ;
char [ ] var_12 = var_2 . toCharArray ( ) ;
char [ ] var_13 = var_3 . toC... |
925 | <awangdev>Word Ladder_1.java | private List<String> transform(Set<String> words, String word) {
List<String> candidates = new ArrayList<>();
StringBuffer sb = new StringBuffer(word);
for (int i = 0; i < sb.length(); i++) {
char temp = sb.charAt(i);
for (char c = 'a'; c <= 'z'; c++) {
i... | private List < String > var_1 ( Set < String > var_3 , String var_4 ) {
List < String > var_7 = new ArrayList < > ( ) ;
StringBuffer var_9 = new StringBuffer ( var_4 ) ;
for ( int var_11 = 0 ;
var_11 < var_9 . length ( ) ;
var_11 ++ ) {
char var_14 = var_9 . charAt ( var_11 ) ;
for ( char var_16 = 'a'... |
926 | <awangdev>Ugly Number II_3.java | public int nthUglyNumber(int n) {
if (n <= 0) {
return 0;
} else if (n == 1) {
return 1;
}
long[] dp = new long[n + 1];
dp[0] = 0;
dp[1] = 1;
PriorityQueue<Long> candidate = new PriorityQueue<Long>();
HashSet<Long> set = new HashSet<Long>();
... | public int sample_funcname ( int var_0 ) {
if ( var_0 <= 0 ) {
return 0 ;
}
else if ( var_0 == 1 ) {
return 1 ;
}
long [ ] var_3 = new long [ var_0 + 1 ] ;
var_3 [ 0 ] = 0 ;
var_3 [ 1 ] = 1 ;
PriorityQueue < Long > var_6 = new PriorityQueue < Long > ( ) ;
HashSet < Long > var_8 = new HashSet <... |
927 | <awangdev>Palindrome Partitioning II_2.java | private boolean[][] calcPalindrome(char[] s) {
int n = s.length;
boolean[][] palindrome = new boolean[n][n];
for (int mid = 0; mid < n; mid++) {
int i = mid, j = mid;
while (i >= 0 && j < n && s[i] == s[j]) {
palindrome[i][j] = true;
... | private boolean [ ] [ ] var_0 ( char [ ] var_1 ) {
int var_3 = var_1 . length ;
boolean [ ] [ ] var_5 = new boolean [ var_3 ] [ var_3 ] ;
for ( int var_7 = 0 ;
var_7 < var_3 ;
var_7 ++ ) {
int var_8 = var_7 , var_9 = var_7 ;
while ( var_8 >= 0 && var_9 < var_3 && var_1 [ var_8 ] == var_1 [ var_9 ] ) {... |
928 | <awangdev>727. Minimum Window Subsequence_4.java | private int backtrack(char[] ss, char[] tt, int sIndex) {
for (int i = tt.length - 1; i >= 0; i--) {
while(ss[sIndex--] != tt[i]);
}
return ++sIndex;
} | private int sample_funcname ( char [ ] var_0 , char [ ] var_1 , int var_2 ) {
for ( int var_5 = var_1 . length - 1 ;
var_5 >= 0 ;
var_5 -- ) {
while ( var_0 [ var_2 -- ] != var_1 [ var_5 ] ) ;
}
return ++ var_2 ;
}
|
929 | <awangdev>Backpack II_8.java | public int backPackII(int m, int[] A, int V[]) {
if (A == null || V == null || A.length == 0 || V.length == 0 || A.length != V.length || m <= 0) {
return 0;
}
int[]dp = new int[m + 1];
dp[0] = 0;
for (int i = 1; i <= A.length; i++) {
for (int j = m; j >= 0; j--) {
if (j - A... | public int sample_funcname ( int var_0 , int [ ] var_1 , int var_2 [ ] ) {
if ( var_1 == null || var_2 == null || var_1 . length == 0 || var_2 . length == 0 || var_1 . length != var_2 . length || var_0 <= 0 ) {
return 0 ;
}
int [ ] var_7 = new int [ var_0 + 1 ] ;
var_7 [ 0 ] = 0 ;
for ( int var_8 = 1 ;
... |
930 | <awangdev>229. Majority Element II_2.java | private void addResult(List<Integer> result, int n, int value, int count) {
if (!result.contains(value) && count > n / 3) {
result.add(value);
}
} | private void var_0 ( List < Integer > var_3 , int var_4 , int var_5 , int var_6 ) {
if ( ! var_3 . contains ( var_5 ) && var_6 > var_4 / 3 ) {
var_3 . add ( var_5 ) ;
}
}
|
931 | <awangdev>169. Majority Element_2.java | public int majorityElement(int[] nums) {
if (nums == null || nums.length == 0) {
return -1;
}
Arrays.sort(nums);
return nums[nums.length / 2];
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return - 1 ;
}
Arrays . sort ( var_0 ) ;
return var_0 [ var_0 . length / 2 ] ;
}
|
932 | <awangdev>Longest Common Subsequence_3.java | public int longestCommonSubsequence(String A, String B) {
if (A == null || B == null || A.length() == 0 || B.length() == 0) {
return 0;
}
int m = A.length();
int n = B.length();
int[][] dp = new int[m + 1][n + 1];
int[][] pi = new int[m + 1][n + 1];
... | public int sample_funcname ( String var_1 , String var_2 ) {
if ( var_1 == null || var_2 == null || var_1 . length ( ) == 0 || var_2 . length ( ) == 0 ) {
return 0 ;
}
int var_6 = var_1 . length ( ) ;
int var_7 = var_2 . length ( ) ;
int [ ] [ ] var_9 = new int [ var_6 + 1 ] [ var_7 + 1 ] ;
int [ ] [ ] ... |
933 | <awangdev>Power of Three_2.java | public boolean isPowerOfThree(int n) {
if (n <= 0) {
return false;
}
if (n == 1) {
return true;
}
if (n % 3 != 0) {
return false;
}
return isPowerOfThree(n / 3);
} | public boolean sample_funcname ( int n ) {
if ( n <= 0 ) {
return false ;
}
if ( n == 1 ) {
return true ;
}
if ( n % 3 != 0 ) {
return false ;
}
return isPowerOfThree ( n / 3 ) ;
}
|
934 | <awangdev>Group Shifted Strings_2.java | public List<List<String>> groupStrings(String[] strings) {
List<List<String>> rst = new ArrayList<List<String>>();
if (strings == null || strings.length == 0) {
return rst;
}
Arrays.sort(strings);
HashMap<String, ArrayList<String>> map = new HashMap<String, ArrayList<... | public List < List < String >> var_2 ( String [ ] var_3 ) {
List < List < String >> var_5 = new ArrayList < List < String >> ( ) ;
if ( var_3 == null || var_3 . length == 0 ) {
return var_5 ;
}
Arrays . sort ( var_3 ) ;
HashMap < String , ArrayList < String >> var_12 = new HashMap < String , ArrayList < S... |
935 | <awangdev>Shuffle an Array_1.java | private void swap(int[] nums, int x, int y) {
int temp = nums[y];
nums[y] = nums[x];
nums[x] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_4 ;
}
|
936 | <awangdev>Distinct Subsequences_4.java | public int numDistinct(String S, String T) {
if (S.length() == 0) {
return T.length() == 0 ? 1 : 0;
}
if (T.length() == 0) {
return 1;
}
int count = 0;
for (int i = 0; i < S.length(); i++) {
if (S.charAt(i) == T.charAt(0)) {
... | public int sample_funcname ( String S , String T ) {
if ( S . length ( ) == 0 ) {
return T . length ( ) == 0 ? 1 : 0 ;
}
if ( T . length ( ) == 0 ) {
return 1 ;
}
int count = 0 ;
for ( int i = 0 ;
i < S . length ( ) ;
i ++ ) {
if ( S . charAt ( i ) == T . charAt ( 0 ) ) {
count += numD... |
937 | <awangdev>305. Number of Islands II_2.java | private boolean validateInput(int m, int n, int[][] positions) {
return m <= 0 || n <= 0 || positions == null || positions.length == 0 || positions[0] == null || positions[0].length == 0;
} | private boolean var_0 ( int var_1 , int var_2 , int [ ] [ ] var_3 ) {
return var_1 <= 0 || var_2 <= 0 || var_3 == null || var_3 . length == 0 || var_3 [ 0 ] == null || var_3 [ 0 ] . length == 0 ;
}
|
938 | <awangdev>485. Max Consecutive Ones_1.java | public int findMaxConsecutiveOnes(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int maxCount = 0;
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) {
maxCount = Math.max(count, maxCount);
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 == null || var_0 . length == 0 ) {
return 0 ;
}
int var_4 = 0 ;
int var_5 = 0 ;
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
if ( var_0 [ var_6 ] == 0 ) {
var_4 = Math . max ( var_5 , var_4 ) ;
var_5 = 0 ;
}
... |
939 | <awangdev>43. Multiply Strings_1.java | private char toChar(int num) {
return (char)(num + '0');
} | private char sample_funcname ( int var_0 ) {
return ( char ) ( var_0 + '0' ) ;
}
|
940 | <awangdev>Coins in a Line_4.java | public boolean firstWillWin(int n) {
if (n <= 0) {
return false;
}
if (n <= 2) {
return true;
}
boolean[] dp = new boolean[n + 1];
dp[1] = true;
dp[2] = true;
dp[3] = false;
for (int i = 4; i <= n; i++) {
dp[i] = dp[i - 3];
}
return d... | public boolean var_0 ( int var_1 ) {
if ( var_1 <= 0 ) {
return false ;
}
if ( var_1 <= 2 ) {
return true ;
}
boolean [ ] var_6 = new boolean [ var_1 + 1 ] ;
var_6 [ 1 ] = true ;
var_6 [ 2 ] = true ;
var_6 [ 3 ] = false ;
for ( int var_8 = 4 ;
var_8 <= var_1 ;
var_8 ++ ) {
var_6 [ var_... |
941 | <awangdev>140. Word Break II_4.java | public boolean[] validatePossibility(List<String> wordDict, boolean[][] isWord, String s) {
int maxLen = 0;
for (String word : wordDict) {
maxLen = Math.max(maxLen, word.length());
}
int n = s.length();
boolean[] isValid = new boolean[n + 1];
isValid[n] = tru... | public boolean [ ] var_0 ( List < String > var_3 , boolean [ ] [ ] var_5 , String var_6 ) {
int var_8 = 0 ;
for ( String var_9 : var_3 ) {
var_8 = Math . max ( var_8 , var_9 . length ( ) ) ;
}
int var_13 = var_6 . length ( ) ;
boolean [ ] var_15 = new boolean [ var_13 + 1 ] ;
var_15 [ var_13 ] = true ;
... |
942 | <awangdev>15. 3Sum_2.java | public ArrayList<ArrayList<Integer>> calTwoSum(int[] num, int end, int target) {
ArrayList<ArrayList<Integer>> rst = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> match;
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
for (int i = 0; i <= end; i++) {
... | public ArrayList < ArrayList < Integer >> var_2 ( int [ ] var_3 , int var_4 , int var_5 ) {
ArrayList < ArrayList < Integer >> var_6 = new ArrayList < ArrayList < Integer >> ( ) ;
ArrayList < Integer > var_7 ;
HashMap < Integer , Integer > var_9 = new HashMap < Integer , Integer > ( ) ;
for ( int var_11 = 0 ;
... |
943 | <awangdev>405. Convert a Number to Hexadecimal_1.java | private String convert(int digit) {
if (digit <= 9) return String.valueOf((char)(digit + '0'));
return String.valueOf((char)(digit - 10 + 'a'));
} | private String var_0 ( int var_1 ) {
if ( var_1 <= 9 ) return String . valueOf ( ( char ) ( var_1 + '0' ) ) ;
return String . valueOf ( ( char ) ( var_1 - 10 + 'a' ) ) ;
}
|
944 | <awangdev>496. Next Greater Element I_1.java | private Map<Integer, Integer> generateSubMap(int[] base) {
Stack<Integer> stack = new Stack<>();
Map<Integer, Integer> baseMap = new HashMap<>();
for (int num : base) {
while (!stack.isEmpty() && stack.peek() < num) {
int pop = stack.pop();
baseMap.pu... | private Map < Integer , Integer > var_1 ( int [ ] var_2 ) {
Stack < Integer > var_4 = new Stack < > ( ) ;
Map < Integer , Integer > var_7 = new HashMap < > ( ) ;
for ( int var_8 : var_2 ) {
while ( ! var_4 . isEmpty ( ) && var_4 . peek ( ) < var_8 ) {
int pop = var_4 . pop ( ) ;
var_7 . put ( pop ... |
945 | <gouthampradhan>two_pointers_NumberOfMatchingSubsequences_1.java | private boolean isSubsequence(String S, String P) {
int i = 0, j = 0;
if (P.length() > S.length()) return false;
for (; ; ) {
if (j >= P.length()) return true;
else if (i >= S.length()) return false;
else {
if (S.charAt(i) == P.charAt(j)) {
i++;
j++;
} e... | private boolean var_0 ( String var_2 , String var_3 ) {
int var_5 = 0 , var_6 = 0 ;
if ( var_3 . length ( ) > var_2 . length ( ) ) return false ;
for ( ;
;
) {
if ( var_6 >= var_3 . length ( ) ) return true ;
else if ( var_5 >= var_2 . length ( ) ) return false ;
else {
if ( var_2 . charAt (... |
946 | <gouthampradhan>array_BattleshipsInABoard_1.java | public int countBattleships(char[][] board) {
int count = 0;
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[0].length; j++) {
if (board[i][j] == 'X') {
if (i - 1 >= 0) {
if (board[i - 1][j] == 'X') continue;
}
if (j - 1 >= 0) {
... | public int sample_funcname ( char [ ] [ ] var_0 ) {
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_0 [ 0 ] . length ;
var_5 ++ ) {
if ( var_0 [ var_3 ] [ var_5 ] == 'X' ) {
if ( var_3 - 1 >= 0 ) {
if ( var_0 [ var... |
947 | <gouthampradhan>binary_search_MedianOfTwoSortedArrays_1.java | public double findMedianSortedArrays(int[] nums1, int[] nums2) {
if (nums1.length > nums2.length)
return findMedianSortedArrays(nums2, nums1);
int T = nums1.length + nums2.length, low = -1, high = -1;
int median = (T - 1) / 2;
boolean isOdd = false;
if ((T % 2) != 0) isOdd = true;
int s =... | public double sample_funcname ( int [ ] nums1 , int [ ] nums2 ) {
if ( nums1 . length > nums2 . length ) return findMedianSortedArrays ( nums2 , nums1 ) ;
int T = nums1 . length + nums2 . length , low = - 1 , high = - 1 ;
int median = ( T - 1 ) / 2 ;
boolean isOdd = false ;
if ( ( T % 2 ) != 0 ) isOdd = true ... |
948 | <gouthampradhan>dynamic_programming_PaintHouseII_1.java | public int minCostII(int[][] costs) {
if (costs.length == 0) return 0;
int[][] lMin = new int[costs.length][costs[0].length];
int[][] rMin = new int[costs.length][costs[0].length];
for (int i = costs.length - 2; i >= 0; i--) {
int min = Integer.MAX_VALUE;
for (int j = 0; j < costs[0].length;... | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int [ ] [ ] var_3 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ;
int [ ] [ ] var_4 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ;
for ( int var_6 = var_0 . length - 2 ;
var_6 >= 0 ;
var_6 -- ) {
in... |
949 | <gouthampradhan>dynamic_programming_LongestIncreasingSubsequence_1.java | public int lengthOfLIS(int[] nums) {
if (nums.length == 0) return 0;
int[] A = new int[nums.length];
int max = Integer.MIN_VALUE;
for (int i = 0, l = nums.length; i < l; i++) {
int lis = 1;
for (int j = 0; j < i; j++) {
if (nums[i] > nums[j]) lis = Math.max(lis, A[j] + 1);
}
... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int [ ] var_3 = new int [ var_0 . length ] ;
int max = Integer . MIN_VALUE ;
for ( int var_7 = 0 , var_8 = var_0 . length ;
var_7 < var_8 ;
var_7 ++ ) {
int var_10 = 1 ;
for ( int var_11 = 0 ;
var_11 < var_7 ;
... |
950 | <gouthampradhan>dynamic_programming_PalindromePartitioningIII_1.java | private int count(String s) {
int cnt = 0;
for (int i = 0, j = s.length() - 1; i < j; i++, j--) {
if (s.charAt(i) != s.charAt(j)) {
cnt++;
}
}
return cnt;
} | private int sample_funcname ( String var_1 ) {
int var_3 = 0 ;
for ( int var_4 = 0 , var_7 = var_1 . length ( ) - 1 ;
var_4 < var_7 ;
var_4 ++ , var_7 -- ) {
if ( var_1 . charAt ( var_4 ) != var_1 . charAt ( var_7 ) ) {
var_3 ++ ;
}
}
return var_3 ;
}
|
951 | <gouthampradhan>binary_search_HIndexII_1.java | public int hIndex(int[] citations) {
if (citations.length == 0) return 0;
int s = 0, e = citations.length;
int ans = -1;
while (s < e) {
int m = (s + e) >>> 1;
int cit = citations.length - m;
if (citations[m] > cit) {
if (ans < cit) {
ans = cit;
}
e = ... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int var_3 = 0 , var_4 = var_0 . length ;
int var_6 = - 1 ;
while ( var_3 < var_4 ) {
int var_7 = ( var_3 + var_4 ) >>> 1 ;
int var_8 = var_0 . length - var_7 ;
if ( var_0 [ var_7 ] > var_8 ) {
if ( var_6 < var... |
952 | <gouthampradhan>array_IncreasingTripletSubsequence_1.java | public boolean increasingTriplet(int[] nums) {
int[] A = new int[3];
Arrays.fill(A, Integer.MAX_VALUE);
for (int num : nums) {
if (num < A[0]) {
A[0] = num;
} else if (num < A[1] && num > A[0]) {
A[1] = num;
} else if (num < A[2] && num > A[1]) {
return true;
... | public boolean var_0 ( int [ ] var_1 ) {
int [ ] var_3 = new int [ 3 ] ;
Arrays . fill ( var_3 , Integer . MAX_VALUE ) ;
for ( int var_8 : var_1 ) {
if ( var_8 < var_3 [ 0 ] ) {
var_3 [ 0 ] = var_8 ;
}
else if ( var_8 < var_3 [ 1 ] && var_8 > var_3 [ 0 ] ) {
var_3 [ 1 ] = var_8 ;
}
... |
953 | <gouthampradhan>string_ZigZagConversion_1.java | public String convert(String s, int numRows) {
if (s == null || s.length() <= numRows || numRows == 1) return s;
List<String> list = new ArrayList<>();
char[] A = new char[numRows];
int direction = 1;
int n = 1;
A[0] = s.charAt(0);
for (int j = 1; j < numRows; ) {
if (n >= s.length())... | public String var_0 ( String var_2 , int var_3 ) {
if ( var_2 == null || var_2 . length ( ) <= var_3 || var_3 == 1 ) return var_2 ;
List < String > var_9 = new ArrayList < > ( ) ;
char [ ] var_10 = new char [ var_3 ] ;
int var_11 = 1 ;
int var_12 = 1 ;
var_10 [ 0 ] = var_2 . charAt ( 0 ) ;
for ( int var_1... |
954 | <gouthampradhan>dynamic_programming_MaximumSubarray_1.java | public int maxSubArray(int[] nums) {
if (nums.length == 1) return nums[0];
int max = nums[nums.length - 1];
for (int i = nums.length - 2; i >= 0; i--) {
nums[i] = Math.max(nums[i], nums[i] + nums[i + 1]);
max = Math.max(max, nums[i]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return var_0 [ 0 ] ;
int max = var_0 [ var_0 . length - 1 ] ;
for ( int var_6 = var_0 . length - 2 ;
var_6 >= 0 ;
var_6 -- ) {
var_0 [ var_6 ] = Math . max ( var_0 [ var_6 ] , var_0 [ var_6 ] + var_0 [ var_6 + 1 ] ) ;
max = Math... |
955 | <gouthampradhan>greedy_StringWithout3A3B_1.java | public String strWithout3a3b(int A, int B) {
StringBuilder sb = new StringBuilder();
while (A > 0 || B > 0) {
if (A > B && A > 1 && B > 0) {
sb.append("a").append("a");
sb.append("b");
A -= 2;
B -= 1;
} else if (B > A && B > 1 && A > 0) {
sb.append("b").append... | public String var_0 ( int var_1 , int var_2 ) {
StringBuilder var_4 = new StringBuilder ( ) ;
while ( var_1 > 0 || var_2 > 0 ) {
if ( var_1 > var_2 && var_1 > 1 && var_2 > 0 ) {
var_4 . append ( "a" ) . append ( "a" ) ;
var_4 . append ( "b" ) ;
var_1 -= 2 ;
var_2 -= 1 ;
}
else if... |
956 | <gouthampradhan>string_ReverseWordsII_1.java | public void reverseWords(char[] s) {
for (int i = 0, j = s.length - 1; i < j; i++, j--) {
char temp = s[i];
s[i] = s[j];
s[j] = temp;
}
for (int i = 0, j = 0, l = s.length; i < l; ) {
if (s[i] == ' ') {
if (s[i - 1] == ' ') {
j = i;
i++;
j++;
... | public void var_0 ( char [ ] var_1 ) {
for ( int var_3 = 0 , var_6 = var_1 . length - 1 ;
var_3 < var_6 ;
var_3 ++ , var_6 -- ) {
char var_7 = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_1 [ var_6 ] ;
var_1 [ var_6 ] = var_7 ;
}
for ( int var_3 = 0 , var_6 = 0 , var_8 = var_1 . length ;
var_3 < var_... |
957 | <gouthampradhan>math_NthMagicalNumber_1.java | private int check(int N, long num, int A, int B, long lcm) {
long sum = (num / A) + (num / B);
long common = num / lcm;
sum -= common;
if (sum == N) return 0;
else if (sum > N) return 1;
else return -1;
} | private int sample_funcname ( int var_0 , long var_1 , int var_2 , int var_3 , long var_4 ) {
long var_5 = ( var_1 / var_2 ) + ( var_1 / var_3 ) ;
long var_6 = var_1 / var_4 ;
var_5 -= var_6 ;
if ( var_5 == var_0 ) return 0 ;
else if ( var_5 > var_0 ) return 1 ;
else return - 1 ;
}
|
958 | <gouthampradhan>string_OneEditDistance_1.java | private boolean hasDiffOne(String s, String t, boolean sameLength) {
int count = 0, i = 0, j = 0;
for (int l1 = s.length(), l2 = t.length(); i < l1 && j < l2; ) {
if (s.charAt(i) == t.charAt(j)) {
i++;
j++;
} else {
if (count > 0) return false;
count++;
if (sa... | private boolean var_0 ( String var_2 , String var_3 , boolean var_5 ) {
int var_7 = 0 , var_8 = 0 , var_9 = 0 ;
for ( int var_11 = var_2 . length ( ) , var_12 = var_3 . length ( ) ;
var_8 < var_11 && var_9 < var_12 ;
) {
if ( var_2 . charAt ( var_8 ) == var_3 . charAt ( var_9 ) ) {
var_8 ++ ;
va... |
959 | <gouthampradhan>two_pointers_SubarraysWithKDifferentIntegers_1.java | private int calculate(int[] A, int K) {
int count = 0;
int[] frequency = new int[A.length + 1];
int currCount = 0;
for (int i = 0, j = 0; i < A.length; i++) {
frequency[A[i]]++;
if (frequency[A[i]] == 1) {
currCount++;
}
while (currCount > K) {
frequency[A[j]]--;
... | private int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_3 = 0 ;
int [ ] var_6 = new int [ var_0 . length + 1 ] ;
int var_7 = 0 ;
for ( int var_8 = 0 , var_9 = 0 ;
var_8 < var_0 . length ;
var_8 ++ ) {
var_6 [ var_0 [ var_8 ] ] ++ ;
if ( var_6 [ var_0 [ var_8 ] ] == 1 ) {
var_7 ++ ;... |
960 | <gouthampradhan>dynamic_programming_LargestSumOfAverages_1.java | public double largestSumOfAverages(int[] A, int K) {
double[][] dp = new double[K][A.length];
for (int i = dp[0].length - 1; i >= 0; i--) {
dp[0][i] = A[i];
if (i + 1 < dp[0].length) {
dp[0][i] += dp[0][i + 1];
}
}
for (int i = dp[0].length - 1, j = 1; i >= 0; i--, j++) {
... | public double sample_funcname ( int [ ] var_0 , int var_1 ) {
double [ ] [ ] var_3 = new double [ var_1 ] [ var_0 . length ] ;
for ( int var_6 = var_3 [ 0 ] . length - 1 ;
var_6 >= 0 ;
var_6 -- ) {
var_3 [ 0 ] [ var_6 ] = var_0 [ var_6 ] ;
if ( var_6 + 1 < var_3 [ 0 ] . length ) {
var_3 [ 0 ] [ va... |
961 | <gouthampradhan>hashing_StringTransformsIntoAnotherString_1.java | public boolean canConvert(String str1, String str2) {
if (str1.length() != str2.length()) return false;
if (str1.equals(str2)) return true;
Map<Character, Character> mapping = new HashMap<>();
for (int i = 0; i < str1.length(); i++) {
char c1 = str1.charAt(i);
char c2 = str2.charAt(i);
... | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 . length ( ) != var_3 . length ( ) ) return false ;
if ( var_2 . equals ( var_3 ) ) return true ;
Map < Character , Character > var_9 = new HashMap < > ( ) ;
for ( int var_11 = 0 ;
var_11 < var_2 . length ( ) ;
var_11 ++ ) {
char var_13 =... |
962 | <gouthampradhan>backtracking_Subsets_1.java | public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
result.add(new ArrayList<>());
for (int i = 0, l = nums.length; i < l; i++) {
for (int j = 0, resLen = result.size(); j < resLen; j++) {
List<Integer> newList = new ArrayList<>(result.get(j));
... | public List < List < Integer >> var_2 ( int [ ] var_3 ) {
List < List < Integer >> var_5 = new ArrayList < > ( ) ;
var_5 . add ( new ArrayList < > ( ) ) ;
for ( int var_8 = 0 , var_10 = var_3 . length ;
var_8 < var_10 ;
var_8 ++ ) {
for ( int var_11 = 0 , var_13 = var_5 . size ( ) ;
var_11 < var_13 ;
... |
963 | <gouthampradhan>dynamic_programming_LongestPaliandromicSubstring_1.java | public String longestPalindrome(String s) {
int l = s.length();
int startIndex = 0;
int maxLen = 1;
boolean[][] A = new boolean[l][l];
for (int i = 0, j = 0; i < l; i++, j++) A[i][j] = true;
for (int i = 0, j = i + 1; j < l; i++, j++) {
if (s.charAt(i) == s.charAt(j)) {
A[i][j] = t... | public String var_0 ( String var_2 ) {
int var_4 = var_2 . length ( ) ;
int var_6 = 0 ;
int var_8 = 1 ;
boolean [ ] [ ] var_10 = new boolean [ var_4 ] [ var_4 ] ;
for ( int var_11 = 0 , var_12 = 0 ;
var_11 < var_4 ;
var_11 ++ , var_12 ++ ) var_10 [ var_11 ] [ var_12 ] = true ;
for ( int var_11 = 0 , var... |
964 | <gouthampradhan>dynamic_programming_StoneGameIV_2.java | private void genSquare(int sq, int limit, Set<Integer> perfectSquare) {
if (!perfectSquare.contains(sq)) {
perfectSquare.add(sq);
if (((long) sq * sq) <= limit) {
genSquare(sq * sq, limit, perfectSquare);
}
}
} | private void sample_funcname ( int sq , int limit , Set < Integer > perfectSquare ) {
if ( ! perfectSquare . contains ( sq ) ) {
perfectSquare . add ( sq ) ;
if ( ( ( long ) sq * sq ) <= limit ) {
genSquare ( sq * sq , limit , perfectSquare ) ;
}
}
}
|
965 | <gouthampradhan>hashing_SubstringConcatenationOfWords_1.java | public List<Integer> findSubstring(String s, String[] words) {
if (words.length == 0) return new ArrayList<>();
int wLen = words[0].length();
int sLen = wLen * words.length;
List<Integer> result = new ArrayList<>();
if (sLen > s.length()) return result;
Map<String, Integer> countMap = new HashMa... | public List < Integer > var_1 ( String var_3 , String [ ] var_4 ) {
if ( var_4 . length == 0 ) return new ArrayList < > ( ) ;
int var_8 = var_4 [ 0 ] . length ( ) ;
int var_9 = var_8 * var_4 . length ;
List < Integer > var_11 = new ArrayList < > ( ) ;
if ( var_9 > var_3 . length ( ) ) return var_11 ;
Map < ... |
966 | <gouthampradhan>greedy_LemonadeChange_1.java | public boolean lemonadeChange(int[] bills) {
int five = 0, ten = 0;
for (int b : bills) {
if (b == 5) {
five++;
} else if (b == 10) {
ten++;
if (five > 0) {
five--;
} else {
return false;
}
} else {
if (ten > 0 && five > 0) {
... | public boolean var_0 ( int [ ] var_1 ) {
int var_3 = 0 , var_4 = 0 ;
for ( int var_5 : var_1 ) {
if ( var_5 == 5 ) {
var_3 ++ ;
}
else if ( var_5 == 10 ) {
var_4 ++ ;
if ( var_3 > 0 ) {
var_3 -- ;
}
else {
return false ;
}
}
else {
if ( v... |
967 | <gouthampradhan>dynamic_programming_ContinuousSubarraySum_1.java | public boolean checkSubarraySum(int[] nums, int k) {
Map<Integer, Integer> map = new HashMap<>();
int sum = 0;
map.put(0, -1);
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
int mod = (k == 0) ? sum : sum % k;
if (map.containsKey(mod)) {
if (i - map.get(mod) > 1) {
... | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
Map < Integer , Integer > var_6 = new HashMap < > ( ) ;
int var_8 = 0 ;
var_6 . put ( 0 , - 1 ) ;
for ( int var_11 = 0 ;
var_11 < var_1 . length ;
var_11 ++ ) {
var_8 += var_1 [ var_11 ] ;
int var_13 = ( var_2 == 0 ) ? var_8 : var_8 % var_2 ;
... |
968 | <gouthampradhan>heap_Candy_1.java | public int candy(int[] ratings) {
if (ratings.length == 1) return 1;
PriorityQueue<Integer> pq =
new PriorityQueue<>((o1, o2) -> Integer.compare(ratings[o1], ratings[o2]));
for (int i = 0; i < ratings.length; i++) {
pq.offer(i);
}
int[] count = new int[ratings.length];
while (!pq.i... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return 1 ;
PriorityQueue < Integer > var_8 = new PriorityQueue < > ( ( var_5 , var_6 ) -> Integer . compare ( var_0 [ var_5 ] , var_0 [ var_6 ] ) ) ;
for ( int var_10 = 0 ;
var_10 < var_0 . length ;
var_10 ++ ) {
var_8 . offer ( var... |
969 | <gouthampradhan>string_MultiplyStrings_1.java | private String add(String s1, String s2) {
String result = "";
int carry = 0;
int i = s1.length() - 1, j = s2.length() - 1;
for (; i >= 0 || j >= 0; i--, j--) {
int l = (i >= 0) ? Integer.parseInt(String.valueOf(s1.charAt(i))) : 0;
int r = (j >= 0) ? Integer.parseInt(String.valueOf(s2.charAt... | private String var_0 ( String var_2 , String var_3 ) {
String var_5 = "" ;
int var_7 = 0 ;
int var_10 = var_2 . length ( ) - 1 , var_11 = var_3 . length ( ) - 1 ;
for ( ;
var_10 >= 0 || var_11 >= 0 ;
var_10 -- , var_11 -- ) {
int var_16 = ( var_10 >= 0 ) ? Integer . parseInt ( String . valueOf ( var_2 .... |
970 | <gouthampradhan>dynamic_programming_NonNegativeIntegersWithoutConsecutiveOnes_1.java | public int findIntegers(int num) {
int msbIndex = 0;
for (int i = 0; i < 31; i++) {
if (((1 << i) & num) > 0) {
msbIndex = i;
}
}
int[][] DP1 = new int[2][msbIndex + 1];
int[][] DP2 = new int[2][msbIndex + 2];
for (int i = msbIndex; i >= 0; i--) {
if (i == msbIndex) {... | public int sample_funcname ( int var_0 ) {
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < 31 ;
var_3 ++ ) {
if ( ( ( 1 << var_3 ) & var_0 ) > 0 ) {
var_2 = var_3 ;
}
}
int [ ] [ ] var_7 = new int [ 2 ] [ var_2 + 1 ] ;
int [ ] [ ] var_8 = new int [ 2 ] [ var_2 + 2 ] ;
for ( int var_3 = var_2... |
971 | <gouthampradhan>dynamic_programming_BombEnemy_1.java | public int maxKilledEnemies(char[][] grid) {
int[][] DP1 = new int[grid.length][grid[0].length];
int[][] DP2 = new int[grid.length][grid[0].length];
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == 'E') {
DP1[i][j] = 1;
}
... | public int sample_funcname ( char [ ] [ ] var_0 ) {
int [ ] [ ] var_3 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ;
int [ ] [ ] var_4 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 < var_0 [ 0 ] ... |
972 | <gouthampradhan>hashing_MaximumSizeSubarraySumEqualsk_1.java | public int maxSubArrayLen(int[] nums, int k) {
Map<Integer, Integer> index = new HashMap<>();
int sum = 0;
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
index.putIfAbsent(sum, i);
}
sum = 0;
int ans = 0;
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
Map < Integer , Integer > var_5 = new HashMap < > ( ) ;
int var_7 = 0 ;
for ( int var_8 = 0 ;
var_8 < var_0 . length ;
var_8 ++ ) {
var_7 += var_0 [ var_8 ] ;
var_5 . putIfAbsent ( var_7 , var_8 ) ;
}
var_7 = 0 ;
int var_11 = 0 ;
for (... |
973 | <gouthampradhan>string_RepeatedSubstringPattern_1.java | public boolean repeatedSubstringPattern(String s) {
boolean found;
for (int i = 1, l = s.length(); i < l; i++) {
found = true;
String subI = s.substring(0, i);
int j = i;
if (j >= l) return false;
while (j < l) {
if ((j + i) >= l + 1) return false;
String subJ = s.s... | public boolean var_0 ( String var_2 ) {
boolean var_4 ;
for ( int var_6 = 1 , var_8 = var_2 . length ( ) ;
var_6 < var_8 ;
var_6 ++ ) {
var_4 = true ;
String var_11 = var_2 . substring ( 0 , var_6 ) ;
int var_12 = var_6 ;
if ( var_12 >= var_8 ) return false ;
while ( var_12 < var_8 ) {
... |
974 | <gouthampradhan>dynamic_programming_StoneGame_1.java | private int dp(int[][] A, int[] piles, int i, int j, int sum, int p, int sumA, int sumB) {
if (A[p][sum] != -1) return A[p][sum];
else {
if (p == 0) {
if (i <= j) {
int result = dp(A, piles, i + 1, j, sum - piles[i], (p + 1) % 2, sumA + piles[i], sumB);
if (result == 0) {
... | private int sample_funcname ( int [ ] [ ] A , int [ ] piles , int i , int j , int sum , int p , int sumA , int sumB ) {
if ( A [ p ] [ sum ] != - 1 ) return A [ p ] [ sum ] ;
else {
if ( p == 0 ) {
if ( i <= j ) {
int result = dp ( A , piles , i + 1 , j , sum - piles [ i ] , ( p + 1 ) % 2 , sumA +... |
975 | <gouthampradhan>hashing_BrickWall_1.java | public int leastBricks(List<List<Integer>> wall) {
for (List<Integer> row : wall) {
int prefix = 0;
for (int i = 0, l = row.size(); i < l; i++) {
prefix += row.get(i);
row.set(i, prefix);
}
}
int result = Integer.MIN_VALUE;
Map<Integer, Integer> map = new HashMap<>();
... | public int sample_funcname ( List < List < Integer >> var_2 ) {
for ( List < Integer > var_3 : var_2 ) {
int var_5 = 0 ;
for ( int var_6 = 0 , var_8 = var_3 . size ( ) ;
var_6 < var_8 ;
var_6 ++ ) {
var_5 += var_3 . get ( var_6 ) ;
var_3 . set ( var_6 , var_5 ) ;
}
}
int var_12 = I... |
976 | <gouthampradhan>backtracking_GenerateParentheses_1.java | private void backTrack(List<String> list, String str, int open, int close, int n) {
if (str.length() == n * 2) {
list.add(str);
} else {
if (open < n) backTrack(list, str.concat("("), open + 1, close, n);
if (close
< open)
backTrack(list, str.concat(")"), open, close + 1, n);
... | private void sample_funcname ( List < String > list , String str , int open , int close , int n ) {
if ( str . length ( ) == n * 2 ) {
list . add ( str ) ;
}
else {
if ( open < n ) backTrack ( list , str . concat ( "(" ) , open + 1 , close , n ) ;
if ( close < open ) backTrack ( list , str . concat ( ... |
977 | <gouthampradhan>dynamic_programming_NumberOfLIS_1.java | public int findNumberOfLIS(int[] nums) {
if (nums.length == 0) return 0;
int[] length = new int[nums.length];
length[0] = 1;
int maxVal = 1;
for (int i = 1; i < nums.length; i++) {
int max = 1;
for (int j = 0; j < i; j++) {
if (nums[i] > nums[j]) {
max = Math.max(max, l... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int [ ] length = new int [ var_0 . length ] ;
length [ 0 ] = 1 ;
int var_4 = 1 ;
for ( int var_5 = 1 ;
var_5 < var_0 . length ;
var_5 ++ ) {
int max = 1 ;
for ( int var_7 = 0 ;
var_7 < var_5 ;
var_7 ++ ) {... |
978 | <gouthampradhan>greedy_JumpGame_1.java | public boolean canJump(int[] nums) {
if (nums.length == 0) return false;
int min = nums.length - 1, max = nums.length - 1;
for (int i = nums.length - 2; i >= 0; i--) {
if ((nums[i] + i) >= min) min = i;
}
return (min == 0);
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 . length == 0 ) return false ;
int var_5 = var_1 . length - 1 , var_6 = var_1 . length - 1 ;
for ( int var_8 = var_1 . length - 2 ;
var_8 >= 0 ;
var_8 -- ) {
if ( ( var_1 [ var_8 ] + var_8 ) >= var_5 ) var_5 = var_8 ;
}
return ( var_5 == 0 ) ;
}
|
979 | <gouthampradhan>dynamic_programming_ConcatenatedWords_1.java | private boolean concatenatedWordsPossible(String word, Set<String> dictionary) {
boolean[] D = new boolean[word.length() + 1];
D[word.length()] = true;
dictionary.remove(word);
for (int i = word.length() - 1; i >= 0; i--) {
for (int j = i, l = word.length(); j < l; j++) {
String subStr = ... | private boolean var_0 ( String var_2 , Set < String > var_4 ) {
boolean [ ] var_8 = new boolean [ var_2 . length ( ) + 1 ] ;
var_8 [ var_2 . length ( ) ] = true ;
var_4 . remove ( var_2 ) ;
for ( int var_10 = var_2 . length ( ) - 1 ;
var_10 >= 0 ;
var_10 -- ) {
for ( int var_12 = var_10 , var_13 = var_2... |
980 | <gouthampradhan>hashing_GroupsOfSpecialEquivalentStrings_1.java | public int numSpecialEquivGroups(String[] A) {
Set<String> set = new HashSet<>();
for (String s : A) {
StringBuilder temp1 = new StringBuilder();
for (int i = 0, l = s.length(); i < l; i += 2) {
char c = s.charAt(i);
temp1.append(c);
}
StringBuilder temp2 = new StringBuil... | public int sample_funcname ( String [ ] var_1 ) {
Set < String > var_4 = new HashSet < > ( ) ;
for ( String var_5 : var_1 ) {
StringBuilder var_7 = new StringBuilder ( ) ;
for ( int var_9 = 0 , var_11 = var_5 . length ( ) ;
var_9 < var_11 ;
var_9 += 2 ) {
char var_14 = var_5 . charAt ( var_9 )... |
981 | <gouthampradhan>string_ShortestPalindrome_1.java | boolean isPaliandrome(String s, int x, int y) {
for (int i = x, j = y; i < j; i++, j--) {
if (s.charAt(i) != s.charAt(j)) return false;
}
return true;
} | boolean var_0 ( String var_2 , int var_3 , int var_4 ) {
for ( int var_5 = var_3 , var_6 = var_4 ;
var_5 < var_6 ;
var_5 ++ , var_6 -- ) {
if ( var_2 . charAt ( var_5 ) != var_2 . charAt ( var_6 ) ) return false ;
}
return true ;
}
|
982 | <gouthampradhan>string_SimplifyPath_1.java | public String simplifyPath(String path) {
if (path == null || path.isEmpty()) return "/";
StringTokenizer st = new StringTokenizer(path, "/");
Deque<String> dQueue = new ArrayDeque<>();
while (st.hasMoreTokens()) {
String token = st.nextToken();
if (token.trim().equals("..")) {
if (!... | public String var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . isEmpty ( ) ) return "/" ;
StringTokenizer var_7 = new StringTokenizer ( var_2 , "/" ) ;
Deque < String > var_10 = new ArrayDeque < > ( ) ;
while ( var_7 . hasMoreTokens ( ) ) {
String var_13 = var_7 . nextToken ( ) ;
if ( var_13 . tri... |
983 | <gouthampradhan>binary_search_ArmstrongNumber_1.java | private long power(int n, int p) {
long res = 1L;
for (int i = 0; i < p; i++) {
res *= n;
}
return res;
} | private long sample_funcname ( int var_0 , int var_1 ) {
long var_3 = 1L ;
for ( int var_5 = 0 ;
var_5 < var_1 ;
var_5 ++ ) {
var_3 *= var_0 ;
}
return var_3 ;
}
|
984 | <gouthampradhan>string_ReverseWordsInAString_1.java | public String reverseWords(String s) {
if (s == null || s.isEmpty()) return "";
StringBuilder sb = new StringBuilder(s.trim());
String reverse = sb.reverse().toString();
StringTokenizer st = new StringTokenizer(reverse, " ");
List<String> list = new ArrayList<>();
while (st.hasMoreTokens()) {
... | public String var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . isEmpty ( ) ) return "" ;
StringBuilder var_8 = new StringBuilder ( var_2 . trim ( ) ) ;
String reverse = var_8 . reverse ( ) . toString ( ) ;
StringTokenizer var_13 = new StringTokenizer ( reverse , " " ) ;
List < String > var_16 = new Arra... |
985 | <gouthampradhan>math_NthDigit_1.java | public int findNthDigit(int n) {
if (n >= 1 && n <= 9) return n;
long sum = 0L;
for (int i = 0; ; i++) {
long pow = (9 * (new Double(Math.pow(10, i)).longValue())) * (i + 1);
sum += pow;
if (sum >= n) {
long diff = (long) n - (sum - pow);
long num = diff / (i + 1);
... | public int sample_funcname ( int var_0 ) {
if ( var_0 >= 1 && var_0 <= 9 ) return var_0 ;
long var_4 = 0L ;
for ( int var_6 = 0 ;
;
var_6 ++ ) {
long pow = ( 9 * ( new Double ( Math . pow ( 10 , var_6 ) ) . longValue ( ) ) ) * ( var_6 + 1 ) ;
var_4 += pow ;
if ( var_4 >= var_0 ) {
long var_1... |
986 | <gouthampradhan>array_SortArrayByParityII_1.java | public int[] sortArrayByParityII(int[] A) {
int[] R = new int[A.length];
int i = 0, j = 1;
for (int a : A) {
if (a % 2 == 0) {
R[i] = a;
i += 2;
} else {
R[j] = a;
j += 2;
}
}
return R;
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
int [ ] var_2 = new int [ var_0 . length ] ;
int var_4 = 0 , var_6 = 1 ;
for ( int var_7 : var_0 ) {
if ( var_7 % 2 == 0 ) {
var_2 [ var_4 ] = var_7 ;
var_4 += 2 ;
}
else {
var_2 [ var_6 ] = var_7 ;
var_6 += 2 ;
}
}
ret... |
987 | <gouthampradhan>binary_search_FirstBadVersion_1.java | private boolean isBadVersion(int n) {
if (n >= 1702766719) return true;
return false;
} | private boolean var_0 ( int var_1 ) {
if ( var_1 >= 1702766719 ) return true ;
return false ;
}
|
988 | <gouthampradhan>greedy_CourseScheduleIII_1.java | public int scheduleCourse(int[][] courses) {
Arrays.sort(courses, (a, b) -> a[1] - b[1]);
Queue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
int time = 0;
for (int[] course : courses) {
time += course[0];
pq.add(course[0]);
if (time > course[1]) time -= pq.poll();
}
retu... | public int sample_funcname ( int [ ] [ ] var_0 ) {
Arrays . sort ( var_0 , ( var_3 , var_4 ) -> var_3 [ 1 ] - var_4 [ 1 ] ) ;
Queue < Integer > var_9 = new PriorityQueue < > ( ( var_3 , var_4 ) -> var_4 - var_3 ) ;
int var_11 = 0 ;
for ( int [ ] var_12 : var_0 ) {
var_11 += var_12 [ 0 ] ;
var_9 . add ( ... |
989 | <gouthampradhan>divide_and_conquer_TwentyFourGame_1.java | private void swap(int i, int j, int[] nums) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
} | private void var_0 ( int var_1 , int var_2 , int [ ] var_3 ) {
int var_4 = var_3 [ var_1 ] ;
var_3 [ var_1 ] = var_3 [ var_2 ] ;
var_3 [ var_2 ] = var_4 ;
}
|
990 | <gouthampradhan>bit_manipulation_GrayCode_1.java | public List<Integer> grayCode(int n) {
List<Integer> result = new ArrayList<>();
for (int i = 0; i <= ((1 << n) - 1); i++) result.add(i ^ (i >> 1));
return result;
} | public List < Integer > var_1 ( int var_2 ) {
List < Integer > var_5 = new ArrayList < > ( ) ;
for ( int var_7 = 0 ;
var_7 <= ( ( 1 << var_2 ) - 1 ) ;
var_7 ++ ) var_5 . add ( var_7 ^ ( var_7 >> 1 ) ) ;
return var_5 ;
}
|
991 | <gouthampradhan>binary_search_MinSortedRotatedArray_1.java | public int findMin(int[] nums) {
if (nums.length == 0) return 0;
else if (nums.length == 1) return nums[0];
int low = 0, high = nums.length - 1;
while (low < high) {
int mid = (low + high) / 2;
if (mid > 0 && nums[mid] < nums[mid - 1]) return nums[mid];
if (nums[low] > nums[mid]) high ... | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
else if ( var_0 . length == 1 ) return var_0 [ 0 ] ;
int var_4 = 0 , var_5 = var_0 . length - 1 ;
while ( var_4 < var_5 ) {
int var_7 = ( var_4 + var_5 ) / 2 ;
if ( var_7 > 0 && var_0 [ var_7 ] < var_0 [ var_7 - 1 ] ) r... |
992 | <gouthampradhan>string_TextJustification_1.java | public List<String> fullJustify(String[] words, int L) {
int wCount = 0, charCount = 0;
List<String> line = new ArrayList<>();
List<String> result = new ArrayList<>();
StringBuilder sb = new StringBuilder();
for (int i = 0, l = words.length; i < l; i++) {
String next = words[i];
if ((L -... | public List < String > var_1 ( String [ ] var_2 , int var_3 ) {
int var_5 = 0 , var_6 = 0 ;
List < String > var_9 = new ArrayList < > ( ) ;
List < String > var_10 = new ArrayList < > ( ) ;
StringBuilder var_12 = new StringBuilder ( ) ;
for ( int var_13 = 0 , var_15 = var_2 . length ;
var_13 < var_15 ;
var... |
993 | <gouthampradhan>binary_search_KokoEatingBananas_1.java | private boolean check(int[] piles, int H, int k) {
for (int p : piles) {
if (p <= k) {
H--;
} else {
int q = p / k;
if ((p % k) > 0) {
q++;
}
H -= q;
}
if (H < 0) {
return false;
}
}
return true;
} | private boolean var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
for ( int var_4 : var_1 ) {
if ( var_4 <= var_3 ) {
var_2 -- ;
}
else {
int var_5 = var_4 / var_3 ;
if ( ( var_4 % var_3 ) > 0 ) {
var_5 ++ ;
}
var_2 -= var_5 ;
}
if ( var_2 < 0 ) {
return... |
994 | <gouthampradhan>string_FindWordsThatCanBeFormedbyCharacters_1.java | public int countCharacters(String[] words, String chars) {
Map<Character, Integer> countMap = new HashMap<>();
for (char c : chars.toCharArray()) {
countMap.putIfAbsent(c, 0);
countMap.put(c, countMap.get(c) + 1);
}
int ans = 0;
for (String s : words) {
Map<Character, Integer> subM... | public int sample_funcname ( String [ ] var_1 , String var_2 ) {
Map < Character , Integer > var_7 = new HashMap < > ( ) ;
for ( char var_9 : var_2 . toCharArray ( ) ) {
var_7 . putIfAbsent ( var_9 , 0 ) ;
var_7 . put ( var_9 , var_7 . get ( var_9 ) + 1 ) ;
}
int var_15 = 0 ;
for ( String var_16 : var... |
995 | <gouthampradhan>string_ReverseStringII_1.java | public String reverseStr(String s, int k) {
StringBuilder sb = new StringBuilder();
for (int i = 0, l = s.length(); i < l; i++) {
if (i % (2 * k) == 0) {
int count = 0;
StringBuilder temp = new StringBuilder();
while (count < k && i < l) {
temp.append(s.charAt(i));
... | public String var_0 ( String var_2 , int var_3 ) {
StringBuilder var_5 = new StringBuilder ( ) ;
for ( int var_7 = 0 , var_9 = var_2 . length ( ) ;
var_7 < var_9 ;
var_7 ++ ) {
if ( var_7 % ( 2 * var_3 ) == 0 ) {
int var_11 = 0 ;
StringBuilder var_12 = new StringBuilder ( ) ;
while ( var_1... |
996 | <gouthampradhan>depth_first_search_CrackingTheSafe_2.java | private String dfs(
String num, StringBuilder result, Set<String> done, int k, int states, int count) {
done.add(num);
if (states == count) {
return result.toString();
} else {
for (int i = 0; i < k; i++) {
String newNum = (num + String.valueOf(i));
String newState = newNum... | private String sample_funcname ( String num , StringBuilder result , Set < String > done , int k , int states , int count ) {
done . add ( num ) ;
if ( states == count ) {
return result . toString ( ) ;
}
else {
for ( int i = 0 ;
i < k ;
i ++ ) {
String newNum = ( num + String . valueOf ( ... |
997 | <gouthampradhan>heap_TheSkylineProblem_1.java | private int[] makeNewPoint(int x, int y) {
int[] point = new int[2];
point[0] = x;
point[1] = y;
return point;
} | private int [ ] sample_funcname ( int var_0 , int var_1 ) {
int [ ] var_3 = new int [ 2 ] ;
var_3 [ 0 ] = var_0 ;
var_3 [ 1 ] = var_1 ;
return var_3 ;
}
|
998 | <gouthampradhan>array_SubarraySumEqualsK_1.java | public int subarraySum(int[] nums, int k) {
Map<Integer, Integer> map = new HashMap<>();
int sum = 0;
for (int i : nums) {
sum += i;
Integer count = map.get(sum);
if (count == null) {
map.put(sum, 1);
} else {
map.put(sum, count + 1);
}
}
sum = 0;
in... | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
Map < Integer , Integer > var_5 = new HashMap < > ( ) ;
int var_7 = 0 ;
for ( int var_8 : var_0 ) {
var_7 += var_8 ;
Integer var_10 = var_5 . get ( var_7 ) ;
if ( var_10 == null ) {
var_5 . put ( var_7 , 1 ) ;
}
else {
var_... |
999 | <gouthampradhan>array_ArrayPartitionI_1.java | public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int sum = 0;
for (int i = 1; i < nums.length; i += 2) {
sum += Math.min(nums[i - 1], nums[i]);
}
return sum;
} | public int sample_funcname ( int [ ] var_0 ) {
Arrays . sort ( var_0 ) ;
int var_4 = 0 ;
for ( int var_6 = 1 ;
var_6 < var_0 . length ;
var_6 += 2 ) {
var_4 += Math . min ( var_0 [ var_6 - 1 ] , var_0 [ var_6 ] ) ;
}
return var_4 ;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.