剑指offer56题目二

#include<iostream>
#include<algorithm>
using namespace std;

int Find(int data[],int n) {
	if (data == NULL||n<=0) exit(0);
	int a[32]={0};
	for (int i = 0; i < n; i++){
		int x = data[i], j = 0;
		while (j<32) {
			if((x&(1<<j))!=0) a[j]++;
			j++;
		}
	}
	int x = 0;
	for (int i = 0; i < 32; i++){
		a[i] %= 3;
		x += (a[i] << i);
	}
	return x;
}

int main() {
	int b[10] = {1,-2,1,5,5,-2,5,-3,1,-2};
	cout << Find(b,10) << endl;
	return 0;
}