leetcode448

1、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]

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

数组的大小就确定了数组的范围，通过nums[i]->m->nums[m]的转换，将数组中的每个数转换成了下标，也就是寻找遗漏的下标，不存在的数，对应的下标，不会被操作，也就是不会变成负数，这样遍历一遍大于零的数，就是要寻找的数啦~