#define LIMIT 3
//计算二进制中1个数
int find1NumsInBin(int num) {
int count = 0;
while (num) {
num = num & (num - 1);
count++;
}
return count;
}
bool isVaild(int n) {
int count = 0;
while (n) {
if (count == LIMIT) {
return false;
}
n = n & (n - 1);
count++;
}
return true;
}
vector<int> findNumModLQ3(int* arr, int len, int target) {
vector<int> vct;
if (!arr || !len) {
return vct;
}
for (int i = 0; i < len; ++i) {
if (isVaild(arr[i] ^ target)) {
vct.push_back(arr[i]);
}
}
cout << endl;
return vct;
}