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]
Solution
class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
List<Integer> missingNums = new ArrayList<>();
int i = 0;
while (i < nums.length) {
if (nums[i] == i + 1 || nums[i] == nums[nums[i] - 1]) {
++i;
} else {
swap(nums, i, nums[i] - 1);
}
}
for (i = 0; i < nums.length; ++i) {
if (nums[i] != i + 1) {
missingNums.add(i + 1);
}
}
return missingNums;
}
public void swap(int[] nums, int i, int j) {
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
}
