refactor 442

fishercoder1534 · fishercoder1534 · commit 661fe56fcde2 · 2019-04-04T07:54:15.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_442.java b/src/main/java/com/fishercoder/solutions/_442.java
@@ -6,6 +6,8 @@
 import java.util.Set;
 
 /**
+ * 442. Find All Duplicates in an Array
+ *
  * Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
 
  Find all the elements that appear twice in this array.
@@ -21,31 +23,35 @@ Could you do it without extra space and in O(n) runtime?
  */
 public class _442 {
 
-    //O(n) space
-    //O(n) time
-    public List<Integer> findDuplicates_solution1(int[] nums) {
-        Set<Integer> set = new HashSet();
-        List<Integer> result = new ArrayList();
-        for (int i : nums) {
-            if (!set.add(i)) {
-                result.add(i);
+    public static class Solution1 {
+        //O(n) space
+        //O(n) time
+        public List<Integer> findDuplicates(int[] nums) {
+            Set<Integer> set = new HashSet();
+            List<Integer> result = new ArrayList();
+            for (int i : nums) {
+                if (!set.add(i)) {
+                    result.add(i);
+                }
             }
+            return result;
         }
-        return result;
     }
 
-    //O(1) space
-    //O(n) time
-    public List<Integer> findDuplicates_solution2(int[] nums) {
-        List<Integer> result = new ArrayList();
-        for (int i = 0; i < nums.length; i++) {
-            int index = Math.abs(nums[i]) - 1;
-            if (nums[index] < 0) {
-                result.add(Math.abs(index + 1));
+    public static class Solution2 {
+        //O(1) space
+        //O(n) time
+        public List<Integer> findDuplicates(int[] nums) {
+            List<Integer> result = new ArrayList();
+            for (int i = 0; i < nums.length; i++) {
+                int index = Math.abs(nums[i]) - 1;
+                if (nums[index] < 0) {
+                    result.add(Math.abs(index + 1));
+                }
+                nums[index] = -nums[index];
             }
-            nums[index] = -nums[index];
+            return result;
         }
-        return result;
     }
 
 }
