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进制数字，要求返回其二进制表示法1的个数，看到这个，脚本语言不是切菜一样么，直接python一行
class Solution:
# @param n, an integer
# @return an integer
def hammingWeight(self, n):
return bin(n).count('1')
试探性地提交下，检查了很久很久
600 / 600 test cases passed. Status: Accepted Runtime: 45 ms
一共有600个test case难怪这么慢，最终还是通过了~！
