class Solution:
def minNumberDisappeared(self , nums: List[int]) -> int:
# write code here
# nums.sort()
# 对字典和对列表使用in 和not in 时间复杂度不一样,一个on一个o1
hash = {}
for i in nums:
if i not in hash:
hash[i]=1
else:
hash[i]+=1
res = 1
while res in hash:
res +=1
return res

京公网安备 11010502036488号