LeetCode:191. Number of 1 Bits
2017-03-29 18:58
260 查看
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
so the function should return 3.
AC:
class Solution {
public:
int hammingWeight(uint32_t n) {
int res=0;
while(n!=0)
{
res+=n&1;
n=n>>1;
}
return res;
}
};
weight).
For example, the 32-bit integer ’11' has binary representation
00000000000000000000000000001011,
so the function should return 3.
AC:
class Solution {
public:
int hammingWeight(uint32_t n) {
int res=0;
while(n!=0)
{
res+=n&1;
n=n>>1;
}
return res;
}
};
相关文章推荐
- Leetcode 191. Number of 1 Bits (Easy) (cpp)
- 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]problem 191. Number of 1 Bits
- [LeetCode]191. Number of 1 Bits
- 【一天一道LeetCode】#191. Number of 1 Bits
- [LeetCode] 191. Number of 1 Bits 二进制数1的个数
- Leetcode 191. Number of 1 Bits
- 191. Number of 1 Bits--LeetCode Record
- 【一天一道LeetCode】#191. Number of 1 Bits
- Leetcode ☞ 191. Number of 1 Bits(hamming weight)
- [勇者闯LeetCode] 191. Number of 1 Bits
- LeetCode笔记:191. Number of 1 Bits
- 【leetcode】191. Number of 1 Bits(easy)
- LeetCode 191. Number of 1 Bits
- Leetcode 191. Number of 1 Bits
- 【LeetCode】191. Number of 1 Bits