題目

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.

Credits: Special thanks to @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question.

思路

n&(n-1)會把n最后的一個bit為1的改成0，循環遍歷計算bit 1的個數

代碼