enable GenericWhitespace check!

Author: fishercoder1534

fishercoder_checkstyle.xml

@@ -172,16 +172,17 @@
         module>
 
         <module name="NoFinalizer"/>
-        
-            
-                     
-            
-                     
-            
-                     
-            
-                     
-        
+
+        <module name="GenericWhitespace">
+            <message key="ws.followed"
+                     value="GenericWhitespace ''{0}'' is followed by whitespace."/>
+            <message key="ws.preceded"
+                     value="GenericWhitespace ''{0}'' is preceded with whitespace."/>
+            <message key="ws.illegalFollow"
+                     value="GenericWhitespace ''{0}'' should followed by whitespace."/>
+            <message key="ws.notPreceded"
+                     value="GenericWhitespace ''{0}'' is not preceded with whitespace."/>
+        module>
 
         
             

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

@@ -43,48 +43,48 @@ But TreeMap in Java supports all the three operations in O(logn) time.*/
 
 public class _218 {
 
-    class BuildingPoint implements Comparable<BuildingPoint>{
+    class BuildingPoint implements Comparable<BuildingPoint> {
         int x;
         boolean isStart;
         int h;
-        
-        public BuildingPoint(int x, boolean isStart, int h){
+
+        public BuildingPoint(int x, boolean isStart, int h) {
             this.x = x;
             this.h = h;
             this.isStart = isStart;
         }
-        
+
         @Override
-        public int compareTo(BuildingPoint o){
-            if(this.x != o.x){
+        public int compareTo(BuildingPoint o) {
+            if (this.x != o.x) {
                 return this.x - o.x;
             } else {
-                if(this.isStart && o.isStart){
-                    return  o.h - this.h;
-                } else if(this.isStart && !o.isStart){
+                if (this.isStart && o.isStart) {
+                    return o.h - this.h;
+                } else if (this.isStart && !o.isStart) {
                     return -this.h - o.h;
-                } else if(!this.isStart && !o.isStart){
+                } else if (!this.isStart && !o.isStart) {
                     return this.h - o.h;
                 } else {
                     return this.h + o.h;
                 }
             }
         }
     }
-    
+
     public List<int[]> getSkyline(int[][] buildings) {
-        BuildingPoint[] bps = new BuildingPoint[buildings.length*2];
+        BuildingPoint[] bps = new BuildingPoint[buildings.length * 2];
         int index = 0;
-        for(int[] building : buildings){
+        for (int[] building : buildings) {
             BuildingPoint bp1 = new BuildingPoint(building[0], true, building[2]);
             BuildingPoint bp2 = new BuildingPoint(building[1], false, building[2]);
             bps[index++] = bp1;
             bps[index++] = bp2;
         }
-        
+
         //this is one key step:
         Arrays.sort(bps);
-        
+
         List<int[]> result = new ArrayList();
         TreeMap<Integer, Integer> treeMap = new TreeMap();
         treeMap.put(0, 1);
@@ -107,7 +107,7 @@ public List getSkyline(int[][] buildings) {
             }
 
         }
-        
+
         return result;
     }
 

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

@@ -42,23 +42,24 @@ Find the k pairs (u1,v1),(u2,v2) ...(uk,vk) with the smallest sums.
  */
 public class _373 {
 
-    final int[][] neighbors = new int[][]{{0,1}, {1,0}};
+    final int[][] neighbors = new int[][]{{0, 1}, {1, 0}};
 
     public List<int[]> kSmallestPairs(int[] nums1, int[] nums2, int k) {
         List<int[]> result = new ArrayList<int[]>();
-        if(nums1 == null || nums2 == null || k == 0 || nums1.length == 0 || nums2.length == 0) return result;
+        if (nums1 == null || nums2 == null || k == 0 || nums1.length == 0 || nums2.length == 0) return result;
         Queue<Node> meanHeap = new PriorityQueue<Node>();
         meanHeap.offer(new Node(0, 0, nums1[0] + nums2[0]));
         boolean[][] visited = new boolean[nums1.length][nums2.length];
         visited[0][0] = true;//we start form (0,0), so mark it as visited
-        while(k > 0 && !meanHeap.isEmpty()){
+        while (k > 0 && !meanHeap.isEmpty()) {
             Node node = meanHeap.poll();
             result.add(new int[]{nums1[node.row], nums2[node.col]});
             k--;
-            for(int[] neighbor : neighbors){
+            for (int[] neighbor : neighbors) {
                 int nextRow = node.row + neighbor[0];
                 int nextCol = node.col + neighbor[1];
-                if(nextRow < 0 || nextCol < 0 || nextRow >= nums1.length || nextCol >= nums2.length || visited[nextRow][nextCol]) continue;
+                if (nextRow < 0 || nextCol < 0 || nextRow >= nums1.length || nextCol >= nums2.length || visited[nextRow][nextCol])
+                    continue;
                 visited[nextRow][nextCol] = true;
                 meanHeap.offer(new Node(nextRow, nextCol, nums1[nextRow] + nums2[nextCol]));
             }
@@ -68,12 +69,12 @@ public List kSmallestPairs(int[] nums1, int[] nums2, int k) {
         return result;
     }
 
-    private class Node implements Comparable<Node>{
+    private class Node implements Comparable<Node> {
         int row;
         int col;
         int sum;
 
-        public Node(int row, int col, int sum){
+        public Node(int row, int col, int sum) {
             this.row = row;
             this.col = col;
             this.sum = sum;

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

@@ -58,8 +58,8 @@ 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()) {
@@ -79,13 +79,13 @@ public String findShortestWay(int[][] maze, int[] ball, int[] hole) {
                     y -= directions[i + 1];
                     distance--;
                 }
-                heap.offer(new Point(x, y, distance, curr.path+ds[i]));
+                heap.offer(new Point(x, y, distance, curr.path + ds[i]));
             }
         }
         return points[hole[0]][hole[1]].distance == Integer.MAX_VALUE ? "impossible" : points[hole[0]][hole[1]].path;
     }
 
-    class Point implements Comparable<Point>{
+    class Point implements Comparable<Point> {
         int x;
         int y;
         int distance;

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

@@ -46,7 +46,7 @@ public int shoppingOffers(List price, List> special, List
         return shopping(price, special, needs, 0);
     }
 
-    public int shopping(List < Integer > price, List < List < Integer >> special, List < Integer > needs, int i) {
+    public int shopping(List<Integer> price, List<List<Integer>> special, List<Integer> needs, int i) {
         if (i == special.size()) {
             return dot(needs, price);
         }