【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.

二、问题分析

同样是一道位操作的题目。比较简单。

三、Java AC代码

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