Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements that appear twice in this array.
Could you do it without extra space and in O(n) runtime?
Example:
Input: [4,3,2,7,8,2,3,1] Output: [2,3]
public class Solution { public List<Integer> findDuplicates(int[] nums) { for(int i = 0; i < nums.length; i++) { int val = (nums[i] -1) % nums.length; nums[val] += nums.length; } List<Integer> ret = new ArrayList<Integer>(); for(int i = 0; i < nums.length; i++) { if(nums[i] > 2 * nums.length) ret.add(i+1); } return ret; } }
public class Solution {
// when find a number i, flip the number at position i-1 to negative.
// if the number at position i-1 is already negative, i is the number that occurs twice.
public List<Integer> findDuplicates(int[] nums) {
List<Integer> res = new ArrayList<>();
for (int i = 0; i < nums.length; ++i) {
int index = Math.abs(nums[i])-1;
if (nums[index] < 0)
res.add(Math.abs(index+1));
nums[index] = -nums[index];
}
return res;
}
}