1144 The Missing Number
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
总结:这道题目不难,算是一道签到题,先将数组排序,然后记录下出现的数字,最后从1开始循环一直到100001,查看哪一个数字是缺少的
代码:
#include <iostream>
#include