[LeetCode]191. Number of 1 Bits
题目描述
思路
位操作,之前做过类似的
代码
class Solution {
public:
int hammingWeight(uint32_t n) {
int res = 0;
while (n){
res++;
n &= n - 1;
}
return res;
}
};
位操作,之前做过类似的
class Solution {
public:
int hammingWeight(uint32_t n) {
int res = 0;
while (n){
res++;
n &= n - 1;
}
return res;
}
};