Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

Could you do it without extra space and in O(n) runtime?

You may assume the returned list does not count as extra space.

Example:

Input:

[4,3,2,7,8,2,3,1]

Output:

[5,6]

思路：

The idea is very similar to problem 442. Find All Duplicates in an Array: .

First iteration to negate values at position whose equal to values appear in array. Second iteration to collect all position whose value is positive,

which are the missing values. Complexity is O(n) Time and O(1) space.

vector
     
       findDisappearedNumbers(vector
      
       & nums)     {         int len = nums.size();         for (int i = 0; i
       
        0 ? -nums[m] : nums[m];         }         vector
        
          res;         for (int i = 0; i
         
           0) res.push_back(i + 1);         }         return res;     }
         
        
       
      
     

参考：