[LeetCode] 137. Single Number II 单独的数字之二

1.位运算很巧妙的应用啊。
#include
#include
using namespace std;
int SingleNumberII(vector &vec)
{
int res = 0;
for (int i = 0; i < 32; i++)
{
int sum = 0;
for (int j = 0; j < vec.size(); j++)
{
sum += (vec[j] >> i) & 1;
}
res |= (sum % 3) << i;
}
return res;
}
int main()
{
vector vec{ 1,0,1,1,0,0,99 };
cout << SingleNumberII(vec) << endl;
system(“pause”);
return 0;
}