The expression n & (n - 1) turns off the lowest set bit. Count how many times you can do this before n reaches zero.

Number of 1 Bits

easy

Acceptance: 62%

Bit Manipulation

Given the binary form of a positive integer, count how many bits are set to 1. This is sometimes called the Hamming weight of the number.

Example 1:

Input:n = 7 (111)

Output:3

Example 2:

Input:n = 16 (10000)

Output:1

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}