191. Number of 1 Bits
来源:互联网 发布:java的可变参数 编辑:程序博客网 时间:2024/05/22 12:28
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.
public class Solution { // you need to treat n as an unsigned value public int hammingWeight(int n) { int count = 0; while (n != 0) { count += n & 1; n = n >>> 1; } return count; }}
这里注意,在java里,>>是数学右移,最该为的补位会跟符号位相同,那么如果是2147483648,它代表 -2147483648,100000000,永远也得不到0。而>>>是逻辑右移,不关心符号位,永远用0补位,这是我们这道题需要的。另一种思路是 n = n & (n - 1),直到n = 0为止。可以不用管标识位,代码如下:
int hammingWeight(uint32_t n) { int count = 0; while (n) { n &= (n - 1); count++; } return count;}
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
- wikioi1063 合并果子
- Linux定时任务crontab
- 蓝桥杯 按从小到大输出长度为5的二进制串
- Class.forName new 和newInstance
- java: Random 随机数组
- 191. Number of 1 Bits
- nodejs开发微博网站(二)--mongoDB数据库
- 3D游戏引擎系列二
- [5]Linux时间编程
- 捕捉Java的异常Stacktrace
- Frogger
- 关于HTTPS一篇文章就够了
- 洛谷 1226_取余运算||快速幂_快速幂
- Mac 安装opencv(for java)