LeetCode之191 Number of 1 Bits 别名:数1
2017-02-04 11:58
302 查看
题很简单,原题如下:
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
依然是按位与
代码如下:
class Solution {
public:
int hammingWeight(uint32_t n) {
int ans=0;
while(n>0)
{
n=n&(n-1);
ans++;
}
return ans;
}
};
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.
依然是按位与
代码如下:
class Solution {
public:
int hammingWeight(uint32_t n) {
int ans=0;
while(n>0)
{
n=n&(n-1);
ans++;
}
return ans;
}
};
相关文章推荐
- LeetCode 191: Number of 1 Bits
- leetcode——191——Number of 1 Bits
- leetcode:191 Number of 1 Bits-每日编程第十三题
- leetcode 191: Number of 1 Bits
- [LeetCode 191] Number of 1 Bits
- leetcode 191 Number of 1 Bits(位运算)
- leetcode[191]:Number of 1 Bits
- LeetCode191——Number of 1 Bits
- leetcode 191 Number of 1 Bits
- LeetCode 191 number of 1 bits
- LeetCode 191:Number of 1 Bits
- LeetCode 191 Number of 1 Bits
- 【LeetCode】190 & 191 - Reverse Bits & Number of 1 Bits
- leetcode-191 Number of 1 Bits 二进制数字中1的个数
- LeetCode 191 Number of 1 Bits
- Leetcode_191_Number of 1 Bits
- Leetcode_191_Number of 1 Bits
- 【LeetCode-191】 Number of 1 Bits(C++)
- leetcode-191-Number of 1 Bits
- LeetCode 第 191 题 (Number of 1 Bits)