参考了这个题解
nums[nums[i]%n] += n原地建哈希表是一个不错的编程技巧,然后整除n就可以得到出现次数
class Solution:
def firstMissingPositive(self, nums: List[int]) -> int:
nums.append(0)
n = len(nums)
for i in range(len(nums)):
if nums[i]<0 or nums[i]>=n:
nums[i]=0
for i in range(len(nums)):
nums[nums[i]%n] += n
for i in range(n):
if nums[i]//n == 0:
return i
return n