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]
1 ≤ a[i] ≤ n是关键,不断的把元素交换到对应的位置。第二次循环的时候判断是否重复。
public class Solution {
public List<Integer> findDuplicates(int[] nums) {
List<Integer> res=new ArrayList<>();
for(int i=0;i<nums.length;){
if(nums[i]!=i+1&&nums[i]!=nums[nums[i]-1]){
int t=nums[i];
nums[i]=nums[t-1];
nums[t-1]=t;
}
else i++;
}
for(int i=0;i<nums.length;i++){
if(nums[i]-1!=i)
res.add(nums[i]);
}
return res;
}
}
第二种更简单一点,在元素对应的地方标记一下,在第二次来的时候就将元素放到res中。相当于多了一种用正负号表示的信息
public class Solution {
public List<Integer> findDuplicates(int[] nums) {
List<Integer> res=new ArrayList<>();
if(nums.length<1) return res;
for(int i=0;i<nums.length;i++){
int next=Math.abs(nums[i])-1;
if(nums[next]<0) res.add(next+1);
else nums[next]*=-1;
}
return res;
}
}