class Solution {
public:
int hammingWeight(uint32_t n) {
int count=0;
for(int i=0;i<32;i++){
if(n%2){
count++;
}
n/=2;
}
return count;
}
};
LeetCode - 191 Number of 1 Bits
最新推荐文章于 2023-07-08 03:04:01 发布