LeetCode (11) Number of 1 Bits
来源:互联网 发布:精准扶贫平台 网络 编辑:程序博客网 时间:2024/06/15 23:20
题目描述
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.
本题要求统计一个int型数字二进制表示时1的个数。可以通过对数字重复进行右移操作,统计最右边一位为1的个数。注意这里的数字类型为unsigned int,否则还需要考虑符号位为1的情况。右移操作的特性:各二进位全部右移若干位,对无符号数,高位补0,有符号数,各编译器处理方法不一样,有的补符号位(算术右移),有的补0(逻辑右移)
解决代码
class Solution {public: int hammingWeight(uint32_t n) { int count = 0; while(n) { if (n & 1) count++; n = n >> 1; } return count; }};
0 0
- LeetCode (11) Number of 1 Bits
- leetcode(11), Number of 1 Bits(python)
- leetcode:bits:Number of 1 Bits(191)
- LeetCode:Number of 1 Bits
- LeetCode-Number of 1 Bits
- leetcode: Number of 1 Bits
- LeetCode Number of 1 Bits
- Leetcode: Number of 1 Bits
- Leetcode--Number of 1 Bits
- [LeetCode] Number of 1 Bits
- [leetcode]Number of 1 Bits
- Leetcode-Number of 1 Bits
- LeetCode Number of 1 Bits
- LeetCode-Number of 1 Bits
- [Leetcode] Number of 1 Bits
- [Leetcode]Number of 1 Bits
- leetcode--Number of 1 Bits
- leetcode:Number of 1 Bits
- VC控件大小和字体设置
- Latex中一些细节
- HDU 5206 Four Inages Strategy
- 深入理解计算机--字节顺序
- Android中Context
- LeetCode (11) Number of 1 Bits
- Four Inages Strategy hdu 5206
- Leapin' Lizards (hdu 2732 最大流)
- poj1001
- aidl学习
- C语言mmap()函数:建立内存映射
- 求矩阵的局部极大值
- JUNHUANGSHIJIA
- HDFS追本溯源:HDFS操作的逻辑流程与源码解析 【SNN对fsimage和editslog文件的合并流程-------很重要】