PAT 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

思路：使用map

程序：

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int main()
{
  int n;
  scanf("%d",&n);
  map<int,int> mapping;
  for(int i = 0; i < n; i++)
  {
    int a;
    scanf("%d",&a);
    if(a > 0)
      mapping[a] = 1;
  }
  int x = 1;
  while(mapping.find(x) != mapping.end())
  {
    x++;
  }
  printf("%d\n",x);
  return 0;
}