leetcode-442.Find All Duplicates in an Array

题目

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作为idx，把idx处的值设为相反数，如果设置后的值是正数，说明该位置的值的绝对值遇到过两次

• 取绝对值是因为设置相反数会使得值变成负数
• 减1是因为值的范围是1<=a[i]<=n，但是矢量坐标的值范围是0<=idx<=n-1

代码

#include "stdafx.h"
#include <vector>
#include <iostream>
using namespace std;

void showvector(vector<int> &input) {
	for (int i = 0; i < input.size(); i++) {
		cout << input[i] << '\t';
	}
	cout << endl;
}

vector<int> findDuplicates(vector<int>& nums) {
	vector<int> res;
	for (int i = 0; i < nums.size(); i++) {
		showvector(nums);
		nums[abs(nums[i]) - 1] = -nums[abs(nums[i]) - 1];
		if (nums[abs(nums[i]) - 1] > 0) res.push_back(abs(nums[i]));
	}
	return res;
}

int main()
{
	vector<int> nums(8);
	for(int i = 0; i < 8; i++){
		nums[i] = 7-i+1;
	}
	nums[6] = 3;
	nums[1] = 8;
	vector<int> result = findDuplicates(nums);
	cout << result.size();
    return 0;
}