首页 > 代码库 > [Leetcode] First Missing Positive
[Leetcode] First Missing Positive
41.
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.
Solution:
Scan the array, for every index, put the number into the right place. Then scan the array for the 2nd time, find the wrong number should be easy.
Especially notice the loop condition.
class Solution(object): def firstMissingPositive(self, nums): """ :type nums: List[int] :rtype: int """ n = len(nums) for i in xrange(n): while n>=nums[i]>0 and nums[i] != nums[nums[i]-1]: #especially notice the condition, num[i]!=nums[nums[i]-1], which means the current number is corret in the corresponding index tmp = nums[i]-1 nums[i], nums[tmp] = nums[tmp], nums[i] for i in xrange(n): if nums[i] != i+1: return i+1 return n+1
[Leetcode] First Missing Positive
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。