题目:https://leetcode.com/problems/number-of-1-bits/
思路:
n = n&(n-1) 可去除最右边的1,直到 n=0
Code:
public int hammingWeight(int n) {
if(n==0) return 0;
int res =0;
while(n != 0){
n &= n-1;
res++;
}
return res;
}
备注: