1144. The Missing Number (20)

最新推荐文章于 2022-11-27 05:43:10 发布

JimmyLegend

最新推荐文章于 2022-11-27 05:43:10 发布

阅读量235

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/guoqingshuang/article/details/79786145

版权

PAT甲级专栏收录该内容

149 篇文章 1 订阅

订阅专栏

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⁵). 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:

题目大意：

代码：

#include<stdio.h>
#include<map>
using namespace std;
map<int,int> Map;
int main()
{
    int i,j,n,m,k=0,t;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&m);
        if(m>k)
            k=m;
        Map[m]=1;
    }
    for(i=1;i<=k+1;i++)
    {
        if(Map.find(i)==Map.end())
        {
            printf("%d",i);
            break;
        }
    }
    return 0;
}