leetcode_find_all_numbers_disappeared_in_an_array

发表于

难度：Easy

声明一个nums.size()大小的数组。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        int maximum = nums.size();
        vector<int> ret (maximum,0);
        for(int i = 0; i < nums.size();i++)
        {
            ret[nums[i]-1] = 1;
        }
        for(int i = 0; i < maximum; i++)
        {
            if(ret[i] == 0)
                ret.push_back(i+1);
        }
        ret.erase(ret.begin(),ret.begin()+maximum);
        return ret;
    }
};

0ms,4.37%