版权声明:孔庆鑫 https://blog.csdn.net/kongqingxin12/article/details/84977061
class Solution {
public:
int firstMissingPositive(vector<int>& nums)
{
sort(nums.begin(), nums.end());
auto pos = unique(nums.begin(), nums.end());
nums.erase(pos, nums.end());
int j = 1;
for (auto i = nums.begin(); i !=nums.end(); i++)
{
if (*i > 0)
{
if (*i > j)
return j;
else
j++;
}
}
return j;
}
};