題目來自leetcode

191. 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.

很簡單。知道10進制轉2進制的方法就行了
python代碼

class Solution:
    # @param n, an integer
    # @return an integer
    def hammingWeight(self, n):
        counter = 0
        while(n != 0):
            if(n % 2 == 1):
                counter += 1
            n = n / 2

        return counter