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]
解法:若不能增加额外空间,我们只能在原数组上进行操作。从逻辑上考虑这题的做法,我们可以先遍历一遍数组,寻找每一个数字所对应的位置。如4的正确位置应该为array[3],1为array[0]。反过来,就是说我们应该找到某个位置是否有数字所对应。要如何表示这个关系?我们可以这样做,如array[3]已经有数字4所对应,我们可以将array[3]取负数,表示已经有数字对应。即,如果array[i]是负数,则数组里存在数字 i+1。最后,我们再遍历一次数组,如果array[i]是正数,说明数组里缺少 i+1.
代码如下:
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
for(int i = 0; i < nums.size(); i++) {
int m = abs(nums[i])-1;
nums[m] = nums[m]>0 ? -nums[m] : nums[m];
}
vector<int> v;
for(int i = 0; i < nums.size(); i++) {
if(nums[i] > 0) v.push_back(i+1);
}
return v;
}
};