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 (≤105). 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
Code:
#include<iostream>
#include<map>
#pragma warning(disable:4996)
using namespace std;
map<int, bool> isFind;
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
int t; scanf("%d", &t);
if (t > 0) isFind[t] = true;
}
int ans = 1;
while (isFind.count(ans)) ans++;
printf("%d\n", ans);
return 0;
}
思路:
用vector会炸