Number of 1 Bits
来源:互联网 发布:微信电子书制作软件 编辑:程序博客网 时间:2024/06/16 10:13
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 count=0; while(n){ count+=(n%2); n/=2; } return count; }};
0 0
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- 选择排序C++实现
- mtk6735启动流程
- 机器学习之入门Numpy
- 注意版本变化导致的判断方法失效
- Ngnix做静态文件缓存的实验
- Number of 1 Bits
- Linux内核模块间函数调用正确方法
- 第三章第二十一题
- Samung LCD接口原理
- 素数
- 批处理中for调用call而不是goto
- 编写基于XML的配置元数据
- JPEG压缩学习笔记
- WebService学习笔记系列(三)