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
题目要求
找出给定序列中,从1……N中缺失的最小值
完整代码
方法1
#include<bits/stdc++.h>
using namespace std;
map<int,bool> m;
int main(){
int n,i,temp;
cin>>n;
for(i=0;i<n;i++){
cin>>temp;
if(temp>0){
m[temp]=true;
}
}
for(i=1;i<10000010;i++){
if(!m[i]){
cout<<i;
return 0;
}
}
return 0;
}
方法2
#include<bits/stdc++.h>
using namespace std;
bool a[10000010],num=1;
int main(){
int n,v,min=1,i;
char c[20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",c);
if(c[0]=='-'||strlen(c)>7) continue;
v=atoi(c);
a[v]=true;
while(a[min]) min++;
}
while(a[min]) min++;
printf("%d",min);
return 0;
}