191. Number of 1 Bits *
来源:互联网 发布:龙王传说实体书淘宝 编辑:程序博客网 时间:2024/04/29 23:40
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(object): def hammingWeight(self, n): """ :type n: int :rtype: int """ result = 0 while n>0: result +=n%2 n/=2 return result
Modified:
Reference
class Solution(object): def hammingWeight(self, n): """ :type n: int :rtype: int """ result = 0 while n>0: result +=n &1 n = n>>1 return result
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
- css3 盒子类型
- Python |绝不乱入的靠谱书单
- Servlet API中的八种监听器接口
- ios 抛物线添加到购物车
- 树状数组( 单点修改/区间修改+区间求和+一维/二维)
- 191. Number of 1 Bits *
- Memcached 之 .NET(C#)实例分析
- 在Ubuntu14.04中安装Docker
- Hadoop伪分布式环境搭建
- <设计模式12>组合模式
- Java 两个变量的值互相交换
- 设置Android软键盘的默认不弹出
- git与svn的区别,你分清楚了吗
- 12 获取外部存储卡大小