题目 题解 解法一:时间复杂度 O(n),空间复杂度O(n) def firstMissingPositive(nums: List[int]) -> int: dict_num = dict() for i in nums: dict_num[i] = 1 j = 1 while j: if j not in dict_num: return j else: j += 1 解法二: 时间复杂度O(n)