enable MultipleVariableDeclarations check!

Author: fishercoder1534

fishercoder_checkstyle.xml

@@ -115,7 +115,7 @@
             <property name="allowNoEmptyLineBetweenFields" value="true"/>
         module>
 
-        <!--<module name="MultipleVariableDeclarations"/>-->
+        <module name="MultipleVariableDeclarations"/>
 
         <module name="SeparatorWrap">
             <property name="tokens" value="DOT"/>

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

@@ -30,7 +30,8 @@ public int maxProfit(int k, int[] prices) {
 
 
     private int quickSolve(int[] prices) {
-        int len = prices.length, profit = 0;
+        int len = prices.length;
+        int profit = 0;
         for (int i = 1; i < len; i++) {
             // as long as there is a price gap, we gain a profit.
             if (prices[i] > prices[i - 1]) profit += prices[i] - prices[i - 1];

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

@@ -56,7 +56,8 @@ public ListNode removeNthFromEnd_one_pass(ListNode head, int n) {
         //then, when fast reaches null, slow reaches the point where the node should be deleted.
         ListNode dummy = new ListNode(-1);
         dummy.next = head;
-        ListNode slow = head, fast = head;
+        ListNode slow = head;
+        ListNode fast = head;
         int tempN = n;
         while (tempN-- > 0) {
             fast = fast.next;
@@ -87,7 +88,8 @@ public ListNode removeNthFromEnd_one_pass(ListNode head, int n) {
     public ListNode removeNthFromEnd_one_pass_more_concise_version(ListNode head, int n) {
         ListNode dummy = new ListNode(-1);
         dummy.next = head;
-        ListNode slow = dummy, fast = dummy;
+        ListNode slow = dummy;
+        ListNode fast = dummy;
         while (fast.next != null) {
             if (n <= 0) slow = slow.next;
             fast = fast.next;

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

@@ -31,7 +31,8 @@ public static class DFSSolution {
         public int numIslands(char[][] grid) {
             if (grid == null || grid.length == 0) return 0;
             int count = 0;
-            int m = grid.length, n = grid[0].length;
+            int m = grid.length;
+            int n = grid[0].length;
             for (int i = 0; i < m; i++) {
                 for (int j = 0; j < n; j++) {
                     if (grid[i][j] == '1') {
@@ -95,7 +96,8 @@ public int numIslands(char[][] grid) {
             if (grid == null || grid.length == 0 || grid[0].length == 0) return 0;
             int[] dirs = new int[]{0, 1, 0, -1, 0};
             UnionFind uf = new UnionFind(grid);
-            int m = grid.length, n = grid[0].length;
+            int m = grid.length;
+            int n = grid[0].length;
             for (int i = 0; i < m; i++) {
                 for (int j = 0; j < n; j++) {
                     if (grid[i][j] == '1') {

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

@@ -26,7 +26,8 @@ public class _203 {
 	public ListNode removeElements(ListNode head, int val) {
 		ListNode dummy = new ListNode(-1);
 		dummy.next = head;
-		ListNode curr = head, prev = dummy;
+		ListNode curr = head;
+		ListNode prev = dummy;
 		while (curr != null) {
 			if (curr.val == val) {
 				prev.next = curr.next;

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

@@ -15,7 +15,10 @@ public class _209 {
 
     public int minSubArrayLen(int s, int[] nums) {
         if (nums == null || nums.length == 0) return 0;
-        int i = 0, j = 0, min = Integer.MAX_VALUE, sum = 0;
+        int i = 0;
+        int j = 0;
+        int min = Integer.MAX_VALUE;
+        int sum = 0;
         while (j < nums.length) {
             sum += nums[j++];
 

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

@@ -18,7 +18,8 @@ public class _221 {
     /**The idea is pretty straightforward: use a 2d dp table to store the intermediate results*/
     public static int maximalSquare(char[][] matrix) {
         if (matrix == null || matrix.length == 0) return 0;
-        int m = matrix.length, n = matrix[0].length;
+        int m = matrix.length;
+        int n = matrix[0].length;
         int max = Integer.MIN_VALUE;
         int[][] dp = new int[m][n];
         for (int i = 0; i < m; i++) {

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

@@ -16,7 +16,8 @@ public class _233 {
     public int countDigitOne(int n) {
         int count = 0;
         for (long k = 1; k <= n; k *= 10) {
-            long r = n / k, m = n % k;
+            long r = n / k;
+            long m = n % k;
             // sum up the count of ones on every place k
             count += (r + 8) / 10 * k + (r % 10 == 1 ? m + 1 : 0);
         }

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

@@ -21,7 +21,8 @@ public static class Solution1 {
         public boolean isPalindrome(ListNode head) {
             if (head == null) return true;
 
-            ListNode slow = head, fast = head;
+            ListNode slow = head;
+            ListNode fast = head;
             while (fast.next != null && fast.next.next != null) {
                 fast = fast.next.next;
                 slow = slow.next;

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

@@ -14,7 +14,9 @@ public class _243 {
 
     public int shortestDistance(String[] words, String word1, String word2) {
 
-        int p = -1, q = -1, min = Integer.MAX_VALUE;
+        int p = -1;
+        int q = -1;
+        int min = Integer.MAX_VALUE;
         for (int i = 0; i < words.length; i++) {
             if (words[i].equals(word1)) p = i;
             if (words[i].equals(word2)) q = i;