leetcode 191. Number of 1 Bits 求二进制1的个数 ---------- java

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.

求一个无符号int的二进制中的1的个数。

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++){
            if ((n & 1) == 1){
                result++;
            }
            n >>= 1;
        }
        return result;
    }
}