描述
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]
给一个数组
a
,其中
分析
记录某元素 a[i] 出现过一次的做法是将数组 a[i] 位置的元素(即 a[a[i]] )取反,那么我们只需遍历一遍数组,判断数组 a[i] 位置的元素是否小于零(小于零说明之前已经出现了一次,加上当前的一次就是两次),然后将数组 a[i] 位置的元素取反就可以了。
代码
class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
vector<int> res;
for (int i = 0; i < nums.size(); i++) {
if (nums[abs(nums[i]) - 1] < 0) res.push_back(abs(nums[i]));
nums[abs(nums[i]) - 1] = - nums[abs(nums[i]) - 1];
}
return res;
}
};