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

Note:

• Note that in some languages such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned.
• In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example 3 above, the input represents the signed integer. -3.

Follow up: If this function is called many times, how would you optimize it?

 

Example 1:

Input: n = 00000000000000000000000000001011
Output: 3
Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.

Example 2:

Input: n = 00000000000000000000000010000000
Output: 1
Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.

Example 3:

Input: n = 11111111111111111111111111111101
Output: 31
Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.

 

Constraints:

• The input must be a binary string of length 32

 

 

 

 

 

思路：

找出32位的二进制中有多少个1。其实直接用除以2也行，用移位也行。用一个int count来记录答案，当给定n大于0时，如果当前n和1等于1则说明目前最尾的一位是1，可以count++，然后n每次往右移一位即可。因为每个数只有32位长，因此每次都是时间复杂度。

 

 

 

 

代码：

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int count=0;
        while(n)
        {
            count+=n&1;
            n=n>>1;
        }
        return count;
    }
};