refactor for format

Author: fishercoder1534

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

@@ -42,21 +42,37 @@
 public class _572 {
 
     public boolean isSubtree(TreeNode s, TreeNode t) {
-        if (s == null && t == null) return true;
+        if (s == null && t == null) {
+            return true;
+        }
         boolean isSubTree = false;
-        if (s != null && t != null && s.val == t.val) isSubTree = isSameTree(s, t);
-        if (isSubTree) return true;
+        if (s != null && t != null && s.val == t.val) {
+            isSubTree = isSameTree(s, t);
+        }
+        if (isSubTree) {
+            return true;
+        }
         boolean isSubTreeLeft = false;
-        if (s.left != null) isSubTreeLeft = isSubtree(s.left, t);
-        if (isSubTreeLeft) return true;
+        if (s.left != null) {
+            isSubTreeLeft = isSubtree(s.left, t);
+        }
+        if (isSubTreeLeft) {
+            return true;
+        }
         boolean isSubTreeRight = false;
-        if (s.right != null) isSubTreeRight = isSubtree(s.right, t);
-        if (isSubTreeRight) return true;
+        if (s.right != null) {
+            isSubTreeRight = isSubtree(s.right, t);
+        }
+        if (isSubTreeRight) {
+            return true;
+        }
         return false;
     }
 
     private boolean isSameTree(TreeNode p, TreeNode q) {
-        if (p == null || q == null) return p == q;
+        if (p == null || q == null) {
+            return p == q;
+        }
         return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
     }
 }

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

@@ -31,7 +31,9 @@ public int distributeCandies(int[] candies) {
         for (int i = 0; i < candies.length; i++) {
             int val = candies[i];
             sisCount++;
-            if (sisCount >= candies.length / 2) return candies.length / 2;
+            if (sisCount >= candies.length / 2) {
+                return candies.length / 2;
+            }
             while (i < candies.length && candies[i] == val) {
                 i++;
             }

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

@@ -11,7 +11,9 @@
 public class _58 {
 
     public int lengthOfLastWord(String s) {
-        if (s == null || s.length() == 0) return 0;
+        if (s == null || s.length() == 0) {
+            return 0;
+        }
         s = s.trim();
         int n = s.length() - 1;
         while (n >= 0 && s.charAt(n) != ' ') {

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

@@ -36,8 +36,12 @@ public int findUnsortedSubarray(int[] nums) {
         for (int i = 1; i < n; i++) {
             max = Math.max(max, nums[i]);
             min = Math.min(min, nums[n - 1 - i]);
-            if (nums[i] < max) end = i;
-            if (nums[n - 1 - i] > min) start = n - 1 - i;
+            if (nums[i] < max) {
+                end = i;
+            }
+            if (nums[n - 1 - i] > min) {
+                start = n - 1 - i;
+            }
         }
         return end - start + 1;
     }

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

@@ -54,7 +54,9 @@ public List<Integer> killProcess(List<Integer> pid, List<Integer> ppid, int kill
             int curr = stack.poll();
             result.add(curr);
             List<Integer> list = map.get(curr);
-            if (list != null) stack.addAll(list);
+            if (list != null) {
+                stack.addAll(list);
+            }
         }
         return result;
     }

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

@@ -65,7 +65,9 @@ public List<Point> outerTrees(Point[] points) {
             Point next = points[0];
             int nextIndex = 0;
             for (int i = 1; i < points.length; i++) {
-                if (i == curIndex) continue;
+                if (i == curIndex) {
+                    continue;
+                }
                 int cross = crossProductLength(cur, points[i], next);
                 if (nextIndex == curIndex || cross > 0
                         // Handle collinear points
@@ -76,7 +78,9 @@ public List<Point> outerTrees(Point[] points) {
             }
             // Handle collinear points
             for (int i = 0; i < points.length; i++) {
-                if (i == curIndex) continue;
+                if (i == curIndex) {
+                    continue;
+                }
                 int cross = crossProductLength(cur, points[i], next);
                 if (cross == 0) {
                     result.add(points[i]);
@@ -88,7 +92,7 @@ public List<Point> outerTrees(Point[] points) {
 
         } while (curIndex != firstIndex);
 
-        return new ArrayList<Point>(result);
+        return new ArrayList<>(result);
     }
 
     private int crossProductLength(Point A, Point B, Point C) {

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

@@ -64,8 +64,12 @@ class TrieNode {
         TrieNode dfs(String path) {
             TrieNode node = root;
             for (String eachPath : path.split("/")) {
-                if (eachPath.isEmpty()) continue;
-                if (!node.map.containsKey(eachPath)) node.map.put(eachPath, new TrieNode(eachPath));
+                if (eachPath.isEmpty()) {
+                    continue;
+                }
+                if (!node.map.containsKey(eachPath)) {
+                    node.map.put(eachPath, new TrieNode(eachPath));
+                }
                 node = node.map.get(eachPath);
             }
             return node;