refactor for format

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_531.java

@@ -37,13 +37,17 @@ public int findLonelyPixel(char[][] picture) {
     private boolean isLonely(int row, int col, char[][] picture, int m, int n) {
         for (int i = 0; i < m; i++) {
             if (i != row) {
-                if (picture[i][col] == 'B') return false;
+                if (picture[i][col] == 'B') {
+                    return false;
+                }
             }
         }
 
         for (int j = 0; j < n; j++) {
             if (j != col) {
-                if (picture[row][j] == 'B') return false;
+                if (picture[row][j] == 'B') {
+                    return false;
+                }
             }
         }
         return true;

src/main/java/com/fishercoder/solutions/_533.java

@@ -49,7 +49,9 @@ public class _533 {
      * 2. then we could go through the HashMap keyset:
      * if one row has N number of 'B's, we go through this row's each column to see if any element in this row is 'B' and also that element's column has N 'B's*/
     public int findBlackPixel(char[][] picture, int N) {
-        if (picture == null || picture.length == 0 || picture[0].length == 0) return 0;
+        if (picture == null || picture.length == 0 || picture[0].length == 0) {
+            return 0;
+        }
         int m = picture.length;
         int n = picture[0].length;
         int[] cols = new int[n];
@@ -73,9 +75,13 @@ public int findBlackPixel(char[][] picture, int N) {
 
         int answer = 0;
         for (String key : map.keySet()) {
-            if (map.get(key) != N) continue;
+            if (map.get(key) != N) {
+                continue;
+            }
             for (int i = 0; i < n; i++) {
-                if (key.charAt(i) == 'B' && cols[i] == N) answer += N;
+                if (key.charAt(i) == 'B' && cols[i] == N) {
+                    answer += N;
+                }
             }
         }
         return answer;

src/main/java/com/fishercoder/solutions/_536.java

@@ -32,11 +32,15 @@ public class _536 {
 
     public static class Solution1 {
         public TreeNode str2tree(String s) {
-            if (s.equals("")) return null;
+            if (s.equals("")) {
+                return null;
+            }
             int firstParen = s.indexOf("(");
             int val = firstParen == -1 ? Integer.parseInt(s) : Integer.parseInt(s.substring(0, firstParen));
             TreeNode cur = new TreeNode(val);
-            if (firstParen == -1) return cur;
+            if (firstParen == -1) {
+                return cur;
+            }
             int start = firstParen;
             int leftParenCount = 0;
             for (int i = start; i < s.length(); i++) {

src/main/java/com/fishercoder/solutions/_538.java

@@ -51,7 +51,9 @@ private int dfs(TreeNode root, int val) {
     public static class GenericSolution {
         //This solution is generic for both BST and regular binary trees
         public TreeNode convertBST(TreeNode root) {
-            if (root == null) return root;
+            if (root == null) {
+                return root;
+            }
             List<Integer> list = new ArrayList<>();
             putNodeToList(list, root);
             Collections.sort(list);
@@ -69,7 +71,9 @@ public TreeNode convertBST(TreeNode root) {
         }
 
         private TreeNode generateResultRoot(TreeNode root, TreeMap<Integer, Integer> treeMap, TreeNode result) {
-            if (root != null) result.val = treeMap.get(root.val) + root.val;
+            if (root != null) {
+                result.val = treeMap.get(root.val) + root.val;
+            }
             if (root.left != null) {
                 result.left = new TreeNode(0);
                 generateResultRoot(root.left, treeMap, result.left);
@@ -82,9 +86,15 @@ private TreeNode generateResultRoot(TreeNode root, TreeMap<Integer, Integer> tre
         }
 
         private void putNodeToList(List<Integer> list, TreeNode root) {
-            if (root != null) list.add(root.val);
-            if (root.left != null) putNodeToList(list, root.left);
-            if (root.right != null) putNodeToList(list, root.right);
+            if (root != null) {
+                list.add(root.val);
+            }
+            if (root.left != null) {
+                putNodeToList(list, root.left);
+            }
+            if (root.right != null) {
+                putNodeToList(list, root.right);
+            }
         }
     }
 

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

@@ -24,7 +24,9 @@ public int findMinDifference(List<String> timePoints) {
             int hour = Integer.valueOf(timeParts[0]);
             int minute = Integer.valueOf(timeParts[1]);
             int value = hour * 60 + minute;
-            if (allTimePoints[value]) return 0;
+            if (allTimePoints[value]) {
+                return 0;
+            }
             allTimePoints[value] = true;
         }
 

src/main/java/com/fishercoder/solutions/_541.java

@@ -18,13 +18,17 @@ public class _541 {
     public String reverseStr(String s, int k) {
         StringBuilder stringBuilder = new StringBuilder();
         for (int i = 0; i < s.length(); i = i + 2 * k) {
-            if (s.length() >= (i + k)) stringBuilder.append(new StringBuilder(s.substring(i, i + k)).reverse());
-            else {
+            if (s.length() >= (i + k)) {
+                stringBuilder.append(new StringBuilder(s.substring(i, i + k)).reverse());
+            } else {
                 stringBuilder.append(new StringBuilder(s.substring(i)).reverse());
                 break;
             }
-            if ((i + 2 * k) <= s.length()) stringBuilder.append(s.substring(i + k, i + 2 * k));
-            else stringBuilder.append(s.substring(i + k));
+            if ((i + 2 * k) <= s.length()) {
+                stringBuilder.append(s.substring(i + k, i + 2 * k));
+            } else {
+                stringBuilder.append(s.substring(i + k));
+            }
         }
         return stringBuilder.toString();
     }

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

@@ -42,8 +42,11 @@ public List<List<Integer>> updateMatrix(List<List<Integer>> matrix) {
         Deque<int[]> deque = new LinkedList<>();
         for (int i = 0; i < m; i++) {
             for (int j = 0; j < n; j++) {
-                if (matrix.get(i).get(j) == 0) deque.offer(new int[]{i, j});
-                else matrix.get(i).set(j, Integer.MAX_VALUE);
+                if (matrix.get(i).get(j) == 0) {
+                    deque.offer(new int[]{i, j});
+                } else {
+                    matrix.get(i).set(j, Integer.MAX_VALUE);
+                }
             }
         }
 
@@ -53,8 +56,9 @@ public List<List<Integer>> updateMatrix(List<List<Integer>> matrix) {
             for (int i = 0; i < dirs.length - 1; i++) {
                 int nextRow = currentCell[0] + dirs[i];
                 int nextCol = currentCell[1] + dirs[i + 1];
-                if (nextRow < 0 || nextCol < 0 || nextRow >= m || nextCol >= n || matrix.get(nextRow).get(nextCol) <= matrix.get(currentCell[0]).get(currentCell[1]) + 1)
+                if (nextRow < 0 || nextCol < 0 || nextRow >= m || nextCol >= n || matrix.get(nextRow).get(nextCol) <= matrix.get(currentCell[0]).get(currentCell[1]) + 1) {
                     continue;
+                }
                 deque.offer(new int[]{nextRow, nextCol});
                 matrix.get(nextRow).set(nextCol, matrix.get(currentCell[0]).get(currentCell[1]) + 1);
             }

src/main/java/com/fishercoder/solutions/_543.java

@@ -26,7 +26,9 @@ public int diameterOfBinaryTree(TreeNode root) {
     }
 
     private int dfs(TreeNode root) {
-        if (root == null) return 0;
+        if (root == null) {
+            return 0;
+        }
         int left = dfs(root.left);
         int right = dfs(root.right);
         diameter = Math.max(diameter, left + right);

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

@@ -58,7 +58,9 @@ public String findContestMatch(int n) {
             left++;
             right--;
         }
-        if (n == 2) return pairs.get(0);
+        if (n == 2) {
+            return pairs.get(0);
+        }
         return generateFinal(pairs, n / 2);
     }
 

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

@@ -38,7 +38,9 @@
 public class _547 {
 
     public int findCircleNum(int[][] M) {
-        if (M == null || M.length == 0 || M[0].length == 0) return 0;
+        if (M == null || M.length == 0 || M[0].length == 0) {
+            return 0;
+        }
         int m = M.length;//number of rows in this matrix
         UnionFind unionFind = new UnionFind(m);
         for (int i = 0; i < m; i++) {
@@ -73,7 +75,9 @@ public void union(int i, int j) {
         }
 
         public int find(int[] ids, int i) {
-            if (ids[i] == i) return i;
+            if (ids[i] == i) {
+                return i;
+            }
             return find(ids, ids[i]);
         }
     }