Problem Description:
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]
Analysis:
本题的思路也是非常简单,使用每个位置的元素给存在元素做标记,存在即转化为相反数。代码如下:
Code:
class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
List<Integer> res = new ArrayList<>();
for(int i = 0; i < nums.length; i++) {
if(nums[i] > 0) {
if(nums[nums[i] - 1] > 0) {
nums[nums[i] - 1] *= -1;
}
} else {
if(nums[Math.abs(nums[i]) - 1] > 0) {
nums[Math.abs(nums[i]) - 1] *= -1;
}
}
}
for(int i = 0; i < nums.length; i++) {
if(nums[i] < 0) continue;
res.add(i + 1);
}
return res;
}
}