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?
这个题目的要求是,只读,并且不准申请额外空间,那么如何标记成了一个重要的问题,恰好题目中最多只会出现两次,因此找到元素后,利用负号进行标记是个最佳的方式,代码如下
class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
int i = 0;
int pos = 0;
vector<int> final_num;
for (; i < nums.size(); i++)
{
pos = abs(nums[i]) - 1;
if (nums[pos] < 0)
{
final_num.push_back(abs(nums[i]));
}
else
{
nums[pos] = -nums[pos];
}
}
return final_num;
}
};