Leetcode - Number of 1 Bits

https://leetcode.com/problems/number-of-1-bits/

Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight).

Example 1:

Input: 00000000000000000000000000001011
Output: 3
Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.

func hammingWeight(num uint32) int {
    if num == 0 {
        return 0
    }
    count := 0
    for num != 0 {
        num &= num - 1
        count++
    }
    return count
}

• 相关文章
• 全局相关文章