refactor 442

fishercoder1534 · fishercoder1534 · commit a87db316c2d9 · 2020-07-11T08:45:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_442.java b/src/main/java/com/fishercoder/solutions/_442.java
@@ -5,22 +5,6 @@
 import java.util.List;
 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.
-
- Could you do it without extra space and in O(n) runtime?
-
- Example:
- Input:
- [4,3,2,7,8,2,3,1]
-
- Output:
- [2,3]
- */
 public class _442 {
 
     public static class Solution1 {
