Skip to content

Commit 5f28ec0

Browse files
fishercoder1534fishercoder1534
committed
refactor for format
1 parent 981ef79 commit 5f28ec0

20 files changed

+118
-42
lines changed

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -6,8 +6,9 @@
66
public class _50 {
77

88
public double myPow(double x, int n) {
9-
if (n == 0)
9+
if (n == 0) {
1010
return 1;
11+
}
1112
if (n == Integer.MIN_VALUE) {
1213
++n;
1314
n = -n;

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

+9-3
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,9 @@ public class _501 {
3030
public int[] findMode(TreeNode root) {
3131
int[] result = new int[]{};
3232
Map<Integer, Integer> map = new HashMap();
33-
if (root == null) return result;
33+
if (root == null) {
34+
return result;
35+
}
3436
List<Integer> list = bfs(root, map);
3537
result = new int[list.size()];
3638
for (int i = 0; i < list.size(); i++) {
@@ -46,8 +48,12 @@ private List<Integer> bfs(TreeNode root, Map<Integer, Integer> map) {
4648
int size = queue.size();
4749
for (int i = 0; i < size; i++) {
4850
TreeNode treeNode = queue.poll();
49-
if (treeNode.left != null) queue.offer(treeNode.left);
50-
if (treeNode.right != null) queue.offer(treeNode.right);
51+
if (treeNode.left != null) {
52+
queue.offer(treeNode.left);
53+
}
54+
if (treeNode.right != null) {
55+
queue.offer(treeNode.right);
56+
}
5157
map.put(treeNode.val, map.getOrDefault(treeNode.val, 0) + 1);
5258
}
5359
}

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,9 @@ public int findMaximizedCapital(int k, int W, int[] Profits, int[] Capital) {
4040
while (!capitalHeap.isEmpty() && capitalHeap.peek()[0] <= W) {
4141
profitHeap.add(capitalHeap.poll());
4242
}
43-
if (profitHeap.isEmpty()) break;
43+
if (profitHeap.isEmpty()) {
44+
break;
45+
}
4446
W += profitHeap.poll()[1];
4547
}
4648
return W;

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,9 @@ public class _503 {
2121
//Credit: https://discuss.leetcode.com/topic/77881/typical-ways-to-solve-circular-array-problems-java-solution
2222
//Note: we store INDEX into the stack, reversely, the larger index put at the bottom of the stack, the smaller index at the top
2323
public int[] nextGreaterElements(int[] nums) {
24-
if (nums == null || nums.length == 0) return nums;
24+
if (nums == null || nums.length == 0) {
25+
return nums;
26+
}
2527
int len = nums.length;
2628
Stack<Integer> stack = new Stack<>();
2729
for (int i = len - 1; i >= 0; i--) {

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -67,7 +67,9 @@ public int shortestDistance(int[][] maze, int[] start, int[] destination) {
6767

6868
while (!queue.isEmpty()) {
6969
Point curr = queue.poll();
70-
if (length[curr.x][curr.y] <= curr.distance) continue;
70+
if (length[curr.x][curr.y] <= curr.distance) {
71+
continue;
72+
}
7173
length[curr.x][curr.y] = curr.distance;
7274
for (int i = 0; i < directions.length - 1; i++) {
7375
int x = curr.x;

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

+9-4
Original file line numberDiff line numberDiff line change
@@ -28,10 +28,15 @@ public String[] findRelativeRanks(int[] nums) {
2828
Map<Integer, String> rankMap = new HashMap();
2929
int len = nums.length;
3030
for (int i = len - 1; i >= 0; i--) {
31-
if (i == len - 1) rankMap.put(tmp[i], "Gold Medal");
32-
else if (i == len - 2) rankMap.put(tmp[i], "Silver Medal");
33-
else if (i == len - 3) rankMap.put(tmp[i], "Bronze Medal");
34-
else rankMap.put(tmp[i], String.valueOf(len - i));
31+
if (i == len - 1) {
32+
rankMap.put(tmp[i], "Gold Medal");
33+
} else if (i == len - 2) {
34+
rankMap.put(tmp[i], "Silver Medal");
35+
} else if (i == len - 3) {
36+
rankMap.put(tmp[i], "Bronze Medal");
37+
} else {
38+
rankMap.put(tmp[i], String.valueOf(len - i));
39+
}
3540
}
3641
String[] result = new String[len];
3742
for (int i = 0; i < len; i++) {

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

+6-2
Original file line numberDiff line numberDiff line change
@@ -16,12 +16,16 @@
1616
public class _507 {
1717

1818
public boolean checkPerfectNumber(int num) {
19-
if (num == 1) return false;
19+
if (num == 1) {
20+
return false;
21+
}
2022
int sum = 0;
2123
for (int i = 2; i <= Math.sqrt(num); i++) {
2224
if (num % i == 0) {
2325
sum += i;
24-
if (i != num / i) sum += num / i;
26+
if (i != num / i) {
27+
sum += num / i;
28+
}
2529
}
2630
}
2731
sum++;

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,9 @@ public class _508 {
3939
public static class Solution1 {
4040
//my purely original but verbose solution
4141
public int[] findFrequentTreeSum(TreeNode root) {
42-
if (root == null) return new int[]{};
42+
if (root == null) {
43+
return new int[]{};
44+
}
4345

4446
Map<TreeNode, Integer> map = new HashMap();
4547
postOrder(root, map);

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -31,7 +31,9 @@ public class _51 {
3131

3232
public List<List<String>> solveNQueens(int n) {
3333
List<List<String>> result = new ArrayList<>();
34-
if (n <= 0) return result;
34+
if (n <= 0) {
35+
return result;
36+
}
3537
search(n, new ArrayList<>(), result);
3638
return result;
3739
}

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

+6-2
Original file line numberDiff line numberDiff line change
@@ -46,8 +46,12 @@ public int findBottomLeftValue(TreeNode root) {
4646
if (i == 0) {
4747
leftMost = curr;
4848
}
49-
if (curr.left != null) queue.offer(curr.left);
50-
if (curr.right != null) queue.offer(curr.right);
49+
if (curr.left != null) {
50+
queue.offer(curr.left);
51+
}
52+
if (curr.right != null) {
53+
queue.offer(curr.right);
54+
}
5155
}
5256
}
5357
return leftMost.val;

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

+6-2
Original file line numberDiff line numberDiff line change
@@ -34,8 +34,12 @@ public List<Integer> largestValues(TreeNode root) {
3434
for (int i = 0; i < size; i++) {
3535
TreeNode curr = queue.poll();
3636
max = Math.max(max, curr.val);
37-
if (curr.left != null) queue.offer(curr.left);
38-
if (curr.right != null) queue.offer(curr.right);
37+
if (curr.left != null) {
38+
queue.offer(curr.left);
39+
}
40+
if (curr.right != null) {
41+
queue.offer(curr.right);
42+
}
3943
}
4044
list.add(max);
4145
}

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,9 @@ public class _52 {
1010

1111
public int totalNQueens(int n) {
1212
List<List<String>> result = new ArrayList<>();
13-
if (n <= 0) return result.size();
13+
if (n <= 0) {
14+
return result.size();
15+
}
1416
search(n, new ArrayList<>(), result);
1517
return result.size();
1618
}

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

+12-4
Original file line numberDiff line numberDiff line change
@@ -22,22 +22,28 @@ public class _520 {
2222
public boolean detectCapitalUse(String word) {
2323
char[] words = word.toCharArray();
2424
boolean firstLetterCap = false;
25-
if (Character.isUpperCase(words[0])) firstLetterCap = true;
25+
if (Character.isUpperCase(words[0])) {
26+
firstLetterCap = true;
27+
}
2628

2729
if (firstLetterCap) {
2830
if (words.length >= 2) {
2931
int i = 2;
3032
if (Character.isUpperCase(words[1])) {
3133
//then all following must be all uppercase
3234
while (i < words.length) {
33-
if (!Character.isUpperCase(words[i])) return false;
35+
if (!Character.isUpperCase(words[i])) {
36+
return false;
37+
}
3438
i++;
3539
}
3640
return true;
3741
} else {
3842
//then all following must be all lowercase
3943
while (i < words.length) {
40-
if (!Character.isLowerCase(words[i])) return false;
44+
if (!Character.isLowerCase(words[i])) {
45+
return false;
46+
}
4147
i++;
4248
}
4349
return true;
@@ -48,7 +54,9 @@ public boolean detectCapitalUse(String word) {
4854
//then all following must be all lowercase
4955
int i = 1;
5056
while (i < words.length) {
51-
if (!Character.isLowerCase(words[i])) return false;
57+
if (!Character.isLowerCase(words[i])) {
58+
return false;
59+
}
5260
i++;
5361
}
5462
return true;

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,9 @@ public class _521 {
2626

2727
//Or in other words, when a.length() != b.length(), no subsequence of b will be equal to a, so return Math.max(a.length(), b.length())
2828
public int findLUSlength(String a, String b) {
29-
if (a.equals(b)) return -1;
29+
if (a.equals(b)) {
30+
return -1;
31+
}
3032
return Math.max(a.length(), b.length());
3133
}
3234

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

+9-4
Original file line numberDiff line numberDiff line change
@@ -33,21 +33,26 @@ public int compare(String o1, String o2) {
3333
for (int i = 0; i < strs.length; i++) {
3434
boolean found = true;
3535
for (int j = 0; j < strs.length; j++) {
36-
if (i == j) continue;
37-
else if (isSubsequence(strs[i], strs[j])) {
36+
if (i == j) {
37+
continue;
38+
} else if (isSubsequence(strs[i], strs[j])) {
3839
found = false;
3940
break;
4041
}
4142
}
42-
if (found) return strs[i].length();
43+
if (found) {
44+
return strs[i].length();
45+
}
4346
}
4447
return -1;
4548
}
4649

4750
private boolean isSubsequence(String a, String b) {
4851
int i = 0;
4952
for (int j = 0; i < a.length() && j < b.length(); j++) {
50-
if (a.charAt(i) == b.charAt(j)) i++;
53+
if (a.charAt(i) == b.charAt(j)) {
54+
i++;
55+
}
5156
}
5257
return i == a.length();
5358
}

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

+12-4
Original file line numberDiff line numberDiff line change
@@ -60,15 +60,21 @@ public boolean checkSubarraySumOnTimeO1Space(int[] nums, int k) {
6060
}
6161

6262
public boolean checkSubarraySum(int[] nums, int k) {
63-
if (nums == null || nums.length == 0) return false;
63+
if (nums == null || nums.length == 0) {
64+
return false;
65+
}
6466

6567
//Two continuous zeroes will form a subarray of length 2 with sum 0, 0*k = 0 will always be true
6668
for (int i = 0; i < nums.length - 1; i++) {
67-
if (nums[i] == 0 && nums[i + 1] == 0) return true;
69+
if (nums[i] == 0 && nums[i + 1] == 0) {
70+
return true;
71+
}
6872
}
6973

7074
//then k cannot be zero any more
71-
if (k == 0 || nums.length < 2) return false;
75+
if (k == 0 || nums.length < 2) {
76+
return false;
77+
}
7278

7379
int[] preSums = new int[nums.length + 1];
7480
for (int i = 1; i <= nums.length; i++) {
@@ -77,7 +83,9 @@ public boolean checkSubarraySum(int[] nums, int k) {
7783

7884
for (int i = 1; i <= nums.length; i++) {
7985
for (int j = 0; j < i - 1; j++) {
80-
if ((preSums[i] - preSums[j]) % k == 0) return true;
86+
if ((preSums[i] - preSums[j]) % k == 0) {
87+
return true;
88+
}
8189
}
8290
}
8391
return false;

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -41,7 +41,9 @@ public String findLongestWord(String s, List<String> d) {
4141
i++;
4242
}
4343
}
44-
if (i == dictWord.length()) return dictWord;
44+
if (i == dictWord.length()) {
45+
return dictWord;
46+
}
4547
}
4648
return "";
4749
}

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

+3-1
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,9 @@ public class _525 {
2424

2525
//credit: https://leetcode.com/articles/contiguous-array/#approach-3-using-hashmap-accepted
2626
public int findMaxLength(int[] nums) {
27-
if (nums == null || nums.length == 0) return 0;
27+
if (nums == null || nums.length == 0) {
28+
return 0;
29+
}
2830
int count = 0;
2931
int max = 0;
3032
Map<Integer, Integer> map = new HashMap();

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

+8-3
Original file line numberDiff line numberDiff line change
@@ -41,12 +41,17 @@ public List<String> wordsAbbreviation(List<String> dict) {
4141
while (true) {
4242
HashSet<Integer> set = new HashSet<>();
4343
for (int j = i + 1; j < len; j++) {
44-
if (ans[j].equals(ans[i])) set.add(j); // check all strings with the same abbreviation
44+
if (ans[j].equals(ans[i])) {
45+
set.add(j); // check all strings with the same abbreviation
46+
}
47+
}
48+
if (set.isEmpty()) {
49+
break;
4550
}
46-
if (set.isEmpty()) break;
4751
set.add(i);
48-
for (int k : set)
52+
for (int k : set) {
4953
ans[k] = abbreviate(dict.get(k), ++prefix[k]); // increase the prefix
54+
}
5055
}
5156
}
5257
return Arrays.asList(ans);

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

+12-4
Original file line numberDiff line numberDiff line change
@@ -75,10 +75,14 @@ public char[][] updateBoard(char[][] board, int[] click) {
7575
int count = 0;
7676
for (int i = -1; i < 2; i++) {
7777
for (int j = -1; j < 2; j++) {
78-
if (i == 0 && j == 0) continue;
78+
if (i == 0 && j == 0) {
79+
continue;
80+
}
7981
int r = row + i;
8082
int c = col + j;
81-
if (r >= m || r < 0 || c >= n || c < 0) continue;
83+
if (r >= m || r < 0 || c >= n || c < 0) {
84+
continue;
85+
}
8286
if (board[r][c] == 'M' || board[r][c] == 'X') {
8387
count++;
8488
}
@@ -91,10 +95,14 @@ public char[][] updateBoard(char[][] board, int[] click) {
9195
board[row][col] = 'B';
9296
for (int i = -1; i < 2; i++) {
9397
for (int j = -1; j < 2; j++) {
94-
if (i == 0 && j == 0) continue;
98+
if (i == 0 && j == 0) {
99+
continue;
100+
}
95101
int r = row + i;
96102
int c = col + j;
97-
if (r >= m || r < 0 || c >= n || c < 0) continue;
103+
if (r >= m || r < 0 || c >= n || c < 0) {
104+
continue;
105+
}
98106
if (board[r][c] == 'E') {
99107
queue.offer(new int[]{r, c});
100108
board[r][c] = 'B';

0 commit comments

Comments
 (0)