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]
题意:
给定一个数组a,n=a.size(),满足里面的任意元素1<=a[i]<=n,其中有个数字出现两次,有的出现一次,让你找出[1,n]中没出现过的数字,返回输出。尽量在O(1)的空间复杂度下完成。
思路:
1.常规思路是使用哈希表记录出现过的数字,然后把[1,n]中没出现过的输出。空间复杂度O(N)
2.法二,由于数组元素均大于零且小于n,首先遍历数组,将每个大于零的nums[i]转成下标idx,让对应的nums[idx]变成对应的负数。第二次遍历,若nums[i]为正则说明,i 这个数字没有出现过。记录,最后输出结果数组。
参考代码:
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
vector<int> ans;
for(int i=0;i<nums.size();++i){
int idx=abs(nums[i])-1; //这里加上绝对值,以防止该数字之前出现过已经为负值,导致下标出错。
if(nums[idx]>0) nums[idx]*=-1;
}
for(int i=0;i<nums.size();++i){
if(nums[i]>0)
ans.push_back(i+1);
}
return ans;
}
};