191-number of 1 bits-字符串相关
来源:互联网 发布:人工智能权威杂志 编辑:程序博客网 时间:2024/05/01 16:45
【题目】
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.
【解析】
参考文章:
http://www.cnblogs.com/graphics/archive/2010/06/21/1752421.html
http://jinguo.iteye.com/blog/540150
简单题,考查int类型数转换成二进制后含有几个1,用到经典的位移运算。【代码】
public class Solution {
// you need to treat n as an unsigned value
public int hammingWeight(int n) {
if(n==0) return 0;
int i=0;
while(n!=0){
n=n & (n-1);
i++;
}
return i;
}
}
0 0
- 191-number of 1 bits-字符串相关
- leetcode:bits:Number of 1 Bits(191)
- 191Number of 1 Bits
- 191 Number of 1 Bits
- 191 Number of 1 Bits
- 191Number of 1 Bits
- #191 Number of 1 Bits
- 191 Number of 1 Bits
- 191Number of 1 Bits
- [191]Number of 1 Bits
- 191 Number of 1 Bits
- 191Number of 1 Bits
- Number of 1 Bits---191
- [191] Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- 《算法导论》3、合并排序实现(C++)
- 数据库 - 数据依赖的公理系统
- OV7620摄像头使用
- 我在安装虚拟机和Hadoop过程中遇到的问题和解决方法
- Windows HOOK API (二)
- 191-number of 1 bits-字符串相关
- final关键字
- How long does it take to make a context switch?
- 字符串比较器
- C#特性(Attribute)之预定义特性(Conditional)
- 编程之美初赛第二场 攻城略地(贪心,图论)
- HDU-3749(点双连通分量-并查集)
- 和lastTime相比是否已过去一个小时
- 正则表达式 学习笔记