refactor 217

fishercoder1534 · fishercoder1534 · commit 09b30ab57e8a · 2018-09-25T08:01:39.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_217.java b/src/main/java/com/fishercoder/solutions/_217.java
@@ -5,27 +5,25 @@
 
 /**
  * 217. Contains Duplicate
+ *
  * Given an array of integers, find if the array contains any
  * duplicates. Your function should return true if any value appears at least twice in the array,
  * and it should return false if every element is distinct.
  */
 public class _217 {
-    public boolean containsDuplicate(int[] nums) {
-        if (nums == null || nums.length == 0) {
-            return false;
-        }
-        Set<Integer> set = new HashSet();
-        for (int i : nums) {
-            if (!set.add(i)) {
-                return true;
+    public static class Solution1 {
+        public boolean containsDuplicate(int[] nums) {
+            if (nums == null || nums.length == 0) {
+                return false;
+            }
+            Set<Integer> set = new HashSet();
+            for (int i : nums) {
+                if (!set.add(i)) {
+                    return true;
+                }
             }
+            return false;
         }
-        return false;
     }
 
-    public static void main(String... strings) {
-        int[] nums = new int[]{1, 2, 3, 4, 3};
-        _217 test = new _217();
-        System.out.println(test.containsDuplicate(nums));
-    }
 }
diff --git a/src/test/java/com/fishercoder/_217Test.java b/src/test/java/com/fishercoder/_217Test.java
@@ -0,0 +1,23 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._217;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _217Test {
+    private static _217.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _217.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 2, 3, 4, 3};
+        assertEquals(true, solution1.containsDuplicate(nums));
+    }
+}
