題目
![](https://img.laitimes.com/img/__Qf2AjLwojIjJCLyojI0JCLiAzNfRHLGZkRGZkRfJ3bs92YsYTMfVmepNHLxUkeOVTVU9ENNpHW4Z0MMBjVtJWd0ckW65UbM5WOHJWa5kHT20ESjBjUIF2X0hXZ0xCMx81dvRWYoNHLrdEZwZ1Rh5WNXp1bwNjW1ZUba9VZwlHdssmch1mclRXY39CXldWYtlWPzNXZj9mcw1ycz9WL49zZuBnL3kjMxATMykTMwMDNwkTMwIzLc52YucWbp5GZzNmLn9Gbi1yZtl2Lc9CX6MHc0RHaiojIsJye.png)
代碼部分(4ms 45.91%)
public class Solution {
public int hammingWeight(int n) {
int res = 0;
while(n != 0){
n = n & (n - 1);
res++;
}
return res;
}
}
public class Solution {
public int hammingWeight(int n) {
int res = 0;
while(n != 0){
n = n & (n - 1);
res++;
}
return res;
}
}