"Leetcode" number of 1 Bits

Test instructions

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

For example, the 32-bit integer ' One ' have binary representation 00000000000000000000000000001011, so the function should re Turn 3.

Ideas:

Computes the binary representation of an unsigned 32-bit integer number of 1. As long as you take the last one to determine whether it is 1, then the right to move the operation is good. Complexity O (32).

Code:

C++:

Class Solution {public:    int hammingweight (uint32_t n) {        int ans = 0;        for (int i = 0;i < 32;++i)        {            if (N & 1) ans++;            n = n >> 1;        }        return ans;    };

Python:

Class solution:    # @param N, an integer    # @return A integer    def hammingweight (self, n):        ans = 0        fo R i in range (0,32):            ans = ans + (n&1)            n = n>>1        return ans

"Leetcode" number of 1 Bits