LeetCode191——Number of 1 Bits
来源:互联网 发布:java后端开发面试题 编辑:程序博客网 时间:2024/06/06 14:19
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.
难度系数:
容易
实现
int hammingWeight(uint32_t n) { int count = 0; while (n > 0) { if (n & 0x1) { count++; } n = n >> 1; } return count;}
0 0
- LeetCode191——Number of 1 Bits
- LeetCode191—Number of 1 Bits
- LeetCode191 Number of 1 Bits
- LeetCode191:Number of 1 Bits
- LeetCode191 Number of 1 Bits
- LeetCode191:Number of 1 Bits【Java】
- leetcode191[easy]---Number of 1 Bits
- LeetCode191--Bit Manipulation-- Number of 1 Bits(转换为二进制有几个1)
- leetCode191/201/202/136 -Number of 1 Bits/Bitwise AND of Numbers Range/Happy Number/Single Number
- 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
- 离家的孩子恨爸爸
- JS 操作技巧
- DWR入门(转)
- git
- 解决IOS多线程读写Sqlite问题解决
- LeetCode191——Number of 1 Bits
- 扩展VMware下的centos磁盘
- 怎么深入做用户分析
- 源码包安装后启动失败 error while loading shared libraries: libinotifytools.so.0: cannot open shared object fil
- 物理层与mac层
- 第4章 实现用户页面和文章页面
- 排序算法总结(二)归并法
- ubuntu安装本地nginx.tar.gz文件
- 新的一年