LeetCode 448. 找到所有数组中消失的数字

示例:

输入:
[4,3,2,7,8,2,3,1]

输出:
[5,6]

class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        for(int i = 0; i < nums.size(); )
        {
        	if(nums[i] == i+1 || nums[nums[i]-1] == nums[i])
        	{
        		i++;
        	}
        	else
        	{
        		swap(nums[i], nums[nums[i]-1]);
        	}
        }
        vector<int> ans;
       	for(int i = 0; i < nums.size(); ++i)
       	{
       		if(nums[i] != i+1)
       			ans.push_back(i+1);
       	}
       	return ans;
    }
};