LeetCode 191 - Number of 1 Bits - 题解/Solution

https://leetcode.com/problems/number-of-1-bits/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/**
* 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.
*
* @author dongyuxi
*
*/
public class Solution {
// you need to treat n as an unsigned value
public int hammingWeight(int n) {
int weight = 0;
while (0 != n) {
n = n & (n - 1);
weight++;
}
return weight;
}
}


支付宝 微信
文章目录