Number of 1 in binary (simple difficulty)

Title Overview ( Medium difficulty )

Topic link ：
Point me into the leetcode

Ideas and code

Train of thought display

The idea of this topic is still taken from us K God boss , I won't go into too much detail here
About logical shift right , Move left , If you are not clear about the right shift, you can see this solution ：
Click to enter the solution
Or take a look at my blog ：
Click me to enter the blog
Students who can't do binary subtraction can see this blog ：
Click me to enter the blog

Code example

Code 1：

public class Solution {
    
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
    
       int res = 0;
       while(n != 0) {
    
           res += n&1;
           // Logical shift right 
           n >>>= 1;
       }
       return res;
    }
}

Code 2：

public class Solution {
    
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
    
       int res = 0;
       while(n != 0) {
    
           n &= (n-1);
           res++;
       }
       return res;
    }
}