refactor for format

Author: fishercoder1534

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

@@ -44,9 +44,13 @@ public int lengthOfLIS(int[] nums) {
              *         that this guarantees that the return value will be >= 0 if
              *         and only if the key is found.*/
             int index = Arrays.binarySearch(dp, 0, len, x);
-            if (index < 0) index = -(index + 1);
+            if (index < 0) {
+                index = -(index + 1);
+            }
             dp[index] = x;
-            if (index == len) len++;
+            if (index == len) {
+                len++;
+            }
         }
         return len;
     }

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

@@ -21,7 +21,9 @@ public class _301 {
 
 	public List<String> removeInvalidParentheses(String s) {
 		List<String> result = new ArrayList<>();
-		if (s == null) return result;
+		if (s == null) {
+			return result;
+		}
 
 		Set<String> visited = new HashSet();
 		Queue<String> q = new LinkedList();
@@ -38,12 +40,14 @@ public List<String> removeInvalidParentheses(String s) {
 				result.add(curr);
 			}
 
-			if (found)
+			if (found) {
 				continue;//this means if the initial input is already a valid one, we'll just directly return it and there's actually only one valid result
+			}
 
 			for (int i = 0; i < curr.length(); i++) {
-				if (curr.charAt(i) != '(' && curr.charAt(i) != ')')
+				if (curr.charAt(i) != '(' && curr.charAt(i) != ')') {
 					continue;//this is to rule out those non-parentheses characters
+				}
 
 				String next = curr.substring(0, i) + curr.substring(i + 1);
 				if (!visited.contains(next)) {
@@ -61,10 +65,14 @@ private boolean isValid(String str) {
 		int count = 0;
 		for (int i = 0; i < chars.length; i++) {
 			char c = chars[i];
-			if (c == '(') count++;
+			if (c == '(') {
+				count++;
+			}
 			if (c == ')') {
 				count--;
-				if (count == -1) return false;
+				if (count == -1) {
+					return false;
+				}
 			}
 		}
 		return count == 0;

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

@@ -48,7 +48,9 @@ private int searchRows(int i, int j, int left, int right, boolean opt) {
             while (i != j) {
                 int k = left;
                 int mid = (i + j) / 2;
-                while (k < right && image[mid][k] == '0') ++k;
+                while (k < right && image[mid][k] == '0') {
+                    ++k;
+                }
                 if (k < right == opt) {
                     j = mid;
                 } else {

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

@@ -27,7 +27,9 @@ public NumArray(int[] nums) {
         }
 
         public int sumRange(int i, int j) {
-            if (i == 0) return sums[j];
+            if (i == 0) {
+                return sums[j];
+            }
             return sums[j] - sums[i - 1];
         }
     }

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

@@ -28,8 +28,9 @@ public class _304 {
     public class NumMatrix {
 
         public NumMatrix(int[][] matrix) {
-            if (matrix == null || matrix.length == 0 || matrix[0].length == 0)
+            if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
                 return;
+            }
 
             /**The dimensions of this tot matrix is actually 1 bigger than the given matrix, cool!*/
             tot = new int[matrix.length + 1][matrix[0].length + 1];

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

@@ -44,8 +44,9 @@ public class _305 {
 
     public int find(int[] father, int id) {
         int tf = father[id];
-        while (tf != father[tf])
+        while (tf != father[tf]) {
             tf = father[tf];
+        }
         int cur = id;
         int tmp;
         while (father[cur] != tf) {
@@ -71,12 +72,14 @@ public void union(int[] father, int[] sz, int id1, int id2) {
     }
 
     public List<Integer> numIslands2(int m, int n, int[][] positions) {
-        if (m == 0 || n == 0)
-            return new ArrayList<Integer>();
-        ArrayList<Integer> res = new ArrayList<Integer>();
+        if (m == 0 || n == 0) {
+            return new ArrayList<>();
+        }
+        ArrayList<Integer> res = new ArrayList();
         int[] father = new int[m * n];
-        for (int i = 0; i < father.length; i++)
+        for (int i = 0; i < father.length; i++) {
             father[i] = -1;
+        }
         int[] sz = new int[m * n];
         int[] dr = { 0, 0, -1, 1 };
         int[] dc = { -1, 1, 0, 0 };

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

@@ -24,23 +24,31 @@ public boolean isAdditiveNumber(String num) {
         int n = num.length();
         for (int i = 1; i <= n / 2; ++i) {
             for (int j = 1; Math.max(j, i) <= n - i - j; ++j) {
-                if (isValid(i, j, num)) return true;
+                if (isValid(i, j, num)) {
+                    return true;
+                }
             }
         }
         return false;
     }
 
     private boolean isValid(int i, int j, String num) {
-        if (num.charAt(0) == '0' && i > 1) return false;
-        if (num.charAt(i) == '0' && j > 1) return false;
+        if (num.charAt(0) == '0' && i > 1) {
+            return false;
+        }
+        if (num.charAt(i) == '0' && j > 1) {
+            return false;
+        }
         String sum;
         Long x1 = Long.parseLong(num.substring(0, i));
         Long x2 = Long.parseLong(num.substring(i, i + j));
         for (int start = i + j; start != num.length(); start += sum.length()) {
             x2 = x2 + x1;
             x1 = x2 - x1;
             sum = x2.toString();
-            if (!num.startsWith(sum, start)) return false;
+            if (!num.startsWith(sum, start)) {
+                return false;
+            }
         }
         return true;
     }

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

@@ -32,7 +32,9 @@ public class NumMatrix {
             int width;
 
             public NumMatrix(int[][] matrix) {
-                if (matrix.length == 0 || matrix[0].length == 0) return;
+                if (matrix.length == 0 || matrix[0].length == 0) {
+                    return;
+                }
                 height = matrix.length;
                 width = matrix[0].length;
                 this.nums = new int[height][width];
@@ -45,7 +47,9 @@ public NumMatrix(int[][] matrix) {
             }
 
             public void update(int rowIndex, int colIndex, int newVal) {
-                if (height == 0 || width == 0) return;
+                if (height == 0 || width == 0) {
+                    return;
+                }
                 int delta = newVal - nums[rowIndex][colIndex];
                 nums[rowIndex][colIndex] = newVal;
                 for (int i = rowIndex + 1; i <= height; i += i & (-i)) {
@@ -56,7 +60,9 @@ public void update(int rowIndex, int colIndex, int newVal) {
             }
 
             public int sumRegion(int row1, int col1, int row2, int col2) {
-                if (height == 0 || width == 0) return 0;
+                if (height == 0 || width == 0) {
+                    return 0;
+                }
                 return sum(row2 + 1, col2 + 1) + sum(row1, col1) - sum(row1, col2 + 1) - sum(row2 + 1, col1);
             }
 

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

@@ -121,8 +121,9 @@ static class solutionWithTheSecondHighestUpvotes {
          * We cannot sell. The max profit at i = 0 ending with a sell is 0.
          */
         public int maxProfit(int[] prices) {
-            if (prices == null || prices.length <= 1)
+            if (prices == null || prices.length <= 1) {
                 return 0;
+            }
 
             int b0 = -prices[0];
             int b1 = b0;

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

@@ -56,26 +56,30 @@ public List<Integer> findMinHeightTrees(int n, int[][] edges) {
         }
 
         List<Set<Integer>> adj = new ArrayList<>(n);
-        for (int i = 0; i < n; ++i)
+        for (int i = 0; i < n; ++i) {
             adj.add(new HashSet<>());
+        }
         for (int[] edge : edges) {
             adj.get(edge[0]).add(edge[1]);
             adj.get(edge[1]).add(edge[0]);
         }
 
         List<Integer> leaves = new ArrayList<>();
-        for (int i = 0; i < n; ++i)
-            if (adj.get(i).size() == 1)
+        for (int i = 0; i < n; ++i) {
+            if (adj.get(i).size() == 1) {
                 leaves.add(i);
+            }
+        }
 
         while (n > 2) {
             n -= leaves.size();
             List<Integer> newLeaves = new ArrayList<>();
             for (int i : leaves) {
                 int j = adj.get(i).iterator().next();
                 adj.get(j).remove(i);
-                if (adj.get(j).size() == 1)
+                if (adj.get(j).size() == 1) {
                     newLeaves.add(j);
+                }
             }
             leaves = newLeaves;
         }