Write a function that takes an unsigned integer and returns the number of ’1′ bits it has (also known as theHamming weight).
For example, the 32-bit integer ’11′ has binary representation00000000000000000000000000001011, so the function should return 3.
Credits:Special thanks to@tsfor adding this problem and creating all test cases.
This problem can be done in log(n) time, need >> operations..
class Solution:# @param n, an integer# @return an integerdef hammingWeight(self, n):res=0while n>0:res+=n&1n>>=1return res
，自己要先看得起自己，别人才会看得起你
