Simple Java Solution without shift!


  • 1
    S
    public int hammingWeight(int n) {
            int count = 0;
            while ( n != 0 ) {
                n = n & n-1;
                count++;
            }
            return count;
        }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.