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.

python:

class Solution(object):
def hammingWeight(self, n):
    """
    :type n: int
    :rtype: int
    """
    bin_n = bin(n)
    list_n = list(bin_n)
    count = 0
    for i in range(len(list_n)):
        if list_n[i] == '1':
            count += 1
    return count

提示超时的代码：

        count = 0
    while n:
        if n & 1:     #判断最后一位二进制数是否为1
            count += 1
        n >> 1        #右移一位
    return count