191. Number of 1 Bits

191. Number of 1 Bits

题目链接

https://leetcode.com/problems/number-of-1-bits/

原文内容

Write a function that takes an unsigned integer and return 
the number of '1' bits it has (also known as the Hamming weight).

Example 1:

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

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

意思是说：编写一个接受无符号整数的函数，并返回它所拥有的“1”位数（也称为汉明权重），有些语言不存在无符号整数类型，在这种情况下，输入将以带符号整数类型给出，不会影响。

算法实现

解决思路：由于是返回整数的二进制里面的“1”的个数，先声明变量count来记录1的个数，并且作为返回值，通过逐位去判断该整数的二进制的每一位是0还是1，用位操作来进行判断，n&1表示取二进制里面的最后一位，0或者1，该数再进行右移1位，如此循环下去，直到该数为0就结束，“>>>”表示无符号数的右移。

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        if(n == 0)return 0;
        int count = 0;
        while(n!=0){
            count+=n&1;
            n = n>>>1;
        }
        return count;
    }
}