Add files via upload

Author: assassint2017

Find All Duplicates in an Array/Find_All_Duplicates_in_an_Array.cpp

@@ -0,0 +1,29 @@
+// Runtime: 116 ms, faster than 68.53% of C++ online submissions for Find All Duplicates in an Array.
+// Memory Usage: 14.8 MB, less than 100.00% of C++ online submissions for Find All Duplicates in an Array.
+
+class Solution 
+{
+public:
+    vector<int> findDuplicates(vector<int>& nums) 
+    {        
+        for (int index = 0; index < nums.size(); ++index)
+        {
+            while (nums[index] != index + 1)
+            {
+                if (nums[index] == nums[nums[index] - 1]) break;
+                swap(nums[index], nums[nums[index] - 1]);
+            }
+        }
+        
+        vector<int> res;
+        for (int index = 0; index < nums.size(); ++index)
+        {
+            if (nums[index] != index + 1)
+            {
+                res.push_back(nums[index]);
+            }
+        }
+        
+        return res;
+    }
+};

Find All Numbers Disappeared in an Array/Find_All_Numbers_Disappeared_in_an_Array.cpp

@@ -0,0 +1,29 @@
+// Runtime: 116 ms, faster than 68.68% of C++ online submissions for Find All Numbers Disappeared in an Array.
+// Memory Usage: 14.9 MB, less than 86.67% of C++ online submissions for Find All Numbers Disappeared in an Array.
+
+class Solution 
+{
+public:
+    vector<int> findDisappearedNumbers(vector<int>& nums) 
+    {
+        for (int index = 0; index < nums.size(); ++index)
+        {
+            while (nums[index] != index + 1)
+            {
+                if (nums[index] == nums[nums[index] - 1]) break;
+                swap(nums[index], nums[nums[index] - 1]);
+            }
+        }
+        
+        vector<int> res;
+        for (int index = 0; index < nums.size(); ++index)
+        {
+            if (nums[index] != index + 1)
+            {
+                res.push_back(index + 1);
+            }
+        }
+        
+        return res;
+    }
+};

Move Zeroes/Move_Zeroes.cpp

@@ -0,0 +1,27 @@
+// Runtime: 24 ms, faster than 11.13% of C++ online submissions for Move Zeroes.
+// Memory Usage: 9.5 MB, less than 75.00% of C++ online submissions for Move Zeroes.
+
+class Solution 
+{
+public:
+    void moveZeroes(vector<int>& nums) 
+    {
+        if (nums.empty()) return;
+        
+        int slowPtr = 0, fastPtr = 0;    
+        
+        while (fastPtr < nums.size())
+        {
+            while (fastPtr < nums.size() && nums[fastPtr] == 0) ++fastPtr;
+            
+            if (fastPtr >= nums.size()) break;
+            
+            nums[slowPtr++] = nums[fastPtr++];
+        }
+        
+        while (slowPtr < nums.size())
+        {
+            nums[slowPtr++] = 0;
+        }
+    }
+};