class Solution {
public:
int singleNumber(vector<int>& nums) {
int ans = 0;
for (int i = 0; i < 32; i++) {
int total = 0;
for (auto num : nums) {
total += (num >> i) & 1;
}
if (total % 3 == 1) {
ans |= (1 << i);
}
}
return ans;
}
};
【位运算】【数组】leetcode.137.只出现一次的数字 II
最新推荐文章于 2024-09-20 10:26:17 发布