refactor 448

fishercoder1534 · fishercoder1534 · commit cfc7f8320845 · 2020-07-11T08:49:16.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_448.java b/src/main/java/com/fishercoder/solutions/_448.java
@@ -5,22 +5,6 @@
 import java.util.List;
 import java.util.Map;
 
-/**
- * 448. Find All Numbers Disappeared in an Array
- *
- * Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
- * Find all the elements of [1, n] inclusive that do not appear in this array.
- * Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
-
- Example:
-
- Input:
- [4,3,2,7,8,2,3,1]
-
- Output:
- [5,6]
-
- */
 public class _448 {
 
     public static class Solution1 {
