[N-0] refactor 659

Author: fishercoder1534

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

@@ -1,6 +1,5 @@
 package com.fishercoder.solutions;
 
-
 import java.util.HashMap;
 import java.util.Map;
 
@@ -37,31 +36,32 @@
 
 public class _659 {
 
-    /**
-     * reference: https://discuss.leetcode.com/topic/99187/java-o-n-time-o-n-space
-     */
-    public boolean isPossible(int[] nums) {
-        Map<Integer, Integer> freqMap = new HashMap<>();
-        for (int i : nums) {
-            freqMap.put(i, freqMap.getOrDefault(i, 0) + 1);
-        }
-        Map<Integer, Integer> appendFreqMap = new HashMap<>();
-        for (int i : nums) {
-            if (freqMap.get(i) == 0) {
-                continue;
-            } else if (appendFreqMap.getOrDefault(i, 0) > 0) {
-                appendFreqMap.put(i, appendFreqMap.get(i) - 1);
-                appendFreqMap.put(i + 1, appendFreqMap.getOrDefault(i + 1, 0) + 1);
-            } else if (freqMap.getOrDefault(i + 1, 0) > 0 && freqMap.getOrDefault(i + 2, 0) > 0) {
-                freqMap.put(i + 1, freqMap.get(i + 1) - 1);
-                freqMap.put(i + 2, freqMap.get(i + 2) - 1);
-                appendFreqMap.put(i + 3, appendFreqMap.getOrDefault(i + 3, 0) + 1);
-            } else {
-                return false;
+    public static class Solution1 {
+        /**
+         * reference: https://discuss.leetcode.com/topic/99187/java-o-n-time-o-n-space
+         */
+        public boolean isPossible(int[] nums) {
+            Map<Integer, Integer> freqMap = new HashMap<>();
+            for (int i : nums) {
+                freqMap.put(i, freqMap.getOrDefault(i, 0) + 1);
             }
-            freqMap.put(i, freqMap.get(i) - 1);
+            Map<Integer, Integer> appendFreqMap = new HashMap<>();
+            for (int i : nums) {
+                if (freqMap.get(i) == 0) {
+                    continue;
+                } else if (appendFreqMap.getOrDefault(i, 0) > 0) {
+                    appendFreqMap.put(i, appendFreqMap.get(i) - 1);
+                    appendFreqMap.put(i + 1, appendFreqMap.getOrDefault(i + 1, 0) + 1);
+                } else if (freqMap.getOrDefault(i + 1, 0) > 0 && freqMap.getOrDefault(i + 2, 0) > 0) {
+                    freqMap.put(i + 1, freqMap.get(i + 1) - 1);
+                    freqMap.put(i + 2, freqMap.get(i + 2) - 1);
+                    appendFreqMap.put(i + 3, appendFreqMap.getOrDefault(i + 3, 0) + 1);
+                } else {
+                    return false;
+                }
+                freqMap.put(i, freqMap.get(i) - 1);
+            }
+            return true;
         }
-        return true;
     }
-
 }

src/test/java/com/fishercoder/_659Test.java

@@ -7,30 +7,30 @@
 import static org.junit.Assert.assertEquals;
 
 public class _659Test {
-    private static _659 test;
+    private static _659.Solution1 solution1;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
-        test = new _659();
+        solution1 = new _659.Solution1();
     }
 
     @Test
     public void test1() {
-        nums = new int[]{1,2,3,3,4,5};
-        assertEquals(true, test.isPossible(nums));
+        nums = new int[]{1, 2, 3, 3, 4, 5};
+        assertEquals(true, solution1.isPossible(nums));
     }
 
     @Test
     public void test2() {
-        nums = new int[]{1,2,3,3,4,4,5,5};
-        assertEquals(true, test.isPossible(nums));
+        nums = new int[]{1, 2, 3, 3, 4, 4, 5, 5};
+        assertEquals(true, solution1.isPossible(nums));
     }
 
     @Test
     public void test3() {
-        nums = new int[]{1,2,3,4,4,5};
-        assertEquals(false, test.isPossible(nums));
+        nums = new int[]{1, 2, 3, 4, 4, 5};
+        assertEquals(false, solution1.isPossible(nums));
     }
 
     @Test
@@ -127,7 +127,7 @@ public void test4() {
                 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98,
                 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99,
                 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100};
-        assertEquals(true, test.isPossible(nums));
+        assertEquals(true, solution1.isPossible(nums));
     }
 
 }