LeetCode 191. Number of 1 Bits
原创LeetCode 191. Number of 1 Bits
原创
大学里的混子
修改于 2018-11-06 11:31:53
修改于 2018-11-06 11:31:53
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).
Example 1:
Input: 11
Output: 3
Explanation: Integer 11 has binary representation 00000000000000000000000000001011 Example 2:
Input: 128
Output: 1
Explanation: Integer 128 has binary representation 00000000000000000000000010000000题目大意：求一个数的二进制中的1的个数
解法：
// you need to treat n as an unsigned value
public int hammingWeight(int n) {
int count = 0 ;
while(n!=0){
count ++;
n = n&(n-1);
}
return count;
}原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。
如有侵权，请联系 cloudcommunity@tencent.com 删除。
原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。
如有侵权，请联系 cloudcommunity@tencent.com 删除。
评论
登录后参与评论
推荐阅读
目录