Leetcode record 191. Number of 1 Bits

public class Solution {
    //your need to treat n as a unsigned value public
    int hammingweight (int n) {
        int coun t=0;
        while (n!=0) {
            if ((n&1) ==1)
                count++;
            n>>>=1;
        }
        return count;
    }
}

The use of >>> instead of >>,>>> is an unsigned right shift, ignoring the sign bit.

Possible error: did not give n&1 braces, reported bad operand types for binary operator ' & ' ERROR

mainly because = = = = Priority is greater than & cause

Or:

return Integer.bitcount (n);

Or:

Need to treat n as a unsigned value public
    int hammingweight (int n) {
        int count = 0;
        while (n!=0) {
            n&= n-1;
            count++;
        }
        return count;
    

To subtract 1 from an integer, and then to do the same with the original integer, will turn the integer rightmost 1 into 0, then how many times the binary representation of an integer number 1, you can do this operation.