LeetCode – Number of 1 Bits (Java)

Problem Write a function that takes an unsigned integer and returns the number of ’1′ bits it has (also known as the Hamming weight). For example, the 32-bit integer ’11′ has binary representation 00000000000000000000000000001011, so the function should return 3. Java Solution public int hammingWeight(int n) { int count = 0; for(int i=1; i<33; i++){ … Read more