[剑指offer][面试题40]数组中只出现一次的数字

#include <iostream>
using namespace std;

bool findNumsAppearOnce(int *piData, int iLen, int & iNum0, int & iNum1)
{
if (iLen<2){
return false;
}

int iXOR = 0;
for (int i=0; i<iLen; i++){
iXOR ^= piData[i];
}

int iFlag = 1;
while ( !(iXOR & iFlag) && (iFlag<0x8FFFFFFF) ){
iFlag <<= 1;
}

iNum0 = 0;
iNum1 = 0;
for (int i=0; i<iLen; i++){
if (piData[i] & iFlag){
iNum0 ^= piData[i];
}
else{
iNum1 ^= piData[i];
}
}

return true;
}

int main()
{
int data[8] = {2,4,3,6,3,2,5,5};
int a, b;

bool bFound = findNumsAppearOnce(data, 8, a, b);
if (bFound){
cout<<a<<" "<<b<<endl;
}
}