按位进行整数的同或运算:
输入 int a ,b;
输出 int res;
int xnor(int a, int b) {
int res = 0;
int arr1[32] = { 0 };
int arr2[32] = { 0 };
for (int i = 0; i < 32; i++) {
arr1[i] = a % 2;
arr2[i] = b % 2;
a = a / 2;
b = b / 2;
}
int m = 0;
for (int i = 31; i >= 0; i--) {
if (arr1[i] == 1 || arr2[i] == 1) {
m = i + 1;
break;
}
}
int *arr3 = new int[m];
for (int i = 0; i < m; i++) {
if (arr1[i] == arr2[i]) arr3[i] = 1;
else arr3[i] = 0;
res = res + arr3[i] * pow(2, i);
}
return res;
}



