【LeetCode】191. Number of 1 Bits
2015-03-21 11:57
369 查看
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
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
思路:n&(n-1)消除一个最低位的1
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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
思路:n&(n-1)消除一个最低位的1
class Solution { public: int hammingWeight(uint32_t n) { int count = 0; while(n) { n &= (n-1); count ++; } return count; } };
相关文章推荐
- 191. Number of 1 Bits--LeetCode Record
- 【一天一道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(hamming weight)
- LeetCode笔记:191. 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
- [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(easy)
- LeetCode 191. Number of 1 Bits