class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
int i=0;
while(i<nums.size())
{
if(nums[i]!=i+1&&nums[i]>0&&nums[i]<nums.size()&&nums[i]!=nums[nums[i]-1])
swap(nums[i],nums[nums[i]-1]);
else
i++;
}
for(i=0;i<nums.size();i++)
if(nums[i]!=i+1)
return i+1;
return i+1;
}
};
leetcode 41: First Missing Positive
最新推荐文章于 2020-08-24 23:43:26 发布