Solution of 1144 The Missing Number (20)

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

---

结题思路 ：
题意要求在已知的正整数序列中发现这个序列中缺失的第一个正整数。由于正整数的无限性，这个缺失的数必然存在。

程序步骤：
第一步、只对正整数进行保存。
第二步、对序列进行排序。
第三步、从１开始对数列进行检查；如果没有发现，输出最后一个数+1。

---

具体程序(AC)如下：

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int vec[100005];
    int n;
    cin >> n;
    int value;
    int cur = 0;
    while(n--)
    {
        cin >> value;
        if(value > 0)
            vec[cur++] = value;
    }
    sort(vec, vec + cur);
    if(vec[0] != 1)
        cout<<1<<endl;
    else
    {
      int i = 1;
      for(; i < cur; ++i)
      {
          if(vec[i - 1] + 1 < vec[i])
          {
              cout<<vec[i - 1] + 1<<endl;
              break;
          }
      }
      if(cur == i)
        cout<<vec[cur - 1] + 1<<endl;
    }
    return 0;
}