solve problem Find All Numbers Disappeared In An Array

Author: P-ppc

README.md

@@ -107,6 +107,7 @@ All solutions will be accepted!
 |733|[Flood Fill](https://leetcode-cn.com/problems/flood-fill/description/)|[java/py/js](./algorithms/FloodFill)|Easy|
 |110|[Balanced Binary Tree](https://leetcode-cn.com/problems/balanced-binary-tree/description/)|[java/py/js](./algorithms/BalancedBinaryTree)|Easy|
 |70|[Climbing Stairs](https://leetcode-cn.com/problems/climbing-stairs/description/)|[java/py/js](./algorithms/ClimbingStairs)|Easy|
+|448|[Find All Numbers Disappeared In An Array](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/description/)|[java/py/js](./algorithms/FindAllNumbersDisappearedInAnArray)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/FindAllNumbersDisappearedInAnArray/README.md

@@ -0,0 +1,2 @@
+# Find All Numbers Disappeared In An Array
+This problem is easy to solve

algorithms/FindAllNumbersDisappearedInAnArray/Solution.java

@@ -0,0 +1,21 @@
+class Solution {
+    public List<Integer> findDisappearedNumbers(int[] nums) {
+        List<Integer> res = new ArrayList<Integer>();
+        for (int i = 0; i <= nums.length; i++) {
+            res.add(i);
+        }
+        
+        for (int num : nums) {
+            res.set(num, 0);
+        }
+        
+        Iterator iterator = res.iterator();
+        while (iterator.hasNext()) {
+            if ((int) iterator.next() == 0) {
+                iterator.remove();
+            }
+        }
+        
+        return res;
+    }
+}

algorithms/FindAllNumbersDisappearedInAnArray/solution.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var findDisappearedNumbers = function(nums) {
+    let res = []
+    for (let i = 0; i <= nums.length; i++) {
+        res.push(i)
+    }
+    
+    nums.forEach(num => res[num] = 0)
+    
+    let effectiveLength = 0,
+        pos = 0
+    
+    for (let i = 0; i < res.length; i++) {
+        if (res[i] !== 0) {
+            res[pos] = res[i]
+            pos++
+            effectiveLength++
+        }
+    }
+    res.length = effectiveLength
+    return res
+};

algorithms/FindAllNumbersDisappearedInAnArray/solution.py

@@ -0,0 +1,23 @@
+class Solution(object):
+    def findDisappearedNumbers(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[int]
+        """
+        res = []
+        for i in range(len(nums) + 1):
+            res.append(i)
+            
+        for num in nums:
+            res[num] = 0
+        
+        # remove 0 to the end
+        effective_length = 0
+        pos = 0
+        for i in range(len(res)):
+            if res[i] != 0:
+                res[pos] = res[i]
+                pos += 1
+                effective_length += 1
+        
+        return res[:effective_length]