Leetcode学习笔记:#448. Find All Numbers Disappeared in an Array
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.
实现:
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;
}
思路:
第一次遍历,把见过的数字标记为负数,第一次遍历如果遇到不是负数的,说明没有遇过,保存