feat: add solutions to lc problem: No.0448.Find All Members Disappeared

in an Array

Author: yanglbme

solution/0400-0499/0448.Find All Numbers Disappeared in an Array/README.md

@@ -28,7 +28,7 @@
 <!-- 这里可写通用的实现逻辑 -->
 
 - 遍历输入数组的每个元素一次。
-- 把 `|nums[i]|-1` 索引位置的元素标记为负数。即 `nums[|nums[i]|-1]` \* -1。
+- 把 `abs(nums[i]) - 1` 索引位置的元素标记为负数。即 `nums[abs(nums[i]) - 1] *= -1`。
 - 然后遍历数组，若当前数组元素 `nums[i]` 为负数，说明我们在数组中存在数字 `i+1`。否则，说明数组不存在数字 `i+1`，添加到结果列表中。
 
 <!-- tabs:start -->
@@ -41,14 +41,10 @@
 class Solution:
     def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
         for num in nums:
-            index = abs(num) - 1
-            if nums[index] > 0:
-                nums[index] *= -1
-        res = []
-        for i, v in enumerate(nums):
-            if v > 0:
-                res.append(i + 1)
-        return res
+            idx = abs(num) - 1
+            if nums[idx] > 0:
+                nums[idx] *= -1
+        return [i + 1 for i, v in enumerate(nums) if v > 0]
 ```
 
 ### **Java**
@@ -60,9 +56,9 @@ class Solution {
     public List<Integer> findDisappearedNumbers(int[] nums) {
         int n = nums.length;
         for (int i = 0; i < n; ++i) {
-            int index = Math.abs(nums[i]) - 1;
-            if (nums[index] > 0) {
-                nums[index] *= -1;
+            int idx = Math.abs(nums[i]) - 1;
+            if (nums[idx] > 0) {
+                nums[idx] *= -1;
             }
         }
         List<Integer> res = new ArrayList<>();
@@ -76,6 +72,57 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> findDisappearedNumbers(vector<int> &nums) {
+        int n = nums.size();
+        for (int i = 0; i < n; ++i)
+        {
+            int idx = abs(nums[i]) - 1;
+            if (nums[idx] > 0)
+                nums[idx] *= -1;
+        }
+        vector<int> res;
+        for (int i = 0; i < n; ++i)
+        {
+            if (nums[i] > 0)
+                res.push_back(i + 1);
+        }
+        return res;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findDisappearedNumbers(nums []int) []int {
+	for _, num := range nums {
+		idx := abs(num) - 1
+		if nums[idx] > 0 {
+			nums[idx] *= -1
+		}
+	}
+	var res []int
+	for i, num := range nums {
+		if num > 0 {
+			res = append(res, i+1)
+		}
+	}
+	return res
+}
+
+func abs(a int) int {
+	if a > 0 {
+		return a
+	}
+	return -a
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0448.Find All Numbers Disappeared in an Array/README_EN.md

@@ -37,14 +37,10 @@
 class Solution:
     def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
         for num in nums:
-            index = abs(num) - 1
-            if nums[index] > 0:
-                nums[index] *= -1
-        res = []
-        for i, v in enumerate(nums):
-            if v > 0:
-                res.append(i + 1)
-        return res
+            idx = abs(num) - 1
+            if nums[idx] > 0:
+                nums[idx] *= -1
+        return [i + 1 for i, v in enumerate(nums) if v > 0]
 ```
 
 ### **Java**
