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 #include<cstdio> const int maxn = 1000100; bool arr[maxn] = {false};int main(){int n;scanf("%d",&n);int num;for(int i = 0; i < n; i++){scanf("%d",&num);if(num > 0 && num < maxn) arr[num] = true;}for(int i = 1; i < maxn; i++){if(arr[i] == false){printf("%d",i);return 0;}}return 0; }

?

轉載于:https://www.cnblogs.com/wanghao-boke/p/10458570.html

總結

以上是生活随笔為你收集整理的1144 The Missing Number （20 分）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。