「1144」The Missing Number

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

---

Ω

给出一个整数序列，输出序列中不存在的最小正整数。

注意到 最大也才 ，因此答案一定在 中。我们开一个 大小(最后一个索引是 )的bool数组，并初始化索引指针为1。每次读入一个数，如果是一个 的【正】整数，那么将其索引的bool值置true，同时往后移动(也可能不移动)索引指针到第一个值为false的索引。最后直接输出索引指针。

---

🐎

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k, ans = 1;
    scanf("%d", &n);
    vector<bool> pos(1e5 + 2, false);
    for (int i = 0; i < n; ++i)
    {
        scanf("%d", &k);
        if (k <= 1e5 && k > 0) pos[k] = true;
        while (pos[ans]) ++ans;
    }
    printf("%d", ans);
}