refactor 228

fishercoder1534 · fishercoder1534 · commit 8284c4640551 · 2018-10-06T08:05:09.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_228.java b/src/main/java/com/fishercoder/solutions/_228.java
@@ -4,34 +4,30 @@
 import java.util.List;
 
 /**
+ * 228. Summary Ranges
+ *
  * Given a sorted integer array without duplicates, return the summary of its ranges.
-
- For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].
+ *
+ * For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].
  */
 public class _228 {
 
-    public static List<String> summaryRanges(int[] nums) {
-        List<String> result = new ArrayList<>();
-        for (int i = 0; i < nums.length; i++) {
-            String start = String.valueOf(nums[i]);
-            int tmpI = i;
-            while ((i + 1) < nums.length && (nums[i] + 1) == nums[i + 1]) {
-                i++;
-            }
-            if (tmpI == i) {
-                result.add(start);
-            } else {
-                result.add(start + "->" + String.valueOf(nums[i]));
+    public static class Solution1 {
+        public List<String> summaryRanges(int[] nums) {
+            List<String> result = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                String start = String.valueOf(nums[i]);
+                int tmpI = i;
+                while ((i + 1) < nums.length && (nums[i] + 1) == nums[i + 1]) {
+                    i++;
+                }
+                if (tmpI == i) {
+                    result.add(start);
+                } else {
+                    result.add(start + "->" + String.valueOf(nums[i]));
+                }
             }
-        }
-        return result;
-    }
-
-    public static void main(String... args) {
-        int[] nums = new int[]{0, 1, 2, 4, 5, 7};
-        List<String> result = summaryRanges(nums);
-        for (String s : result) {
-            System.out.println(s);
+            return result;
         }
     }
 
diff --git a/src/test/java/com/fishercoder/_228Test.java b/src/test/java/com/fishercoder/_228Test.java
@@ -0,0 +1,28 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._228;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+import java.util.List;
+
+import static junit.framework.Assert.assertEquals;
+
+public class _228Test {
+    private static _228.Solution1 solution1;
+    private static List<String> expected;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _228.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{0, 1, 2, 4, 5, 7};
+        expected = Arrays.asList("0->2", "4->5", "7");
+        assertEquals(expected, solution1.summaryRanges(nums));
+    }
+}
