publicclassSolution{// you need to treat n as an unsigned valuepublicinthammingWeight(int n){// n &= n-1,这个操作可以去除二进制数的最后一个1int count =0;while(n !=0){
n &=(n -1);
count++;}return count;}}
题目题源代码public class Solution { // you need to treat n as an unsigned value public int hammingWeight(int n) { // n &= n-1,这个操作可以去除二进制数的最后一个1 int count = 0; while (n != 0) { n &= (n - 1); cou