refactor for format

Author: fishercoder1534

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

@@ -14,20 +14,30 @@ public class _72 {
 
     public int minDistance(String word1, String word2) {
         int m = word1.length(), n = word2.length();
-        if(m == 0) return n;
-        if(n == 0) return m;
+        if(m == 0) {
+            return n;
+        }
+        if(n == 0) {
+            return m;
+        }
 
         char[] str1 = word1.toCharArray();
         char[] str2 = word2.toCharArray();
 
         int[][] table = new int[m+1][n+1];
-        for(int i = 0; i < m+1; i++) table[i][0] = i;
-        for(int j = 0; j < n+1; j++) table[0][j] = j;
+        for(int i = 0; i < m+1; i++) {
+            table[i][0] = i;
+        }
+        for(int j = 0; j < n+1; j++) {
+            table[0][j] = j;
+        }
 
         for(int i = 1; i < m+1; i++){
             for(int j = 1; j < n+1; j++){
                 int cost = 0;
-                if(str1[i-1] != str2[j-1]) cost = 1;
+                if(str1[i-1] != str2[j-1]) {
+                    cost = 1;
+                }
                 table[i][j] = Math.min(Math.min(table[i-1][j]+1, table[i][j-1]+1), table[i-1][j-1]+cost);
             }
         }

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

@@ -19,7 +19,9 @@ public static class Solution1 {
          * Space: O(m*n)
          */
         public void setZeroes(int[][] matrix) {
-            if (matrix == null || matrix.length == 0) return;
+            if (matrix == null || matrix.length == 0) {
+                return;
+            }
             int height = matrix.length, width = matrix[0].length;
             boolean[][] zero = new boolean[height][width];
             for (int i = 0; i < height; i++) {
@@ -85,7 +87,9 @@ public static class Solution3 {
          * Space: O(1)
          */
         public void setZeroes(int[][] matrix) {
-            if (matrix == null || matrix.length == 0) return;
+            if (matrix == null || matrix.length == 0) {
+                return;
+            }
             int m = matrix.length;
             int n = matrix[0].length;
             boolean firstRow = false;

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

@@ -19,9 +19,13 @@ public class _75 {
     public void sortColors(int[] nums) {
         int zero = 0, two = nums.length-1;
         for(int i = 0; i <= two;){
-            if(nums[i] == 0 && i > zero) swap(nums, i, zero++);
-            else if(nums[i] == 2 && i < two) swap(nums, i, two--);
-            else i++;
+            if(nums[i] == 0 && i > zero) {
+                swap(nums, i, zero++);
+            } else if(nums[i] == 2 && i < two) {
+                swap(nums, i, two--);
+            } else {
+                i++;
+            }
         }
     }
 

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

@@ -23,7 +23,9 @@ public String minWindow(String s, String t) {
 
         int start = 0, end = 0, minStart = 0, minLen = Integer.MAX_VALUE, counter = t.length();
         while(end < s.length()){
-            if(counts[s.charAt(end)] > 0) counter--;
+            if(counts[s.charAt(end)] > 0) {
+                counter--;
+            }
 
             counts[s.charAt(end)]--;
             end++;
@@ -34,12 +36,16 @@ public String minWindow(String s, String t) {
                     minLen = end-start;
                 }
                 counts[s.charAt(start)]++;
-                if(counts[s.charAt(start)] > 0) counter++;
+                if(counts[s.charAt(start)] > 0) {
+                    counter++;
+                }
                 start++;
             }
         }
 
-        if(minLen == Integer.MAX_VALUE) return "";
+        if(minLen == Integer.MAX_VALUE) {
+            return "";
+        }
         return s.substring(minStart, minStart+minLen);
     }
 

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

@@ -30,7 +30,9 @@ public static List<List<Integer>> subsets(int[] nums) {
             List<List<Integer>> result = new ArrayList();
             List<Integer> empty = new ArrayList();
             result.add(empty);
-            if (nums == null) return result;
+            if (nums == null) {
+                return result;
+            }
             for (int i = 0; i < nums.length; i++) {
                 List<List<Integer>> temp = new ArrayList();
                 //you'll have to create a new one here, otherwise, it'll throw ConcurrentModificationException.

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

@@ -28,20 +28,28 @@ public boolean exist(char[][] board, String word) {
             visited = new boolean[m][n];
             for (int i = 0; i < m; i++) {
                 for (int j = 0; j < n; j++) {
-                    if (word.charAt(0) == board[i][j] && search(board, word, i, j, 0)) return true;
+                    if (word.charAt(0) == board[i][j] && search(board, word, i, j, 0)) {
+                        return true;
+                    }
                 }
             }
             return false;
         }
 
         boolean search(char[][] board, String word, int i, int j, int pos) {
-            if (pos == word.length()) return true;
-            if (i < 0 || j < 0 || i >= board.length || j >= board[0].length || word.charAt(pos) != board[i][j] || visited[i][j]) return false;
+            if (pos == word.length()) {
+                return true;
+            }
+            if (i < 0 || j < 0 || i >= board.length || j >= board[0].length || word.charAt(pos) != board[i][j] || visited[i][j]) {
+                return false;
+            }
             visited[i][j] = true;
             if (search(board, word, i+1, j, pos+1)
                     || search(board, word, i-1, j, pos+1)
                     || search(board, word, i, j+1, pos+1)
-                    || search(board, word, i, j-1, pos+1)) return true;
+                    || search(board, word, i, j-1, pos+1)) {
+                return true;
+            }
 
             visited[i][j] = false;
             return false;
@@ -55,7 +63,9 @@ public boolean exist(char[][] board, String word) {
         for(int i = 0; i < m; i++){
             for(int j = 0; j < n; j++){
                 boolean[][] visited = new boolean[m][n];
-                if(dfs(board, visited, i, j, word, 0)) return true;
+                if(dfs(board, visited, i, j, word, 0)) {
+                    return true;
+                }
             }
         }
         return false;
@@ -64,8 +74,9 @@ public boolean exist(char[][] board, String word) {
     final int[] dirs = new int[]{0,1,0,-1,0};
 
     boolean dfs(char[][] board, boolean[][] visited, int row, int col, String word, int index){
-        if(index >= word.length() || word.charAt(index) != board[row][col]) return false;
-        else if(index == word.length()-1 && word.charAt(index) == board[row][col]) {
+        if(index >= word.length() || word.charAt(index) != board[row][col]) {
+            return false;
+        } else if(index == word.length()-1 && word.charAt(index) == board[row][col]) {
             visited[row][col] = true;
             return true;
         }
@@ -74,10 +85,15 @@ else if(index == word.length()-1 && word.charAt(index) == board[row][col]) {
         for(int i = 0; i < 4; i++){
             int nextRow = row+dirs[i];
             int nextCol = col+dirs[i+1];
-            if(nextRow < 0 || nextRow >= board.length || nextCol < 0 || nextCol >= board[0].length || visited[nextRow][nextCol]) continue;
+            if(nextRow < 0 || nextRow >= board.length || nextCol < 0 || nextCol >= board[0].length || visited[nextRow][nextCol]) {
+                continue;
+            }
             result = dfs(board, visited, nextRow, nextCol, word, index+1);
-            if(result) return result;
-            else visited[nextRow][nextCol] = false;//set it back to false if this road doesn't work to allow it for other paths, this is backtracking!!!
+            if(result) {
+                return result;
+            } else {
+                visited[nextRow][nextCol] = false;//set it back to false if this road doesn't work to allow it for other paths, this is backtracking!!!
+            }
         }
         return result;
     }