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
易错点
最大的整数的100000(5个0),所以数组要开100005。
检验的时候要考虑到如果超过这个数,要当作无效,不要读进数组。
输出的时候要考虑可能1到100000的每个数都出现了,那要输出100001。
满分代码
#include <iostream>
using namespace std;
int n,i,a[100005];
int main(){
scanf("%d\n",&n);
while(n--){
scanf("%d",&i);
if(i>0 && i<100001)a[i]=1;
}
for(i=1;i<=100001;i++){
if(a[i]!=1){
cout<<i;
break;
}
}
return 0;
}
如果喜欢我的文章,请给我点赞哦!