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
思路分析
这题说是水题也不为过
注意那个 data>100000 continue的操作 没有它最后一个点会有段错误
#include<cstdio>
#include<iostream>
#define MAX 99992999
using namespace std;
int map[MAX]={0};
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int data;
cin>>data;
if(data<=0)continue;
if(data>100000)continue;
map[data]=1;
}
for(int i=1;i<MAX;i++)
{
if(map[i]==0)
{
cout<<i;
break;
}
}
}