Leetcode448 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) {
        int len = nums.size();
        vector<int> result;
        for(int i = 0; i < len; i++){
            int index = abs(nums[i]) - 1;//index表示这个数nums[i]应该在的位置
            nums[index] = nums[index] > 0? -nums[index]:nums[index];
        }//关键是把所有数都标记成负数，如果那个数没有出现，则没有数能够映射到它，那么在它应该在的位置上的数是正数。
        for(int i = 0; i < len; i++){
            if(nums[i] > 0) result.push_back(i+1);
        }
        return result;
    }
};