448. Find All Numbers Disappeared in an Array

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]

方法一：将已经出现的数字作为下标 的元素置负，再遍历数组，值为正数的下标即为缺失值，范围1~n,暗示元素均为正数。

class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        vector<int> res;
        for(int i=0;i<nums.size();++i)
        {
            int m=abs(nums[i])-1;
            nums[m]=nums[m]>0 ? -nums[m] : nums[m];//给的范围为1~n，默认全为正数
        }
        for(int i=0;i<nums.size();++i)
        {
            if(nums[i]>0)
                res.push_back(i+1);
        }
        return res;

    }
};

方法二：在nums[nums[i]-1]位置累加数组长度n，注意nums[i]-1有可能越界，所以需要对n取余，最后要找出缺失的数只需要看nums[i]的值是否小于等于n即可

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