PAT (Advanced Level)-1144 The Missing Number

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 (≤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

---

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

代码块

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int n,i;
    cin >> n;
    int *a = new int[n];
    for (int i = 0; i < n; ++i)
    {
        scanf("%d", &a[i]);

    }
    sort(a, a + n);
    if (a[n - 1] < 0)printf("1\n");
    else
    {
        for (i = 0; i < n-1; ++i)
        {
            if (a[i] <= 0 && a[i + 1] > 1)
            {
                printf("1\n");
                break;
            }
            else if (a[i] > 0 && a[i + 1] > 0 && a[i + 1] - a[i] > 1)
            {
                printf("%d\n", a[i] + 1);
                break;
            }
        }
        if (i == n - 1)printf("%d\n", a[n - 1] + 1);
    }

}