refactor for format

Author: fishercoder1534

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

@@ -23,28 +23,28 @@ public class _350 {
 
     public int[] intersect(int[] nums1, int[] nums2) {
         Map<Integer, Integer> map1 = new HashMap();
-        for(int i : nums1){
-            if(map1.containsKey(i)){
-                map1.put(i, map1.get(i)+1);
+        for (int i : nums1) {
+            if (map1.containsKey(i)) {
+                map1.put(i, map1.get(i) + 1);
             } else {
                 map1.put(i, 1);
             }
         }
-        
+
         List<Integer> list = new ArrayList();
-        for(int i : nums2){
-            if(map1.containsKey(i) && map1.get(i) > 0){
+        for (int i : nums2) {
+            if (map1.containsKey(i) && map1.get(i) > 0) {
                 list.add(i);
-                map1.put(i, map1.get(i)-1);
+                map1.put(i, map1.get(i) - 1);
             }
         }
-        
+
         int[] result = new int[list.size()];
         int i = 0;
-        for(int num : list){
+        for (int num : list) {
             result[i++] = num;
         }
-        
+
         return result;
     }
 

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

@@ -41,25 +41,25 @@ public int numberOfPatterns(int m, int n) {
         jumps[4][6] = jumps[6][4] = 5;
         jumps[7][9] = jumps[9][7] = 8;
         jumps[1][7] = jumps[7][1] = 4;
-        jumps[2][8] = jumps[8][2] = jumps[1][9] = jumps[9][1]= 5;
+        jumps[2][8] = jumps[8][2] = jumps[1][9] = jumps[9][1] = 5;
         jumps[9][3] = jumps[3][9] = 6;
         jumps[3][7] = jumps[7][3] = 5;
         visited = new boolean[10];
         int count = 0;
-        count += dfs(1, 1, 0, m, n)*4;//1,3,7,9 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
-        count += dfs(2, 1, 0, m, n)*4;//2,4,6,8 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
+        count += dfs(1, 1, 0, m, n) * 4;//1,3,7,9 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
+        count += dfs(2, 1, 0, m, n) * 4;//2,4,6,8 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
         count += dfs(5, 1, 0, m, n);
         return count;
     }
 
-    private int dfs(int num, int len, int count, int m, int n){
-        if(len >= m) count++;
+    private int dfs(int num, int len, int count, int m, int n) {
+        if (len >= m) count++;
         len++;
-        if(len > n) return count;
+        if (len > n) return count;
         visited[num] = true;
-        for(int next = 1; next <= 9; next++){
+        for (int next = 1; next <= 9; next++) {
             int jump = jumps[num][next];
-            if(!visited[next] && (jump == 0 || visited[jump])){
+            if (!visited[next] && (jump == 0 || visited[jump])) {
                 count = dfs(next, len, count, m, n);
             }
         }

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

@@ -27,24 +27,28 @@ public class _352 {
 
     public static class SummaryRanges {
 
-        /**Use treemap, key is the start of the interval.*/
+        /**
+         * Use treemap, key is the start of the interval.
+         */
         TreeMap<Integer, Interval> treeMap;
 
-        /** Initialize your data structure here. */
+        /**
+         * Initialize your data structure here.
+         */
         public SummaryRanges() {
             treeMap = new TreeMap<>();
         }
 
         public void addNum(int val) {
-            if(treeMap.containsKey(val)) return;
+            if (treeMap.containsKey(val)) return;
             Integer lower = treeMap.lowerKey(val);
             Integer higher = treeMap.higherKey(val);
-            if(lower != null && higher != null && treeMap.get(lower).end + 1 == val && higher == val + 1) {
+            if (lower != null && higher != null && treeMap.get(lower).end + 1 == val && higher == val + 1) {
                 treeMap.get(lower).end = treeMap.get(higher).end;
                 treeMap.remove(higher);
-            } else if(lower != null && treeMap.get(lower).end + 1 >= val) {
+            } else if (lower != null && treeMap.get(lower).end + 1 >= val) {
                 treeMap.get(lower).end = Math.max(treeMap.get(lower).end, val);
-            } else if(higher != null && higher == val + 1) {
+            } else if (higher != null && higher == val + 1) {
                 treeMap.put(val, new Interval(val, treeMap.get(higher).end));
                 treeMap.remove(higher);
             } else {

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

@@ -7,51 +7,51 @@
 
 /**
  * Design a Snake game that is played on a device with screen size = width x height. Play the game online if you are not familiar with the game.
-
- The snake is initially positioned at the top left corner (0,0) with length = 1 unit.
-
- You are given a list of food's positions in row-column order. When a snake eats the food, its length and the game's score both increase by 1.
-
- Each food appears one by one on the screen. For example, the second food will not appear until the first food was eaten by the snake.
-
- When a food does appear on the screen, it is guaranteed that it will not appear on a block occupied by the snake.
-
- Example:
- Given width = 3, height = 2, and food = [[1,2],[0,1]].
-
- Snake snake = new Snake(width, height, food);
-
- Initially the snake appears at position (0,0) and the food at (1,2).
-
- |S| | |
- | | |F|
-
- snake.move("R"); -> Returns 0
-
- | |S| |
- | | |F|
-
- snake.move("D"); -> Returns 0
-
- | | | |
- | |S|F|
-
- snake.move("R"); -> Returns 1 (Snake eats the first food and right after that, the second food appears at (0,1) )
-
- | |F| |
- | |S|S|
-
- snake.move("U"); -> Returns 1
-
- | |F|S|
- | | |S|
-
- snake.move("L"); -> Returns 2 (Snake eats the second food)
-
- | |S|S|
- | | |S|
-
- snake.move("U"); -> Returns -1 (Game over because snake collides with border)
+ * <p>
+ * The snake is initially positioned at the top left corner (0,0) with length = 1 unit.
+ * <p>
+ * You are given a list of food's positions in row-column order. When a snake eats the food, its length and the game's score both increase by 1.
+ * <p>
+ * Each food appears one by one on the screen. For example, the second food will not appear until the first food was eaten by the snake.
+ * <p>
+ * When a food does appear on the screen, it is guaranteed that it will not appear on a block occupied by the snake.
+ * <p>
+ * Example:
+ * Given width = 3, height = 2, and food = [[1,2],[0,1]].
+ * <p>
+ * Snake snake = new Snake(width, height, food);
+ * <p>
+ * Initially the snake appears at position (0,0) and the food at (1,2).
+ * <p>
+ * |S| | |
+ * | | |F|
+ * <p>
+ * snake.move("R"); -> Returns 0
+ * <p>
+ * | |S| |
+ * | | |F|
+ * <p>
+ * snake.move("D"); -> Returns 0
+ * <p>
+ * | | | |
+ * | |S|F|
+ * <p>
+ * snake.move("R"); -> Returns 1 (Snake eats the first food and right after that, the second food appears at (0,1) )
+ * <p>
+ * | |F| |
+ * | |S|S|
+ * <p>
+ * snake.move("U"); -> Returns 1
+ * <p>
+ * | |F|S|
+ * | | |S|
+ * <p>
+ * snake.move("L"); -> Returns 2 (Snake eats the second food)
+ * <p>
+ * | |S|S|
+ * | | |S|
+ * <p>
+ * snake.move("U"); -> Returns -1 (Game over because snake collides with border)
  */
 public class _353 {
     public class SnakeGame {
@@ -63,11 +63,14 @@ public class SnakeGame {
         int width;
         int height;
 
-        /** Initialize your data structure here.
-         @param width - screen width
-         @param height - screen height
-         @param food - A list of food positions
-         E.g food = [[1,1], [1,0]] means the first food is positioned at [1,1], the second is at [1,0]. */
+        /**
+         * Initialize your data structure here.
+         *
+         * @param width  - screen width
+         * @param height - screen height
+         * @param food   - A list of food positions
+         *               E.g food = [[1,1], [1,0]] means the first food is positioned at [1,1], the second is at [1,0].
+         */
         public SnakeGame(int width, int height, int[][] food) {
             this.set = new HashSet();
             set.add(0);//initially at [0][0]
@@ -78,17 +81,20 @@ public SnakeGame(int width, int height, int[][] food) {
             this.height = height;
         }
 
-        /** Moves the snake.
-         @param direction - 'U' = Up, 'L' = Left, 'R' = Right, 'D' = Down
-         @return The game's score after the move. Return -1 if game over.
-         Game over when snake crosses the screen boundary or bites its body. */
+        /**
+         * Moves the snake.
+         *
+         * @param direction - 'U' = Up, 'L' = Left, 'R' = Right, 'D' = Down
+         * @return The game's score after the move. Return -1 if game over.
+         * Game over when snake crosses the screen boundary or bites its body.
+         */
         public int move(String direction) {
-            if(score == -1) return -1;
+            if (score == -1) return -1;
 
             //compute head
             int rowHead = body.peekFirst() / width;
             int colHead = body.peekFirst() % width;
-            switch(direction){
+            switch (direction) {
                 case "U":
                     rowHead--;
                     break;
@@ -101,11 +107,11 @@ public int move(String direction) {
                 default:
                     colHead++;
             }
-            int newHead = rowHead*width+colHead;
+            int newHead = rowHead * width + colHead;
 
             set.remove(body.peekLast());//we'll remove the tail from set for now to see if it hits its tail
             //if it hits the boundary
-            if(set.contains(newHead) || rowHead < 0 || colHead < 0 || rowHead >= height || colHead >= width){
+            if (set.contains(newHead) || rowHead < 0 || colHead < 0 || rowHead >= height || colHead >= width) {
                 return score = -1;
             }
 
@@ -114,7 +120,7 @@ public int move(String direction) {
             body.offerFirst(newHead);
 
             //normal eat case: keep tail, add head
-            if(foodIndex < food.length && rowHead == food[foodIndex][0] && colHead == food[foodIndex][1]){
+            if (foodIndex < food.length && rowHead == food[foodIndex][0] && colHead == food[foodIndex][1]) {
                 set.add(body.peekLast());//old tail does not change, so add it back to set since we removed it earlier
                 foodIndex++;
                 return ++score;

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

@@ -27,13 +27,13 @@ public int maxEnvelopes(int[][] envelopes) {
                     if (a[0] == b[0]) return b[1] - a[1];
                     else return a[0] - b[0];
                 }
-                );
+        );
         int[] dp = new int[envelopes.length];
         int len = 0;
         for (int[] envelope : envelopes) {
             int index = Arrays.binarySearch(dp, 0, len, envelope[1]);
             if (index < 0) {
-                index = -(index+1);
+                index = -(index + 1);
             }
             dp[index] = envelope[1];
             if (index == len) {

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

@@ -33,7 +33,7 @@ public boolean isReflected(int[][] points) {
             String str = point[0] + "a" + point[1];
             set.add(str);
         }
-        int sum = max+min;
+        int sum = max + min;
         for (int[] p : points) {
             String str = (sum - p[0]) + "a" + p[1];
             if (!set.contains(str)) return false;

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

@@ -45,7 +45,7 @@ public String rearrangeString(String s, int k) {
         while (!heap.isEmpty()) {
             Map.Entry<Character, Integer> entry = heap.poll();
             stringBuilder.append(entry.getKey());
-            entry.setValue(entry.getValue()-1);
+            entry.setValue(entry.getValue() - 1);
             waitQueue.offer(entry);
             if (waitQueue.size() < k) continue; //there's only k-1 chars in the waitHeap, not full yet
             Map.Entry<Character, Integer> front = waitQueue.poll();

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

@@ -27,20 +27,20 @@ public class _360 {
 
 //credit: https://discuss.leetcode.com/topic/48424/java-o-n-incredibly-short-yet-easy-to-understand-ac-solution
     //in sum, only two cases: when a >= 0 or when a < 0, this simplifies logic
-    public int[] sortTransformedArray(int[] nums, int a, int b, int c) {
-        int n = nums.length;
-        int[] sorted = new int[n];
-        int i = 0, j = n - 1;
-        int index = a >= 0 ? n - 1 : 0;
-        while (i <= j) {
-            if (a >= 0) {
-                sorted[index--] = function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(nums[i++], a, b, c) : function(nums[j--], a, b, c);
-            } else {
-                sorted[index++] = function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(nums[j--], a, b, c) : function(nums[i++], a, b, c);
-            }
+public int[] sortTransformedArray(int[] nums, int a, int b, int c) {
+    int n = nums.length;
+    int[] sorted = new int[n];
+    int i = 0, j = n - 1;
+    int index = a >= 0 ? n - 1 : 0;
+    while (i <= j) {
+        if (a >= 0) {
+            sorted[index--] = function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(nums[i++], a, b, c) : function(nums[j--], a, b, c);
+        } else {
+            sorted[index++] = function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(nums[j--], a, b, c) : function(nums[i++], a, b, c);
         }
-        return sorted;
     }
+    return sorted;
+}
 
     public int[] sortTransformedArray_naive(int[] nums, int a, int b, int c) {
         int[] result = new int[nums.length];
@@ -52,7 +52,7 @@ public int[] sortTransformedArray_naive(int[] nums, int a, int b, int c) {
     }
 
     private int function(int num, int a, int b, int c) {
-        return a*(num*num) + b*num + c;
+        return a * (num * num) + b * num + c;
     }
 
 }