{

int res = 1;

priority_queue<int, vector<int>, greater<int>> sortArray;

for (auto num : nums)

{

if (num > 0)

sortArray.push(num);

}

int pre = 0;

if (!sortArray.empty())

pre = sortArray.top();

else

return 1;

while (!sortArray.empty())

{

int now = sortArray.top();

if (pre != now)

{

res++;

pre = now;

}

if (now == res)

sortArray.pop();

else

return res;

}

return res + 1;

{

int i = 0;

int n = nums.size();

while (i < n)

{

if (nums[i] > 0 && nums[i] <= n && nums[nums[i] - 1] != nums[i])

swap(nums[i], nums[nums[i] - 1]);

else

i++;

}

for (i = 0; i < n; ++i)

if (nums[i] != (i + 1))

return i + 1;

return n + 1;

{

//vector<int> nums = { 3,4,-1,1 };

vector<int> nums = { 0,2,2,1,1 };

//int res = firstMissingPositive(nums);

int res = firstMissingPositiveBetter(nums);

std::cout << "Hello World!\n";