PAT 甲级 1144 The Missing Number

漫浸天空的雨色

于 2019-02-28 16:28:28 发布

阅读量430

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT甲级 PAT甲级/乙级机试经验文章标签： PAT甲级 The Missing Number 1144

本文链接：https://blog.csdn.net/a845717607/article/details/88032935

PAT甲级/乙级机试经验同时被 2 个专栏收录

254 篇文章

订阅专栏

PAT甲级

159 篇文章

订阅专栏

本文介绍了一种算法，用于从给定的整数列表中找出最小的未出现的正整数。通过标记法实现，确保了算法的高效性和准确性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1144 The Missing Number （20 point(s)）

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:

经验总结：

emmm 简单的划水题，不多说啦~

AC代码

#include <cstdio>
const int maxn=100010;
bool flag[maxn]={false};
int main()
{
	int n,t;
	scanf("%d",&n);
	for(int i=0;i<n;++i)
	{
		scanf("%d",&t);
		if(t<maxn&&t>0)
			flag[t]=true;
	}
	for(int i=1;i<maxn;++i)
		if(flag[i]==false)
		{
			printf("%d\n",i);
			break;
		}
	return 0;
}