(LeetCode) 191. Number of 1 Bits
来源:互联网 发布:社交网络 百度云盘 编辑:程序博客网 时间:2024/06/13 05:43
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).
For example, the 32-bit integer ’11’ has binary representation 00000000000000000000000000001011
, so the function should return 3.
191. 二进制中1的个数
返回一个无符号数的二进制中1的个数。
比如:32位的正数11
的二进制为00000000000000000000000000001011
, 所以应该返回3
.
思路
x-1 & x
这样的操作能够去掉最低位的1。连续做这样的操作,直到x为0,即可统计出1的个数。
代码
class Solution {public: int hammingWeight(uint32_t n) { int count = 0; while(n){ n &= n-1; count ++; } return count; }};
0 0
- 191. Number of 1 Bits Leetcode Python
- 【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 OJ> 191. Number of 1 Bits
- Leetcode 191. Number of 1 Bits
- leetCode 191. Number of 1 Bits
- 191. Number of 1 Bits LeetCode
- Leetcode: 191. Number of 1 Bits(JAVA)
- 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
- 《第一行代码》Android 学习笔记
- [BFS]poj 2251 Dungeon Master
- 基于UDP的select函数用法
- (LeetCode) 268. Missing Number
- 九度OJ-题目1174:查找第K小数-10网研上机B
- (LeetCode) 191. Number of 1 Bits
- L1-031. 到底是不是太胖了
- 博客
- Listener
- 170320 汇编-第四章-程序结构、debug跟踪,qt图片适应
- EventBus3的使用实战(一)
- 读书-元曲-《山坡羊-道情》
- 系统引导时为什么要关闭Catchs?
- java 重定向 和 转发