edit 448

fishercoder1534 · fishercoder1534 · commit 7008d487f438 · 2017-07-24T15:10:40.000-07:00
diff --git a/README.md b/README.md
@@ -161,7 +161,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |451|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SortCharactersByFrequency.java) | O(nlogn) |O(n) | Medium| HashMap
 |450|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_450.java)| O(?)|O(?) | Medium| Tree, Recursion
 |449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SerializeandDeserializeBST.java)| O(n)|O(h) | Medium| BFS
-|448|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FindAllNumbersDisappearedinanArray.java)| O(n)|O(1) | Easy| Array, HashMap
+|448|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_448.java)| O(n)|O(1) | Easy| Array, HashMap
 |447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NumberofBoomerangs.java)| O(n^2)|O(n) | Easy| HashMap
 |445|[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_445.java)| O(max(m,n)|O(max(m,n)) | Medium| Stack, LinkedList
 |444|[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_444.java)| O(n)|O(n) | Medium| Topological Sort, Graph
diff --git a/src/main/java/com/fishercoder/solutions/_448.java b/src/main/java/com/fishercoder/solutions/_448.java
@@ -20,7 +20,7 @@ Could you do it without extra space and in O(n) runtime? You may assume the retu
  Output:
  [5,6]
  */
-public class FindAllNumbersDisappearedinanArray {
+public class _448 {
 
     /**O(n) space
      * O(n) time*/
@@ -75,7 +75,7 @@ public List<Integer> findDisappearedNumbers_2(int[] nums) {
     }
 
     public static void main(String...args){
-        FindAllNumbersDisappearedinanArray test = new FindAllNumbersDisappearedinanArray();
+        _448 test = new _448();
 //        int[] nums = new int[]{4,3,2,7,8,2,3,1};
         int[] nums = new int[]{1,1};
         List<Integer> result = test.findDisappearedNumbers_2(nums);
