191-位为1的个数

Description

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.

---

问题描述

计算无符号整数的汉明权重(位为1的个数)

---

问题分析

直接使用Integer.bitCount()
也可以迭代处理, 每次截取最低位

---

解法

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        return Integer.bitCount(n);
    }
}