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]
解题思路:
遍历一遍数组的所有数,将每个数字所引的那个位置的数字置为相反数,然后再遍历一遍这个数组,将为正数的位置上的标号输出
解题代码:
ans=[]
for i in range(0,len(nums)):
idx=abs(nums[i])-1
nums[idx]=-nums[idx] if nums[idx]>0 else nums[idx]
for i in range(0,len(nums)):
if nums[i]>0:
ans.append(i+1)
return ans