1144 The Missing Number (20分)

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

找到第一个没出现的正整数，easy中的easy

#include<iostream>
#include<unordered_map>
using namespace std;
int main(){
    int n, x;
    cin>>n;
    unordered_map<int, int> ma;
    for(int i = 0; i < n; i++){
        cin>>x;
        ma[x]++;
    }
    for(int i = 1; i < 1000000000; i++){
        if(ma[i] == 0){
            cout<<i;
            return 0;
        }
    }
}

简单，1e9和1000000000一样，就是int的最大值

#include<iostream>
#include<unordered_map>
using namespace std;
int main(){
    unordered_map<int,int> hashTable;
    int n,x;
    cin>>n;
    for(int i = 0; i < n; i++){
        cin>>x;
        hashTable[x]++;
    }
    for(int i = 1; i < 1e9; i++){
        if(hashTable[i] == 0){
            cout<<i;
            return 0;
        }
    }
}