1144 The Missing Number (20分)

Posted littlepage

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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 (≤). 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

消失的数字,我们给定一串数字,求从1开始遍历,最先消失的数字。

#include <iostream>
#include <unordered_map>
using namespace std;
int N, tmp;
unordered_map<int, bool> m;
int main() {
    cin >> N;
    while(N--) {
        cin >> tmp;
        m[tmp] = 1;
    }
    for(int i = 1; i < 101000; i++) {
        if(m[i] == 0) {
            printf("%d
", i);
            break;
        }
    }
    return 0;
}

 

以上是关于1144 The Missing Number (20分)的主要内容,如果未能解决你的问题,请参考以下文章

PAT 1144 The Missing Number

1144 The Missing Number (20分)

PAT 甲级 1144 The Missing Number

PAT Advanced 1144 The Missing Number (20分)

1144 The Missing Number

1144 The Missing Number (20 分)难度: 一般 / 知识点: 模拟