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,且要求O(n)时间复杂度。
思路:将num[i]对应的数放在num[i]-1对应的位置上。比如上述例子中,将第一个元素4,即num[0],放在数组小标为4-1的位置上,直到当前i的位置为1或者找到重复元素为止,再进入i+1的处理。通过上述方法,可以将所有出现过一次的元素m放在对应m-1的位置上。如上述示例经过上述过程处理后,数组的最终结果为:[1, 2, 3, 4, 3, 2, 7, 8]
程序如下所示:
class Solution {
public List<Integer> findDuplicates(int[] nums) {
List<Integer> result = new ArrayList<>();
for (int i = 0; i < nums.length; ++ i){
if (i + 1 == nums[i]){
continue;
}
while (true){
int tmp = nums[nums[i] - 1];
nums[nums[i] - 1] = nums[i];
nums[i] = tmp;
if (i + 1 == tmp || nums[i] == nums[nums[i] - 1]){
break;
}
}
}
for (int i = 0; i < nums.length ;++ i){
if (i + 1 != nums[i]){
result.add(nums[i]);
}
}
return result;
}
}