数组转set，num从1开始遍历，有则加一，无则就是缺失的最小正整数 class Solution: def minNumberDisappeared(self , nums: List[int]) -> int: # write code here nums = set(nums) i=1 while(i in nums): i+=1 return i
