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]
Subscribe to see which companies asked this question.
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
unordered_map<int,int> nums_map;//建立unordered_map
vector<int> res;
int numSize = nums.size();
if(numSize){
for(vector<int>::iterator itr=nums.begin();itr!=nums.end();++itr){
nums_map.insert(make_pair(*itr,*itr));//将nums每个数存入map中
}
for(int i=1;i<=numSize;++i){
if(nums_map.find(i)==nums_map.end()){
res.push_back(i);//在1~numSize范围内,查找出map中不存在的数,保存到res中
}//if
}//for
}//if
return res;//返回结果
}
};