448 Find All Numbers Disappeared in an Array找到[1,n]内没有出现的数字

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]

用标志位的方法去做，把原数组中出现的数其应该所在的位置上置为负值（要注意判断若已经是负值，就说明目前已经出现了不只一次），然后重新遍历如果大于0，则表示从未出现过。时间复杂度是O(n)，空间复杂度是O(1).

class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {`
        vector<int> result;
        for(int i=0;i<nums.size();i++)
        {
            int index=abs(nums[i])-1;
            if(nums[index]>0) nums[index]=-nums[index];
         }
         for(int i=0;i<nums.size();i++)
         {
             if(nums[i]>0) result.push_back(i+1);
         }
         return result;
     }
};