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

For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.

题目链接：https://leetcode.com/problems/number-of-1-bits/

题目分析：右移与1

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