enable OneStatementPerLine check

fishercoder1534 · fishercoder1534 · commit 1a0cad43407b · 2017-08-21T20:45:19.000-07:00
diff --git a/fishercoder_checkstyle.xml b/fishercoder_checkstyle.xml
@@ -85,7 +85,7 @@
             <!--<message key="ws.notPreceded"-->
                      <!--value="WhitespaceAround: ''{0}'' is not preceded with whitespace."/>-->
         <!--</module>-->
-        <!--<module name="OneStatementPerLine"/>-->
+        <module name="OneStatementPerLine"/>
         <!--<module name="MultipleVariableDeclarations"/>-->
         <module name="ArrayTypeStyle"/>
         <!--<module name="MissingSwitchDefault"/>-->
diff --git a/src/main/java/com/fishercoder/solutions/_115.java b/src/main/java/com/fishercoder/solutions/_115.java
@@ -17,14 +17,21 @@ public int numDistinct(String s, String t) {
         char[] schar = s.toCharArray();
         char[] tchar = t.toCharArray();
         
-        for(int i = 0; i <= m; i++) dp[i][0] = 1;
+        for(int i = 0; i <= m; i++) {
+            dp[i][0] = 1;
+        }
         
-        for(int j = 1; j <= n; j++) dp[0][j] = 0;
+        for(int j = 1; j <= n; j++) {
+            dp[0][j] = 0;
+        }
         
         for(int i = 1; i <= m; i++){
             for(int j = 1; j <= n; j++){
-                if(schar[i-1] == tchar[j-1]) dp[i][j] = dp[i-1][j]+dp[i-1][j-1];
-                else dp[i][j] = dp[i-1][j];
+                if(schar[i-1] == tchar[j-1]) {
+                    dp[i][j] = dp[i-1][j]+dp[i-1][j-1];
+                } else {
+                    dp[i][j] = dp[i-1][j];
+                }
             }
         }
         
diff --git a/src/main/java/com/fishercoder/solutions/_125.java b/src/main/java/com/fishercoder/solutions/_125.java
@@ -13,13 +13,20 @@
 public class _125 {
 
     public boolean isPalindrome(String s) {
-        int i = 0, j = s.length()-1;
+        int i = 0, j = s.length() - 1;
         char[] chars = s.toCharArray();
-        while(i < j){
-            while(i < j && !Character.isLetterOrDigit(chars[i])) i++;
-            while(i < j && !Character.isLetterOrDigit(chars[j])) j--;
-            if(Character.toLowerCase(chars[i]) != Character.toLowerCase(chars[j])) return false;
-            i++; j--;
+        while (i < j) {
+            while (i < j && !Character.isLetterOrDigit(chars[i])) {
+                i++;
+            }
+            while (i < j && !Character.isLetterOrDigit(chars[j])) {
+                j--;
+            }
+            if (Character.toLowerCase(chars[i]) != Character.toLowerCase(chars[j])) {
+                return false;
+            }
+            i++;
+            j--;
         }
         return true;
     }
diff --git a/src/main/java/com/fishercoder/solutions/_128.java b/src/main/java/com/fishercoder/solutions/_128.java
@@ -33,7 +33,9 @@ class UnionFind{
 
         public UnionFind(int[] nums){
             ids = new int[nums.length];
-            for(int i = 0; i < nums.length; i++) ids[i] = i;
+            for(int i = 0; i < nums.length; i++) {
+                ids[i] = i;
+            }
         }
 
         public void union(int i, int j){
diff --git a/src/main/java/com/fishercoder/solutions/_246.java b/src/main/java/com/fishercoder/solutions/_246.java
@@ -5,33 +5,40 @@
 import java.util.Map;
 import java.util.Set;
 
-/**A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).
-
- Write a function to determine if a number is strobogrammatic. The number is represented as a string.
-
- For example, the numbers "69", "88", and "818" are all strobogrammatic.*/
+/**
+ * A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).
+ * <p>
+ * Write a function to determine if a number is strobogrammatic. The number is represented as a string.
+ * <p>
+ * For example, the numbers "69", "88", and "818" are all strobogrammatic.
+ */
 
 public class _246 {
 
     public boolean isStrobogrammatic_map(String num) {
-        int i = 0, j = num.length()-1;
+        int i = 0, j = num.length() - 1;
         Map<Character, Character> map = new HashMap();
         map.put('8', '8');
         map.put('1', '1');
         map.put('0', '0');
-        if(j == 0) return map.containsKey(num.charAt(i));
-        
+        if (j == 0) return map.containsKey(num.charAt(i));
+
         map.put('9', '6');
         map.put('6', '9');
-        while(i < j){
-            if(!map.containsKey(num.charAt(i)) || !map.containsKey(num.charAt(j))) return false;
-            if(map.get(num.charAt(i)) != num.charAt(j)) return false;
-            i++;j--;
+        while (i < j) {
+            if (!map.containsKey(num.charAt(i)) || !map.containsKey(num.charAt(j))) {
+                return false;
+            }
+            if (map.get(num.charAt(i)) != num.charAt(j)) {
+                return false;
+            }
+            i++;
+            j--;
         }
         return map.containsKey(num.charAt(i));
     }
 
-    
+
     public boolean isStrobogrammatic_set(String num) {
         Set<Character> set = new HashSet();
         set.add('0');
@@ -40,16 +47,17 @@ public boolean isStrobogrammatic_set(String num) {
         set.add('8');
         set.add('9');
         char[] nums = num.toCharArray();
-        int i = 0, j = num.length()-1;
-        while(i <= j){
-            if(!set.contains(nums[i]) || !set.contains(nums[j])) return false;
-            if(nums[i] == '6' && nums[j] != '9') return false;
-            else if(nums[i] == '9' && nums[j] != '6') return false;
-            else if(nums[i] == '1' && nums[j] != '1') return false;
-            else if(nums[i] == '8' && nums[j] != '8') return false;
-            else if(nums[i] == '0' && nums[j] != '0') return false;
+        int i = 0, j = num.length() - 1;
+        while (i <= j) {
+            if (!set.contains(nums[i]) || !set.contains(nums[j])) return false;
+            if (nums[i] == '6' && nums[j] != '9') return false;
+            else if (nums[i] == '9' && nums[j] != '6') return false;
+            else if (nums[i] == '1' && nums[j] != '1') return false;
+            else if (nums[i] == '8' && nums[j] != '8') return false;
+            else if (nums[i] == '0' && nums[j] != '0') return false;
             else {
-                i++; j--;
+                i++;
+                j--;
             }
         }
         return true;
diff --git a/src/main/java/com/fishercoder/solutions/_261.java b/src/main/java/com/fishercoder/solutions/_261.java
@@ -26,13 +26,17 @@ public class _261 {
 
     public boolean validTree(int n, int[][] edges){
         int[] nums = new int[n];
-        for(int i =0; i < n; i++) nums[i] = i;
+        for(int i =0; i < n; i++) {
+            nums[i] = i;
+        }
 
         for(int i = 0; i < edges.length; i++){
             int x = find(nums, edges[i][0]);
             int y = find(nums, edges[i][1]);
 
-            if(x == y) return false;
+            if(x == y) {
+                return false;
+            }
 
             //union
             nums[x] = y;
@@ -42,7 +46,9 @@ public boolean validTree(int n, int[][] edges){
     }
 
     int find(int[] nums, int i){
-        if(nums[i] == i) return i;
+        if(nums[i] == i) {
+            return i;
+        }
         return find(nums, nums[i]);
     }
 }
diff --git a/src/main/java/com/fishercoder/solutions/_281.java b/src/main/java/com/fishercoder/solutions/_281.java
@@ -35,7 +35,9 @@ public _281(List<Integer> v1, List<Integer> v2) {
 
     public int next() {
         if (j.hasNext()) {
-            tmp = j; j = i; i = tmp;
+            tmp = j;
+            j = i;
+            i = tmp;
         }
         return i.next();
     }
diff --git a/src/main/java/com/fishercoder/solutions/_316.java b/src/main/java/com/fishercoder/solutions/_316.java
@@ -54,11 +54,17 @@ public String removeDuplicateLetters_use_stack(String s) {
     public String removeDuplicateLetters(String s) {
         int[] count = new int[26];
         int pos = 0; // the position for the smallest s[i]
-        for (int i = 0; i < s.length(); i++) count[s.charAt(i) - 'a']++;
         for (int i = 0; i < s.length(); i++) {
-            if (s.charAt(i) < s.charAt(pos)) pos = i;
+            count[s.charAt(i) - 'a']++;
+        }
+        for (int i = 0; i < s.length(); i++) {
+            if (s.charAt(i) < s.charAt(pos)) {
+                pos = i;
+            }
             count[s.charAt(i) - 'a']--;
-            if (count[s.charAt(i) - 'a'] == 0) break;
+            if (count[s.charAt(i) - 'a'] == 0) {
+                break;
+            }
         }
         return s.length() == 0 ? "" : s.charAt(pos) + removeDuplicateLetters(s.substring(pos + 1).replaceAll("" + s.charAt(pos), ""));
     }
diff --git a/src/main/java/com/fishercoder/solutions/_34.java b/src/main/java/com/fishercoder/solutions/_34.java
@@ -15,48 +15,49 @@
 public class _34 {
 
     public static int[] searchRange(int[] nums, int target) {
-        int start = 0, end = nums.length-1;
+        int start = 0, end = nums.length - 1;
         int[] range = new int[2];
-        range[0] = -1; range[1] = -1;
-        while(start+1 < end){
-            int mid = start + (end-start)/2;
-            if(nums[mid] == target) {
+        range[0] = -1;
+        range[1] = -1;
+        while (start + 1 < end) {
+            int mid = start + (end - start) / 2;
+            if (nums[mid] == target) {
                 int left = mid;
-                while(left-1 >= 0 && nums[left] == nums[left-1]){
+                while (left - 1 >= 0 && nums[left] == nums[left - 1]) {
                     left--;
                 }
                 range[0] = left;
                 int right = mid;
-                while(right+1< nums.length && nums[right] == nums[right+1]){
+                while (right + 1 < nums.length && nums[right] == nums[right + 1]) {
                     right++;
                 }
                 range[1] = right;
                 break;
-            } else if(nums[mid] < target){
+            } else if (nums[mid] < target) {
                 start = mid;
             } else {
                 end = mid;
             }
         }
-        if(nums[start] == target){
+        if (nums[start] == target) {
             range[0] = start;
-            while(start+1 < nums.length && nums[start] == nums[start+1]){
+            while (start + 1 < nums.length && nums[start] == nums[start + 1]) {
                 start++;
             }
             range[1] = start;
         }
-        if(nums[end] == target){
+        if (nums[end] == target) {
             range[1] = end;
-            while(end-1 >= 0 && nums[end] == nums[end-1]){
+            while (end - 1 >= 0 && nums[end] == nums[end - 1]) {
                 end--;
             }
             range[0] = end;
         }
         return range;
     }
 
-    public static void main(String...strings){
-        int[] nums = new int[]{1,2,3};
+    public static void main(String... strings) {
+        int[] nums = new int[]{1, 2, 3};
         int target = 2;
         int[] result = searchRange(nums, target);
         CommonUtils.printArray(result);
diff --git a/src/main/java/com/fishercoder/solutions/_345.java b/src/main/java/com/fishercoder/solutions/_345.java
@@ -42,7 +42,8 @@ public String reverseVowels(String s) {
 			char temp = left;
 			sb.setCharAt(i, right);
 			sb.setCharAt(j, temp);
-			i++; j--;
+			i++;
+			j--;
 		}
 		return sb.toString();
 	}
diff --git a/src/main/java/com/fishercoder/solutions/_388.java b/src/main/java/com/fishercoder/solutions/_388.java
@@ -20,7 +20,8 @@ public static int lengthLongestPath(String input) {
                 if(period.equals(input.charAt(i))) {
                     isFile = true;
                 }
-                i++; currStrLen++;
+                i++;
+                currStrLen++;
             }
             if(isFile) {
                 longestLen = Math.max(longestLen, currDirLen+currStrLen);
diff --git a/src/main/java/com/fishercoder/solutions/_410.java b/src/main/java/com/fishercoder/solutions/_410.java
@@ -52,14 +52,18 @@ public class _410 {
      Both of them mean that we should lower mid because we need to find the minimum one. This leads to r = mid - 1;*/
 
     public int splitArray(int[] nums, int m) {
-        int max = 0; long sum = 0;
+        int max = 0;
+        long sum = 0;
         for (int num : nums) {
             max = Math.max(num, max);
             sum += num;
         }
-        if (m == 1) return (int) sum;
+        if (m == 1) {
+            return (int) sum;
+        }
         //binary search
-        long l = max; long r = sum;
+        long l = max;
+        long r = sum;
         while (l <= r) {
             long mid = (l + r)/ 2;
             if (valid(mid, nums, m)) {
diff --git a/src/main/java/com/fishercoder/solutions/_484.java b/src/main/java/com/fishercoder/solutions/_484.java
@@ -40,11 +40,15 @@ public class _484 {
      */
     public int[] findPermutation(String s) {
         int[] result = new int[s.length()+1];
-        for (int i = 0; i <= s.length(); i++) result[i] = i+1;
+        for (int i = 0; i <= s.length(); i++) {
+            result[i] = i+1;
+        }
         for (int i = 0; i < s.length(); i++) {
             if (s.charAt(i) == 'D') {
                 int left = i;
-                while (i < s.length() && s.charAt(i) == 'D') i++;
+                while (i < s.length() && s.charAt(i) == 'D') {
+                    i++;
+                }
                 reverse(result, left, i);
             }
         }
diff --git a/src/main/java/com/fishercoder/solutions/_499.java b/src/main/java/com/fishercoder/solutions/_499.java
@@ -58,7 +58,9 @@ public String findShortestWay(int[][] maze, int[] ball, int[] hole) {
         heap.offer(new Point(ball[0], ball[1], 0, ""));
         int m = maze.length, n = maze[0].length;
         Point[][] points = new Point[m][n];
-        for (int i = 0; i < m*n; i++) points[i/n][i%n] = new Point(i/n, i%n);//initialize the length array
+        for (int i = 0; i < m*n; i++) {
+            points[i/n][i%n] = new Point(i/n, i%n);//initialize the length array
+        }
         String[] ds = new String[]{"u", "r", "d", "l"};
         while (!heap.isEmpty()) {
             Point curr = heap.poll();
diff --git a/src/main/java/com/fishercoder/solutions/_505.java b/src/main/java/com/fishercoder/solutions/_505.java
@@ -60,7 +60,9 @@ public int shortestDistance(int[][] maze, int[] start, int[] destination) {
         queue.offer(new Point(start[0], start[1], 0));
         int m = maze.length, n = maze[0].length;
         int[][] length = new int[m][n];
-        for (int i = 0; i < m*n; i++) length[i/n][i%n] = Integer.MAX_VALUE;//initialize the length array
+        for (int i = 0; i < m*n; i++) {
+            length[i/n][i%n] = Integer.MAX_VALUE;//initialize the length array
+        }
 
         while (!queue.isEmpty()) {
             Point curr = queue.poll();

Original file line number	Diff line number	Diff line change
`@@ -33,7 +33,9 @@ class UnionFind{`
`33`	`33`
`34`	`34`	`public UnionFind(int[] nums){`
`35`	`35`	`ids = new int[nums.length];`
`36`		`- for(int i = 0; i < nums.length; i++) ids[i] = i;`
	`36`	`+ for(int i = 0; i < nums.length; i++) {`
	`37`	`+ ids[i] = i;`
	`38`	`+ }`
`37`	`39`	`}`
`38`	`40`
`39`	`41`	`public void union(int i, int j){`
Original file line number	Diff line number	Diff line change
`@@ -35,7 +35,9 @@ public _281(List<Integer> v1, List<Integer> v2) {`
`35`	`35`
`36`	`36`	`public int next() {`
`37`	`37`	`if (j.hasNext()) {`
`38`		`- tmp = j; j = i; i = tmp;`
	`38`	`+ tmp = j;`
	`39`	`+ j = i;`
	`40`	`+ i = tmp;`
`39`	`41`	`}`
`40`	`42`	`return i.next();`
`41`	`43`	`}`
Original file line number	Diff line number	Diff line change
`@@ -42,7 +42,8 @@ public String reverseVowels(String s) {`
`42`	`42`	`char temp = left;`
`43`	`43`	`sb.setCharAt(i, right);`
`44`	`44`	`sb.setCharAt(j, temp);`
`45`		`- i++; j--;`
	`45`	`+ i++;`
	`46`	`+ j--;`
`46`	`47`	`}`
`47`	`48`	`return sb.toString();`
`48`	`49`	`}`