Update 0448-find-all-numbers-disappeared-in-an-array.cpp

The time complexity should be O(n), since the worst case scenario the size of ans will be n - 1. It's not O(1)

Author: ShiweiHe0713

cpp/0448-find-all-numbers-disappeared-in-an-array.cpp

@@ -8,7 +8,7 @@ class Solution {
     At the end, which ever places are positive, add them to our answer.
     
     Time complexity: O(n)
-    Space complexity: O(1)
+    Space complexity: O(n)
     */
     vector<int> findDisappearedNumbers(vector<int>& nums) {
         vector<int> ans;
@@ -23,4 +23,4 @@ class Solution {
 
         return ans;
     }
-};
+};