1144 The Missing Number

Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10
5
). Then N integers are given in the next line, separated by spaces. All the numbers are in the range of int.

Output Specification:

Print in a line the smallest positive integer that is missing from the input list.

Sample Input:

10
5 -25 9 6 1 3 4 2 5 17

Sample Output:

7

cpp代码

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n;
vector<int> vec;
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        vec.push_back(x);
    }
    sort(vec.begin(),vec.end());
    vec.erase(unique(vec.begin(),vec.end()),vec.end());
    vector<int> back;
    for(auto i:vec){
        if(i>0)back.push_back(i);
    }
    if(back.size()==0){
        cout<<"1"<<endl;
        return 0;
    }
    for(int i=1;i<=back.size();i++){
        if(i!=back[i-1]){
            cout<<i<<endl;
            return 0;
        }
    }
    cout<<back.back()+1<<endl;
   return 0;
}