Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<algorithm>
- #include<limits.h>
- #include<set>
- int solution(vector<int> &A) {
- // write your code in C++14 (g++ 6.2.0)
- int size = (int)A.size();
- set<int> res;
- for (int i = 0; i < size; i++) {
- res.insert(A[i]);
- }
- //sort(res.begin(), res.end());
- int minV = INT_MAX;
- for (int i = 0; i < (int)res.size(); i++) {
- if (res.count(i + 1) == 0) {
- minV = min(minV, i + 1);
- }
- }
- return minV == INT_MAX ? size + 1 : minV;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement