refactor for format

Author: fishercoder1534

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

@@ -10,7 +10,9 @@
 public class _37 {
 
     public void solveSudoku(char[][] board) {
-        if (board == null || board.length == 0) return;
+        if (board == null || board.length == 0) {
+            return;
+        }
         solve(board);
     }
 
@@ -39,10 +41,15 @@ private boolean solve(char[][] board) {
 
     private boolean isValid(char[][] board, int row, int col, char c) {
         for (int i = 0; i < 9; i++) {
-            if (board[i][col] != '.' && board[i][col] == c) return false;//check row
-            if (board[row][i] != '.' && board[row][i] == c) return false;//check column
-            if (board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] != '.' && board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] == c)
+            if (board[i][col] != '.' && board[i][col] == c) {
+                return false;//check row
+            }
+            if (board[row][i] != '.' && board[row][i] == c) {
+                return false;//check column
+            }
+            if (board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] != '.' && board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] == c) {
                 return false; //check 3*3 block
+            }
         }
         return true;
     }

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

@@ -26,7 +26,9 @@ public String countAndSay(int n) {
                 curr.append(count).append(say);
                 count = 1;
                 say = prev.charAt(j);
-            } else count++;
+            } else {
+                count++;
+            }
         }
         curr.append(count).append(say);
     }

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

