题目地址:https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/
我的解答:
class Solution:
def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
if not nums: return []
n = len(nums)
res = []
nums.sort()
x = 1
while x < nums[0]:
res.append(x)
x += 1
for i in range(1, n):
if nums[i] == x or nums[i] == x + 1:
x = nums[i]
continue
else:
x += 1
while x < nums[i]:
res.append(x)
x += 1
while x < n:
x += 1
res.append(x)
return res