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

思路一：此题比较简单，用一个bool数组存放已经出现得正整数即可，考虑到：
一、最小正整数，所以如果是负数或者零，则忽略
二、因为给得数据的个数最多为10的5次方个，那么最小未出现的正整数，一定在10的五次方+1 以内，因此大于这个数值的也可忽略
三、对已经出现的在1-10^5 + 1的正整数，对bool数组相应下标置为true，输入完之后，从下标1开始遍历，第一次找到为false对应的下标，就是最小未出现的正整数

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
using namespace std;
const int Maxn = 100010;
bool isE[Maxn];

int main() {
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    int N,data;
    scanf("%d", &N);
    for (int i = 0; i < N; ++i) {
        scanf("%d", &data);
        if (data <= 0 || data >= Maxn) continue;
        isE[data] = true;
    }

    for (int i = 1; i < Maxn; ++i) {
        if (isE[i] == false) {
            printf("%d", i);
            break;
        }
    }

    return 0;
}  

思路二：对上述范围内的数用一个数组进行保存，然后进行排序，分三种情况：
一、如果输入的数字没有正整数，那么最小未出现的是1
二、如果输入有正整数，且排序后第一个元素不为1，那么最小未出现也是1
三、除去上述两种情况，那么一定是排序后，相邻元素不满足1：前一个元素等于后一个元素；2：前一个元素+1不等于后一个元素，则未出现的最小正整数为前一个元素的值加1

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
using namespace std;
const int Maxn = 100010;
int Num[Maxn], numN = 0;

int main() {
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    int N,data;
    scanf("%d", &N);
    for (int i = 0; i < N; ++i) {
        scanf("%d", &data);
        if (data <= 0 || data >= Maxn) continue;
        Num[numN++] = data;
    }
    sort(Num, Num + numN);

    if (numN == 0 || Num[0] != 1) printf("1");
    else {
        int i = 0;
        for (; i < numN; ++i) {
            if (Num[i - 1] + 1 == Num[i] || Num[i - 1] == Num[i]) continue;
            break;
        }
        printf("%d", Num[i - 1] + 1);
    }

    return 0;
}  

思路三：额，这个思路可能一般不容易想到，就不细说了，前面两种完全够用，感兴趣自己理解一下代码吧

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
using namespace std;
const int Maxn = 100010;
int Num[Maxn], numN = 1;

int main() {
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    int N,data;
    scanf("%d", &N);
    for (int i = 0; i < N; ++i) {
        scanf("%d", &data);
        if (data <= 0 || data >= Maxn) continue;
        Num[numN++] = data;
    }

    for (int i = 1; i <= numN; ++i) {
        if (Num[i] <= i && Num[i] != Num[Num[i]]) {
            swap(Num[i], Num[Num[i]]);
            --i;
        }
    }

    for (int i = 1; i <= Maxn; ++i) {
        if (Num[i] != i) {
            printf("%d", i);
            break;
        }
    }

    return 0;
}