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:
代码语言：javascript复制Input:
[4,3,2,7,8,2,3,1]
Output:
[2,3]我的答案:
代码语言：javascript复制 public List<Integer> findDuplicates(int[] nums) {
sort(nums);
List<Integer> list = new ArrayList<>();
for (int i = 1; i < nums.length; i ) {
if(nums[i] == nums[i-1]){
list.add(nums[i]);
}
}
return list;
}大神答案:
代码语言：javascript复制 public static 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;
} 
