LeetCode Number of 1 Bits

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.

Special thanks to @ts for adding this problem and creating all test cases.




class Solution {
    int hammingWeight(uint32_t n) {
        int res = 0;
		while (n)
			if (n & 1) res++;
			n >>= 1;
		return res;

2 thoughts on “LeetCode Number of 1 Bits

  1. Pingback: LeetCode | nce3xin_code

  2. Pingback: LeetCode Reverse Bits | nce3xin_code

Leave a Reply

Your email address will not be published. Required fields are marked *