refactor for format

Author: fishercoder1534

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

@@ -41,12 +41,16 @@ public class _653 {
 
     public static class ListSolution {
         public boolean findTarget(TreeNode root, int k) {
-            if (root == null) return false;
+            if (root == null) {
+                return false;
+            }
             List<Integer> list = new ArrayList<>();
             dfs(root, list);
             for (int i = 0; i < list.size() - 1; i++) {
                 for (int j = i + 1; j < list.size(); j++) {
-                    if (list.get(i) + list.get(j) == k) return true;
+                    if (list.get(i) + list.get(j) == k) {
+                        return true;
+                    }
                 }
             }
             return false;
@@ -66,7 +70,9 @@ private void dfs(TreeNode root, List<Integer> list) {
     @Notes(todo = "This solution fails by _653Test.test6(), need to fix it.")
     public static class MapSolution {
         public boolean findTarget(TreeNode root, int k) {
-            if (root == null) return false;
+            if (root == null) {
+                return false;
+            }
             Map<Integer, Integer> map = new HashMap();//value is index
             int index = 0;
             preorder(root, map, index);

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

@@ -54,7 +54,9 @@ public List<Integer> findClosestElements(List<Integer> arr, int k, int x) {
     }
 
     private int findInsertPosition(List<Integer> arr, int x) {
-        if (arr == null || arr.size() == 0) return 0;
+        if (arr == null || arr.size() == 0) {
+            return 0;
+        }
         int len = arr.size();
         for (int i = 0; i < len; i++) {
             if (arr.get(0) > x) {

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

@@ -52,7 +52,9 @@ public boolean isPossible(int[] nums) {
                 freqMap.put(i+1, freqMap.get(i+1) - 1);
                 freqMap.put(i+2, freqMap.get(i+2) - 1);
                 appendFreqMap.put(i+3, appendFreqMap.getOrDefault(i+3, 0) + 1);
-            } else return false;
+            } else {
+                return false;
+            }
             freqMap.put(i, freqMap.get(i) - 1);
         }
         return true;

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

@@ -30,7 +30,9 @@ For the point (1,1): floor(8/9) = floor(0.88888889) = 0
  */
 public class _661 {
     public int[][] imageSmoother(int[][] M) {
-        if (M == null || M.length == 0) return M;
+        if (M == null || M.length == 0) {
+            return M;
+        }
         int m = M.length;
         int n = M[0].length;
         int[][] result = new int[m][n];

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

@@ -59,7 +59,9 @@ public class _663 {
     public boolean checkEqualTree(TreeNode root) {
         Map<TreeNode, Integer> map = new HashMap<>();
         int totalSum = sumForEachNode(root, map);
-        if (totalSum % 2 != 0 || map.size() < 2) return false;
+        if (totalSum % 2 != 0 || map.size() < 2) {
+            return false;
+        }
         for (TreeNode key : map.keySet()) {
             if (map.get(key) == totalSum / 2) {
                 return true;

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

@@ -24,7 +24,9 @@ public class _664 {
     /**reference: https://discuss.leetcode.com/topic/100137/java-solution-dp*/
     public int strangePrinter(String s) {
         int n = s.length();
-        if (n == 0) return 0;
+        if (n == 0) {
+            return 0;
+        }
 
         int[][] dp = new int[101][101];
         for (int i = 0; i < n; i++) {

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

@@ -17,12 +17,18 @@ public String addBinary(String a, String b){
         StringBuilder sb = new StringBuilder();
         while(i >= 0 || j >= 0){
             int sum = carry;
-            if(i >= 0) sum += a.charAt(i--) - '0';
-            if(j >= 0) sum += b.charAt(j--) - '0';
+            if(i >= 0) {
+                sum += a.charAt(i--) - '0';
+            }
+            if(j >= 0) {
+                sum += b.charAt(j--) - '0';
+            }
             sb.append(sum%2);
             carry = sum/2;
         }
-        if(carry != 0) sb.append(carry);
+        if(carry != 0) {
+            sb.append(carry);
+        }
         return sb.reverse().toString();
     }
 

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

@@ -31,8 +31,9 @@ public class _68 {
 
     public static List<String> fullJustify(String[] words, int L) {
         ArrayList<String> result = new ArrayList();
-        if(words == null || words.length == 0)
+        if(words == null || words.length == 0) {
             return result;
+        }
         int count = 0;
         int last = 0;
         for(int i = 0; i < words.length; i++){

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

@@ -13,9 +13,13 @@ public int mySqrt(int x) {
         while(i <= j){
             long mid = (i+j)/2;
             long result = mid*mid;
-            if(result == (long) x) return (int) mid;
-            else if(result > x) j = mid-1;
-            else i = mid+1;
+            if(result == (long) x) {
+                return (int) mid;
+            } else if(result > x) {
+                j = mid-1;
+            } else {
+                i = mid+1;
+            }
             System.out.println(mid + " * " + mid + " = " + result + "\ti = " + i + "\tj = " + j);
         }
         return (int) j;

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

@@ -10,13 +10,17 @@ public int reverse_short_version(int x){
         while(x != 0){
             rev = rev*10 + x%10;
             x /= 10;
-            if(rev > Integer.MAX_VALUE || rev < Integer.MIN_VALUE) return 0;
+            if(rev > Integer.MAX_VALUE || rev < Integer.MIN_VALUE) {
+                return 0;
+            }
         }
         return (int) rev;
     }
 
     public int reverse(int x) {
-        if(x == 0) return 0;
+        if(x == 0) {
+            return 0;
+        }
         //save the first bit if it's a negative sign
         StringBuilder sb = new StringBuilder();
         sb.append(x);

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

@@ -6,8 +6,12 @@
 public class _70 {
     //classical dp problem
     public int climbStairs(int n) {
-        if(n < 1) return 0;
-        if(n < 4) return n;
+        if(n < 1) {
+            return 0;
+        }
+        if(n < 4) {
+            return n;
+        }
         int[] dp = new int[n+1];
         //the number of ways to reach step n could be calculated from n-1 and n-2
         dp[1] = 1;

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

@@ -21,8 +21,11 @@ public String simplifyPath(String path) {
         Deque<String> stack = new LinkedList<>();
         Set<String> skipSet = new HashSet<>(Arrays.asList("..", ".", ""));
         for (String dir : path.split("/")) {
-            if (dir.equals("..") && !stack.isEmpty()) stack.pop();
-            else if (!skipSet.contains(dir)) stack.push(dir);
+            if (dir.equals("..") && !stack.isEmpty()) {
+                stack.pop();
+            } else if (!skipSet.contains(dir)) {
+                stack.push(dir);
+            }
         }
         String result = "";
         for (String dir : stack) {