@@ -54,9 +50,9 @@ class Solution {
     public List<Integer> findDisappearedNumbers(int[] nums) {
         int n = nums.length;
         for (int i = 0; i < n; ++i) {
-            int index = Math.abs(nums[i]) - 1;
-            if (nums[index] > 0) {
-                nums[index] *= -1;
+            int idx = Math.abs(nums[i]) - 1;
+            if (nums[idx] > 0) {
+                nums[idx] *= -1;
             }
         }
         List<Integer> res = new ArrayList<>();
@@ -70,6 +66,57 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> findDisappearedNumbers(vector<int> &nums) {
+        int n = nums.size();
+        for (int i = 0; i < n; ++i)
+        {
+            int idx = abs(nums[i]) - 1;
+            if (nums[idx] > 0)
+                nums[idx] *= -1;
+        }
+        vector<int> res;
+        for (int i = 0; i < n; ++i)
+        {
+            if (nums[i] > 0)
+                res.push_back(i + 1);
+        }
+        return res;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findDisappearedNumbers(nums []int) []int {
+	for _, num := range nums {
+		idx := abs(num) - 1
+		if nums[idx] > 0 {
+			nums[idx] *= -1
+		}
+	}
+	var res []int
+	for i, num := range nums {
+		if num > 0 {
+			res = append(res, i+1)
+		}
+	}
+	return res
+}
+
+func abs(a int) int {
+	if a > 0 {
+		return a
+	}
+	return -a
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0448.Find All Numbers Disappeared in an Array/Solution.cpp

@@ -1,24 +1,19 @@
 class Solution {
 public:
-    vector<int> findDisappearedNumbers(vector<int>& nums) {
-        int len = nums.size();
-        vector<int> ans;
-        if(len == 0)return ans;
-        
-        int index;
-        for(int i = 0;i<len;++i){
-            index = abs(nums[i]) - 1;
-            
-            if(nums[index] > 0)
-                nums[index] = -nums[index];   
+    vector<int> findDisappearedNumbers(vector<int> &nums) {
+        int n = nums.size();
+        for (int i = 0; i < n; ++i)
+        {
+            int idx = abs(nums[i]) - 1;
+            if (nums[idx] > 0)
+                nums[idx] *= -1;
         }
-
-        
-        for(int i = 0;i<len;++i){
-            if(nums[i] > 0)
-                ans.push_back(i+1);
+        vector<int> res;
+        for (int i = 0; i < n; ++i)
+        {
+            if (nums[i] > 0)
+                res.push_back(i + 1);
         }
-        
-        return ans;
+        return res;
     }
 };

solution/0400-0499/0448.Find All Numbers Disappeared in an Array/Solution.go

@@ -0,0 +1,22 @@
+func findDisappearedNumbers(nums []int) []int {
+	for _, num := range nums {
+		idx := abs(num) - 1
+		if nums[idx] > 0 {
+			nums[idx] *= -1
+		}
+	}
+	var res []int
+	for i, num := range nums {
+		if num > 0 {
+			res = append(res, i+1)
+		}
+	}
+	return res
+}
+
+func abs(a int) int {
+	if a > 0 {
+		return a
+	}
+	return -a
+}

solution/0400-0499/0448.Find All Numbers Disappeared in an Array/Solution.java

@@ -2,9 +2,9 @@ class Solution {
     public List<Integer> findDisappearedNumbers(int[] nums) {
         int n = nums.length;
         for (int i = 0; i < n; ++i) {
-            int index = Math.abs(nums[i]) - 1;
-            if (nums[index] > 0) {
-                nums[index] *= -1;
+            int idx = Math.abs(nums[i]) - 1;
+            if (nums[idx] > 0) {
+                nums[idx] *= -1;
             }
         }
         List<Integer> res = new ArrayList<>();

solution/0400-0499/0448.Find All Numbers Disappeared in an Array/Solution.py

@@ -1,11 +1,7 @@
 class Solution:
     def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
         for num in nums:
-            index = abs(num) - 1
-            if nums[index] > 0:
-                nums[index] *= -1
-        res = []
-        for i, v in enumerate(nums):
-            if v > 0:
-                res.append(i + 1)
-        return res
+            idx = abs(num) - 1
+            if nums[idx] > 0:
+                nums[idx] *= -1
+        return [i + 1 for i, v in enumerate(nums) if v > 0]