AcWing 1637. 漏掉的数字
原题链接
简单
作者:
Present.
,
2022-05-06 18:43:13
,
所有人可见
,
阅读 215
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
using namespace std;
const int N = 1e5 + 10;
int a[N];
unordered_map<int,int> mp;
vector<int> v;
int main()
{
int n;
cin >> n;
for(int i = 0;i < n;i ++)
{
cin >> a[i];
if(a[i] > 0)
{
v.push_back(a[i]);
}
}
if(v.size() == 0) cout << "1" << endl;
else
{
sort(v.begin(),v.end());
for(int i = 0;i < v.size();i ++) mp[v[i]] ++;
for(int i = 0;i < v.size();i ++)
{
if(mp[v[i] + 1] == 0)
{
cout << v[i] + 1 << endl;
break;
}
}
}
return 0;
}