Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 179cfc4

Browse files
fishercoder1534fishercoder1534
committed
refactor for format
1 parent a189a52 commit 179cfc4

File tree

13 files changed

+50
-48
lines changed

13 files changed

+50
-48
lines changed

‎src/main/java/com/fishercoder/solutions/_516.java

+5-5
Original file line numberDiff line numberDiff line change
@@ -24,17 +24,17 @@ public class _516 {
2424
/**Inspired by https://discuss.leetcode.com/topic/78603/straight-forward-java-dp-solution*/
2525
public static int longestPalindromeSubseq(String s) {
2626
int[][] dp = new int[s.length()][s.length()];
27-
for (int i = s.length()-1; i >= 0; i--) {
27+
for (int i = s.length() - 1; i >= 0; i--) {
2828
dp[i][i] = 1;//initialization
29-
for (int j = i+1; j < s.length(); j++) {
29+
for (int j = i + 1; j < s.length(); j++) {
3030
if (s.charAt(i) == s.charAt(j)) {
31-
dp[i][j] = dp[i+1][j-1] + 2;
31+
dp[i][j] = dp[i + 1][j - 1] + 2;
3232
} else {
33-
dp[i][j] = Math.max(dp[i+1][j], dp[i][j-1]);
33+
dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]);
3434
}
3535
}
3636
}
37-
return dp[0][s.length()-1];
37+
return dp[0][s.length() - 1];
3838
}
3939

4040
public static void main(String... args) {

‎src/main/java/com/fishercoder/solutions/_517.java

+7-7
Original file line numberDiff line numberDiff line change
@@ -45,16 +45,16 @@ public class _517 {
4545
/**Reference: https://discuss.leetcode.com/topic/79938/super-short-easy-java-o-n-solution*/
4646
public int findMinMoves(int[] machines) {
4747
int total = 0;
48-
for(int i : machines) {
49-
total+=i;
48+
for (int i : machines) {
49+
total += i;
5050
}
51-
if( total % machines.length != 0) {
51+
if (total % machines.length != 0) {
5252
return -1;
5353
}
54-
int avg = total/machines.length, cnt = 0, max = 0;
55-
for(int load: machines){
56-
cnt += load-avg; //load-avg is "gain/lose"
57-
max = Math.max(Math.max(max, Math.abs(cnt)), load-avg);
54+
int avg = total / machines.length, cnt = 0, max = 0;
55+
for (int load : machines) {
56+
cnt += load - avg; //load-avg is "gain/lose"
57+
max = Math.max(Math.max(max, Math.abs(cnt)), load - avg);
5858
}
5959
return max;
6060
}

‎src/main/java/com/fishercoder/solutions/_523.java

+5-5
Original file line numberDiff line numberDiff line change
@@ -63,20 +63,20 @@ public boolean checkSubarraySum(int[] nums, int k) {
6363
if (nums == null || nums.length == 0) return false;
6464

6565
//Two continuous zeroes will form a subarray of length 2 with sum 0, 0*k = 0 will always be true
66-
for (int i = 0; i < nums.length-1; i++) {
67-
if (nums[i] == 0 && nums[i+1] == 0) return true;
66+
for (int i = 0; i < nums.length - 1; i++) {
67+
if (nums[i] == 0 && nums[i + 1] == 0) return true;
6868
}
6969

7070
//then k cannot be zero any more
7171
if (k == 0 || nums.length < 2) return false;
7272

73-
int[] preSums = new int[nums.length+1];
73+
int[] preSums = new int[nums.length + 1];
7474
for (int i = 1; i <= nums.length; i++) {
75-
preSums[i] = preSums[i-1] + nums[i-1];
75+
preSums[i] = preSums[i - 1] + nums[i - 1];
7676
}
7777

7878
for (int i = 1; i <= nums.length; i++) {
79-
for (int j = 0; j < i-1; j++) {
79+
for (int j = 0; j < i - 1; j++) {
8080
if ((preSums[i] - preSums[j]) % k == 0) return true;
8181
}
8282
}

‎src/main/java/com/fishercoder/solutions/_526.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ public class _526 {
3535
int count = 0;
3636

3737
public int countArrangement(int N) {
38-
backtracking(N, new int[N+1], 1);
38+
backtracking(N, new int[N + 1], 1);
3939
return count;
4040
}
4141

@@ -47,7 +47,7 @@ private void backtracking(int N, int[] used, int pos) {
4747
for (int i = 1; i <= N; i++) {
4848
if (used[i] == 0 && (i % pos == 0 || pos % i == 0)) {
4949
used[i] = 1;
50-
backtracking(N, used, pos+1);
50+
backtracking(N, used, pos + 1);
5151
used[i] = 0;
5252
}
5353
}

‎src/main/java/com/fishercoder/solutions/_53.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
public class _53 {
1010
public int maxSubArray(int[] nums) {
1111
int maxSum = nums[0], currentSum = nums[0];
12-
for(int i = 1; i < nums.length; i++){
12+
for (int i = 1; i < nums.length; i++) {
1313
currentSum = Math.max(nums[i], currentSum + nums[i]);
1414
maxSum = Math.max(currentSum, maxSum);
1515
}

‎src/main/java/com/fishercoder/solutions/_532.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -37,8 +37,8 @@ public class _532 {
3737
//this O(n^2) will result in TLE
3838
public int findPairs_On2(int[] nums, int k) {
3939
Set<List<Integer>> pairsSet = new HashSet<>();
40-
for (int i = 0; i < nums.length-1; i++) {
41-
for (int j = i+1; j < nums.length; j++) {
40+
for (int i = 0; i < nums.length - 1; i++) {
41+
for (int j = i + 1; j < nums.length; j++) {
4242
if (Math.abs(nums[j] - nums[i]) == k) {
4343
pairsSet.add(nums[i] > nums[j] ? Arrays.asList(nums[j], nums[i]) : Arrays.asList(nums[i], nums[j]));
4444
}

‎src/main/java/com/fishercoder/solutions/_537.java

+5-5
Original file line numberDiff line numberDiff line change
@@ -34,20 +34,20 @@ public String complexNumberMultiply(String a, String b) {
3434
}
3535

3636
private String sumTwoI(String product2, String product3) {
37-
int number2 = Integer.parseInt(product2.substring(0, product2.length()-1));
38-
int number3 = Integer.parseInt(product3.substring(0, product3.length()-1));
37+
int number2 = Integer.parseInt(product2.substring(0, product2.length() - 1));
38+
int number3 = Integer.parseInt(product3.substring(0, product3.length() - 1));
3939
return String.valueOf(number2 + number3) + "i";
4040
}
4141

4242
private String multiplyTwoIs(String p, String q) {
43-
int number1 = Integer.parseInt(p.substring(0, p.length()-1));
44-
int number2 = Integer.parseInt(q.substring(0, q.length()-1));
43+
int number1 = Integer.parseInt(p.substring(0, p.length() - 1));
44+
int number2 = Integer.parseInt(q.substring(0, q.length() - 1));
4545
int numberProduct = number1 * number2;
4646
return String.valueOf(-numberProduct);
4747
}
4848

4949
private String multiply(String p, String withI) {
50-
int numberPart = Integer.parseInt(withI.substring(0, withI.length()-1));
50+
int numberPart = Integer.parseInt(withI.substring(0, withI.length() - 1));
5151
return String.valueOf(numberPart * Integer.valueOf(p)) + "i";
5252
}
5353

‎src/main/java/com/fishercoder/solutions/_539.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ public int findMinDifference(List<String> timePoints) {
2323
String[] timeParts = eachTime.split(":");
2424
int hour = Integer.valueOf(timeParts[0]);
2525
int minute = Integer.valueOf(timeParts[1]);
26-
int value = hour*60 + minute;
26+
int value = hour * 60 + minute;
2727
if (allTimePoints[value]) return 0;
2828
allTimePoints[value] = true;
2929
}

‎src/main/java/com/fishercoder/solutions/_54.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -27,9 +27,9 @@ public List<Integer> spiralOrder(int[][] matrix) {
2727
return result;
2828
}
2929
int rowStart = 0;
30-
int rowEnd = matrix.length-1;
30+
int rowEnd = matrix.length - 1;
3131
int colStart = 0;
32-
int colEnd = matrix[0].length-1;
32+
int colEnd = matrix[0].length - 1;
3333
while (rowStart <= rowEnd && colStart <= colEnd) {
3434
//traverse to the right
3535
for (int j = colStart; j <= colEnd; j++) {

‎src/main/java/com/fishercoder/solutions/_542.java

+6-5
Original file line numberDiff line numberDiff line change
@@ -50,12 +50,13 @@ public List<List<Integer>> updateMatrix(List<List<Integer>> matrix) {
5050
final int[] dirs = new int[]{0, 1, 0, -1, 0};
5151
while (!deque.isEmpty()) {
5252
int[] currentCell = deque.poll();
53-
for (int i = 0; i < dirs.length-1; i++) {
54-
int nextRow = currentCell[0]+dirs[i];
55-
int nextCol = currentCell[1]+dirs[i+1];
56-
if (nextRow < 0 || nextCol < 0 || nextRow >= m || nextCol >= n || matrix.get(nextRow).get(nextCol) <= matrix.get(currentCell[0]).get(currentCell[1])+1) continue;
53+
for (int i = 0; i < dirs.length - 1; i++) {
54+
int nextRow = currentCell[0] + dirs[i];
55+
int nextCol = currentCell[1] + dirs[i + 1];
56+
if (nextRow < 0 || nextCol < 0 || nextRow >= m || nextCol >= n || matrix.get(nextRow).get(nextCol) <= matrix.get(currentCell[0]).get(currentCell[1]) + 1)
57+
continue;
5758
deque.offer(new int[]{nextRow, nextCol});
58-
matrix.get(nextRow).set(nextCol, matrix.get(currentCell[0]).get(currentCell[1])+1);
59+
matrix.get(nextRow).set(nextCol, matrix.get(currentCell[0]).get(currentCell[1]) + 1);
5960
}
6061
}
6162
return matrix;

‎src/main/java/com/fishercoder/solutions/_544.java

+3-3
Original file line numberDiff line numberDiff line change
@@ -58,22 +58,22 @@ public String findContestMatch(int n) {
5858
right--;
5959
}
6060
if (n == 2) return pairs.get(0);
61-
return generateFinal(pairs, n/2);
61+
return generateFinal(pairs, n / 2);
6262
}
6363

6464
private String generateFinal(List<String> pairs, int n) {
6565
if (n > 2) {
6666
int size = pairs.size();
6767
int left = 0;
68-
int right = size-1;
68+
int right = size - 1;
6969
List<String> newPairs = new ArrayList<>();
7070
while (left < right) {
7171
String newPair = "(" + pairs.get(left) + "," + pairs.get(right) + ")";
7272
newPairs.add(newPair);
7373
left++;
7474
right--;
7575
}
76-
return generateFinal(newPairs, n/2);
76+
return generateFinal(newPairs, n / 2);
7777
}
7878
return "(" + pairs.get(0) + "," + pairs.get(1) + ")";
7979
}

‎src/main/java/com/fishercoder/solutions/_547.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -42,7 +42,7 @@ public int findCircleNum(int[][] M) {
4242
int m = M.length;//number of rows in this matrix
4343
UnionFind unionFind = new UnionFind(m);
4444
for (int i = 0; i < m; i++) {
45-
for (int j = i+1; j < m; j++) {
45+
for (int j = i + 1; j < m; j++) {
4646
if (M[i][j] == 1) {
4747
unionFind.union(i, j);
4848
}

‎src/main/java/com/fishercoder/solutions/_548.java

+10-9
Original file line numberDiff line numberDiff line change
@@ -25,23 +25,24 @@ where we define that subarray (L, R) represents a slice of the original array st
2525
*/
2626
public class _548 {
2727

28-
public boolean splitArray_O_N_3(int[] nums) {//TODO: this one is failed by test4, probably some index wrong
28+
public boolean splitArray_O_N_3(int[] nums) {
29+
//TODO: this one is failed by test4, probably some index wrong
2930
if (nums == null || nums.length == 0) return false;
30-
long[] previousSums = new long[nums.length+1];
31+
long[] previousSums = new long[nums.length + 1];
3132
for (int i = 1; i <= nums.length; i++) {
32-
previousSums[i] = previousSums[i-1] + nums[i-1];
33+
previousSums[i] = previousSums[i - 1] + nums[i - 1];
3334
}
3435

3536
int n = nums.length;
36-
for (int i = 1; i <= n-6; i++) {
37+
for (int i = 1; i <= n - 6; i++) {
3738
long sum1 = previousSums[i] - previousSums[0];
38-
for (int j = i+2; j <= n-4; j++) {
39-
long sum2 = previousSums[j] - previousSums[i+1];
39+
for (int j = i + 2; j <= n - 4; j++) {
40+
long sum2 = previousSums[j] - previousSums[i + 1];
4041
if (sum1 != sum2) break;
41-
for (int k = j+2; k <= n-2; k++) {
42-
long sum3 = previousSums[k] - previousSums[j+1];
42+
for (int k = j + 2; k <= n - 2; k++) {
43+
long sum3 = previousSums[k] - previousSums[j + 1];
4344
if (sum2 != sum3) break;
44-
long sum4 = previousSums[n] - previousSums[k+1];
45+
long sum4 = previousSums[n] - previousSums[k + 1];
4546
if (sum3 == sum4) return true;
4647
}
4748
}

0 commit comments

Comments
 (0)