題目描述
一個整型數組裏除了兩個數字之外,其他的數字都出現了偶數次。請寫程序找出這兩個只出現一次的數字。
題解
#include <iostream>
#include <vector>
using namespace std;
void FindNumsAppearOnce(vector<int> data, int* num1, int *num2)
{
int res = 0, index = 0;
for (int i = 0; i < data.size(); i++)
res ^= data[i];
for (int i = 0; i < 32; i++)
if (res >> i & 1)
{
index = i;
break;
}
for (int i = 0; i < data.size(); i++)
{
if (data[i] >> index & 1)
*num1 ^= data[i];
else
*num2 ^= data[i];
}
}
int main()
{
ios::sync_with_stdio(false);
vector<int> v;
int n, temp, num1 = 0, num2 = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> temp;
v.push_back(temp);
}
FindNumsAppearOnce(v, &num1, &num2);
cout << num1 << " " << num2 << endl;
return 0;
}