Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Example:
Input:
[4,3,2,7,8,2,3,1]
Output:
[5,6]
Firstly, place each number a
in the position a-1
, then i is disappeared in the array if i+1 != array[i]
.
class Solution:
def findDisappearedNumbers(self, nums: 'List[int]') -> 'List[int]':
res = []
i = 0
while i < len(nums):
if nums[i] != nums[nums[i]-1]:
temp = nums[i]
nums[i] = nums[temp-1]
nums[temp-1] = temp
else:
i += 1
for i in range(len(nums)):
if i+1 != nums[i]:
res.append(i+1)
return res