@@ -68,8 +68,9 @@ public RandomizedSet() {
          * Inserts a value to the set. Returns true if the set did not already contain the specified element.
          */
         public boolean insert(int val) {
-            if (forwardMap.containsValue(val)) return false;
-            else {
+            if (forwardMap.containsValue(val)) {
+                return false;
+            } else {
                 forwardMap.put(index, val);
                 reverseMap.put(val, index++);
                 return true;
@@ -95,7 +96,9 @@ public boolean remove(int val) {
          */
         public int getRandom() {
             int max = forwardMap.size();
-            if (max == 1) return forwardMap.get(index - 1);
+            if (max == 1) {
+                return forwardMap.get(index - 1);
+            }
             int randomNum = random.nextInt(max);
             while (!forwardMap.containsKey(randomNum)) {
                 randomNum = random.nextInt(max);

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

@@ -24,7 +24,9 @@ public boolean canConstruct_20160924(String ransomNote, String magazine) {
 
         char[] rchars = ransomNote.toCharArray();
         for (int i = 0; i < rchars.length; i++) {
-            if (mcnt[rchars[i] - 'a'] <= 0) return false;
+            if (mcnt[rchars[i] - 'a'] <= 0) {
+                return false;
+            }
             mcnt[rchars[i] - 'a']--;
         }
         return true;
@@ -48,11 +50,17 @@ public boolean canConstruct(String ransomNote, String magazine) {
         }
 
         for (char c : ransomSet) {
-            if (!magazineSet.contains(c)) return false;
+            if (!magazineSet.contains(c)) {
+                return false;
+            }
         }
         for (char c : ransomMap.keySet()) {
-            if (!magazineMap.containsKey(c)) return false;
-            if (magazineMap.get(c) < ransomMap.get(c)) return false;
+            if (!magazineMap.containsKey(c)) {
+                return false;
+            }
+            if (magazineMap.get(c) < ransomMap.get(c)) {
+                return false;
+            }
         }
         return true;
     }

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

@@ -45,8 +45,10 @@ public Solution(int[] nums) {
         //insert next value into all possible positions, I wrote this method myself, of course it could be simplified to not use a queue
         //but it just naturally came into my mind that I used a queue
         private List<List<Integer>> buildAllComb(int[] nums) {
-            List<List<Integer>> result = new ArrayList<List<Integer>>();
-            if (nums == null || nums.length == 0) return result;
+            List<List<Integer>> result = new ArrayList();
+            if (nums == null || nums.length == 0) {
+                return result;
+            }
 
             List<Integer> list = new ArrayList<Integer>();
             list.add(nums[0]);
@@ -80,7 +82,9 @@ public int[] reset() {
          * Returns a random shuffling of the array.
          */
         public int[] shuffle() {
-            if (original == null || original.length == 0) return original;
+            if (original == null || original.length == 0) {
+                return original;
+            }
             int randomIndex = random.nextInt(combinations.size());
             List<Integer> list = combinations.get(randomIndex);
             int[] result = new int[list.size()];

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

@@ -41,7 +41,9 @@ public class _385 {
     //if it's ']', we'll just pop one nested integer from the working stack and assign it to the result
 
     public NestedInteger deserialize(String s) {
-        if (s == null || s.isEmpty() || s.length() == 0) return new NestedInteger();
+        if (s == null || s.isEmpty() || s.length() == 0) {
+            return new NestedInteger();
+        }
         Stack<NestedInteger> workStack = new Stack<NestedInteger>();
         NestedInteger result = null;
         StringBuilder sb = new StringBuilder();
@@ -85,10 +87,11 @@ public NestedInteger deserialize(String s) {
                     }
                     int num = Integer.parseInt(sb.toString());
                     NestedInteger ni = null;
-                    if (!workStack.isEmpty())
+                    if (!workStack.isEmpty()) {
                         ni = workStack.pop();
-                    else
+                    } else {
                         ni = new NestedInteger();
+                    }
                     // case 1: if this one contains one integer
                     if (ni.isInteger()) {
                         // we'll add it to this ni
@@ -99,12 +102,16 @@ public NestedInteger deserialize(String s) {
                         ni.add(new NestedInteger(num));
                     } else {
                         // case 3: if this is an empty nested integer
-                        if (i > 0) ni.add(new NestedInteger(num));
-                        else ni.setInteger(num);
+                        if (i > 0) {
+                            ni.add(new NestedInteger(num));
+                        } else {
+                            ni.setInteger(num);
+                        }
                     }
                     workStack.push(ni);
-                    if (i == s.length())
+                    if (i == s.length()) {
                         return ni;// this is for test cases like this: "324", there's no '[' or ']'
+                    }
                 }
             }
         }

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

@@ -27,7 +27,9 @@ public static List<Integer> lexicalOrder(int n) {
                 while (i % 10 == 9 || i == n) {
                     i /= 10;
                 }
-                if (i == 0) return result;
+                if (i == 0) {
+                    return result;
+                }
                 i++;
             }
         }
@@ -44,9 +46,13 @@ public static List<Integer> lexicalOrder_LTE_by_10458(int n) {
     private static List<Integer> addNumbers(List<Integer> result, int insertNumber, int insertPosition, int n) {
         int i;
         for (i = 0; i < 9; i++) {
-            if (insertNumber + i > n) return result;
+            if (insertNumber + i > n) {
+                return result;
+            }
             result.add(insertPosition + i, insertNumber + i);
-            if ((insertNumber + i) % 10 == 0 && (insertNumber + i) == (insertNumber + 10)) break;
+            if ((insertNumber + i) % 10 == 0 && (insertNumber + i) == (insertNumber + 10)) {
+                break;
+            }
         }
         while ((insertNumber + i) % 10 != 0 && (insertNumber + i) <= n) {
             result.add(insertPosition + i, insertNumber + i);

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

@@ -23,7 +23,9 @@ public static int firstUniqChar(String s) {
             freq[s.charAt(i) - 'a']++;
         }
         for (int i = 0; i < s.length(); i++) {
-            if (freq[s.charAt(i) - 'a'] == 1) return i;
+            if (freq[s.charAt(i) - 'a'] == 1) {
+                return i;
+            }
         }
         return -1;
     }

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

@@ -134,7 +134,9 @@ public static int parse(String input) {
             int thisLen = 0;
             String[] paths = path.split("\\t");
             CommonUtils.printArray_generic_type(paths);
-            if (paths[paths.length - 1].contains(".")) isFile = true;
+            if (paths[paths.length - 1].contains(".")) {
+                isFile = true;
+            }
             if (isFile) {
                 for (String eachDir : paths) {
                     thisLen += eachDir.length();

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

@@ -29,7 +29,9 @@ public char findTheDifference(String s, String t) {
         }
         char result = 'a';
         for (int i = 0; i < 128; i++) {
-            if (counts[i] != 0) result = (char) i;
+            if (counts[i] != 0) {
+                result = (char) i;
+            }
         }
         return result;
     }