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之间的。
vector<int> findDisappearedNumbers(vector<int>& nums) {
sort(nums.begin(),nums.end());
int n=nums.size();
vector<int> ans;
if(!n) return ans;
int idx=1;
//1和nums[0]之间的
while(nums[0]>idx)
ans.push_back(idx++);
//中间部分
for(int i=1;i<n;i++)
{
if(nums[i]==nums[i-1]||nums[i]==nums[i-1]+1)
continue;
if(nums[i]>nums[i-1]+1)
{
for(int j=nums[i-1]+1;j<nums[i];j++)
ans.push_back(j);
}
}
idx=nums[n-1];
//nums[n-1]和n之间
while(idx!=n)
{
ans.push_back(++idx);
}
return ans;
}
Update:
只用O(n)时间:但需要用个表记录访问过的元素
vector<int> findDisappearedNumbers(vector<int>& nums) {
int n=nums.size();
vector<bool> used(n,0);
for(int num:nums) if(!used[num-1]) used[num-1]=1;
vector<int> ans;
for(int i=0;i<n;i++)
if(!used[i]) ans.push_back(i+1);
return ans;
}
只用O(n)时间和不用额外空间:就是想办法表达used信息,因为数组的下标恰好有n个,可以使用。如果i存在,那么下标为i的nums[i]变成负数。
它的绝对值又保存了原来的信息。
vector<int> findDisappearedNumbers(vector<int>& nums) {
int n=nums.size();
vector<bool> used(n,0);
for(int i=0;i<n;i++)
{
int num=abs(nums[i])-1;
if(nums[num]>0) nums[num]=-nums[num];
}
vector<int> ans;
for(int i=0;i<n;i++)
if(nums[i]>0) ans.push_back(i+1);
return ans;
}