数组中只出现一次的两个数字

#include <iostream>
using namespace std;

void fun(int a[], int n)
{
int temp = 0;
for (int i = 0; i < n; i++)
{
temp ^= a[i];
}

int bitFactor = 1;
while (true)
{
if (temp & bitFactor)
{
break;
}
bitFactor <<= 1;
}

int result1 = 0;
int result2 = 0;

for (int i = 0; i < n; i++)
{
if (a[i] & bitFactor)
{
result1 ^= a[i];
}
else
{
result2 ^= a[i];
}
}

cout << result1 << " " << result2 << endl;
}