【PAT】A1144 The Missing Number (20 point(s))

作者: CHEN, Yue
单位: 浙江大学
时间限制: 150 ms
内存限制: 64 MB
代码长度限制: 16 KB

A1144 The Missing Number (20 point(s))

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

Code

#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
bool mark[100010];
int main(){
    int n,temp;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&temp);
        if(temp>0&&temp<100010)  mark[temp]=1;
    }
    for(int i=1;i<=100009;i++){
        if(mark[i]==0){
            printf("%d\n",i);
            return 0;
        }
    }
    return 0;
}

Analysis

-找到一个数组中最小未出现的正整数。

-使用一个表存出现过的数，如果是正整数就将表对应位置置1。之后遍历表 （从1开始），第一个为零的位置i就是最小未出现的正整数i。