【笨方法学PAT】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 (≤10​5​​). 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个数字，找到不在这个数字列表里面的最小的正整数

三、考点

数组

四、注意

1、N有最大限制， N (≤10​5​​)；

2、在读取的时候要判断读取的数是否比n大，否则只有18分。

五、代码

#include<iostream>
#define N 100000010
using namespace std;
bool a[N] = { false };
int main() {
	//read
	int n;
	cin >> n;
	for (int i = 0; i < n;++i) {
		int m;
		cin >> m;
		if (m > 0 && m <= n) {
			a[m] = true;
		}
	}

	//solve
	for (int i = 1; i<N; ++i)
		if (a[i] == false) {
			cout << i;
			break;
		}

	system("pause");
	return 0;
}