Leetcode: First Missing Positive

ayst123

于 2015-09-25 10:22:06 发布

阅读量334

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.csdn.net/ayst123/article/details/48729605

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文介绍了一种算法，用于在给定未排序的整数数组中找到第一个缺失的正整数，运行时间复杂度为O(n)，使用常量空间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question

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.

Hide Tags Array
Hide Similar Problems (M) Missing Number

Solution

Get idea from here.

class Solution(object):
    def firstMissingPositive(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """

        if nums==None or len(nums)==0:
            return 1

        i = 0
        while i<len(nums):
            if nums[i]<=len(nums) and nums[i]>0 and nums[nums[i]-1]!=nums[i]:
                j = nums[i] - 1
                nums[i], nums[j] = nums[j], nums[i]
                i -= 1

            i += 1

        for i in range(len(nums)):
            if nums[i]!=(i+1):
                return i+1

        return len(nums)+1