1144 The Missing Number (20point(s)) - C语言 PAT 甲级

最新推荐文章于 2021-08-05 20:51:18 发布

有三只土豆

最新推荐文章于 2021-08-05 20:51:18 发布

阅读量125

点赞数

分类专栏： PAT 甲级文章标签： PAT 甲级 C语言

本文链接：https://blog.csdn.net/huaxuewan/article/details/107205031

版权

PAT 甲级专栏收录该内容

155 篇文章 3 订阅

订阅专栏

1144 The Missing Number (20point(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:

7

题目大意：

输入 N 个数字，输出不在这个数字集合中的最小正整数

设计思路：

直接申请 <limits.h> 中 INT_MAX 大小的数组，居然 AC 了

编译器：C (gcc)

#include <stdio.h>
#include <limits.h>

//int MAX = INT_MAX;//(unsigned)(-1) >> 1;
//MIN = ~MAX;
int map[INT_MAX];

int main(void)
{
        int n, i, t;

        scanf("%d", &n);
        for (i = 0; i < n; i++) {
                scanf("%d", &t);
                if (t > 0)
                        map[t] = 1;
        }
        for (i = 1; i < INT_MAX; i++)
                if (map[i] == 0)
                        break;
        printf("%d", i);

        return 0;
}