LeetCode-Number of 1 Bits

Description：
Write a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight).

Example 1:

Input: 11
Output: 3
Explanation: Integer 11 has binary representation 00000000000000000000000000001011 

Example 2:

Input: 128
Output: 1
Explanation: Integer 128 has binary representation 00000000000000000000000010000000

题意：计算一个无符号整数二进制表示中1的数量；

解法：最容易想到的自然就是通过计算其二进制表示来统计1的数量；不过，这里我们可以考虑使用位操作，首先我们每次将整数右移一位后再与1相与，判断结果是否为1即可计算整数二进制表示特定位上是否为1；

Java

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        int result = 0;
        for (int i = 0; i < 32; i++) {
            result = ((n >> i) & 0x01) == 1 ? result + 1 : result; 
        }
        return result;
    }
}