191. Number of 1 Bits
来源:互联网 发布:ios5旧版软件下载 编辑:程序博客网 时间:2024/06/05 18:37
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 cnt = 0; while(n){ n = n & (n - 1); ++cnt; } return cnt; }};
0 0
- 191.Number of 1 Bits
- 191.Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191. Number of 1 Bits
- 191.Number of 1 Bits
- go的mac环境搭建,与简单编译。
- 关于nginx图片防盗链配置实例详解
- umount failed , Device is busy
- 【HTML & CSS & JavaScript】display属性容易搞混
- vue-router: 路由传参
- 191. Number of 1 Bits
- C# 关键字const和readonly对比
- 机器学习
- #include< >和#include""的区别
- mysql 5.6 enable GTID replication
- STL 总结
- 闭包对外暴露接口(2种)
- hdu 2045不容易系列之(3)—— LELE的RPG难题(递推)
- 生成算法和判别算法