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 representation 00000000000000000000000000001011
, so the function should return 3.
O(n)肯定是不行的。
从尾部开始,每次都直接跳过连续的0,然后把最后一个1改成0,until n==0
public class Solution {
// you need to treat n as an unsigned value
public int hammingWeight(int n) {
if (n == 0) {
return 0;
}
int count = 1;
while ((n & (n - 1)) != 0) {
n &= n-1;
count++;
}
return count;
}
}