时间O(n)不用多申请空间找到缺失的第一个正整数

鸫岽

于 2018-01-26 15:16:10 发布

阅读量237

点赞数

分类专栏： leetoj

本文链接：https://blog.csdn.net/qq_39813645/article/details/79172735

版权

leetoj 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

41. First Missing Positive

Description Hints Submissions Discuss Solution

Discuss Pick One

Given an unsorted integer array, find the first missing positive integer.

For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.

Your algorithm should run in O(n) time and uses constant space.

class Solution
{
public:
    int firstMissingPositive(vector<int>& nums)
    {
        int n = nums.size();
        int i = 0;
        while(i < n)
        {
            if(nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1])
                swap(nums[i], nums[nums[i] - 1]);
            else i++;
        }
        for(i = 1; i <= n; i++)
            if(nums[i - 1] != i)
                return i;
        return i;
    }
};