Files
PS/leetcode/268.py
Gyubin Han dede0dca01 leetcode
2025-02-19 14:09:55 +09:00

12 lines
271 B
Python

class Solution:
def missingNumber(self, nums: List[int]) -> int:
last=-1
nums.sort()
for i in range(len(nums)):
if not last+1==nums[i]:
break
else:
last+=1
return last+1