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]
public List<Integer> findDisappearedNumbers(int[] nums) {
List<Integer> ret = new ArrayList<Integer>();
for(int i=0;i<nums.length;i++){
int val = Math.abs(nums[i])-1;
if (nums[val]>0) nums[val] = -nums[val];
}
for(int i=0;i<nums.length;i++){
if(nums[i]>0){
ret.add(i+1);
}
}
return ret;
}
总结:好机智,把见过的数对应位置的数字取负值作为标志信号。主要是利用了本题目中nums长度为n这一信息。