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]

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;//返回结果
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值