1144. The Missing Number (20)

1144. The Missing Number (20)

时间限制

150 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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⁵). 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

这题不就是2018 408考研数据结构真题吗

自己用map暴力了一点,后面参考dalao题解，应该是最优的

#include<stdio.h>
#include<map>
#include<limits.h>
using namespace std;
map<int,int>mp;
int maxn=INT_MAX;
int main(){
	int n,i,tmp;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&tmp);
		mp[tmp]=1;
	}
	for(i=1;i<=maxn;i++){
		if(mp[i]==0){
			printf("%d",i);break;
		}
	}
} 

dalao题解：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,val;
    vector<int> A;
    scanf("%d",&n);
    while(n--){
        scanf("%d",&val);
        if(val>0) A.push_back(val);
    }
    n=A.size();
    for(int i=0;i<n;++i){
        while(A[i]<=n&&A[i]!=A[A[i]-1]) swap(A[i],A[A[i]-1]);//妙啊，把正数调整到对应的下标 
    }
    for(int i=0;i<n;++i){
        if(A[i]!=i+1){
            printf("%d\n",i+1);
            return 0;
        }
    }
    printf("%d\n",n+1);
    return 0;
}