LeetCode Number of 1 Bits
question:
- Write a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight). For example,the 32-bit integer ’11’ has binary representation00000000000000000000000000001011, so the function should return 3.
Credits: Special thanks to @ts for adding this problem and creating all test cases.
My lower answer:
class Solution {
public:
int hammingWeight(uint32_t n) {
int count=0,remainder=0;
while(n!=0){
if((remainder=n%2)==1)
count +=1;
n=n/2;
}
return count;
}
};
good one:
class Solution {
public:
int hammingWeight(uint32_t n) {
int count;
while(n){
count ++;
n=n&(n-1);
}
return count;
}
};
这是自己刷的第一道题,自我感觉很low,从现在起激励自己看,努力做到最好。这道题目主要是考察二进制的位运算的灵活应用。n=n&(n-1);
是核心程序,需要认真理解。