Number of 1 Bits
2015-03-16 22:10
393 查看
Number of 1 Bits
题意:计算一个无符号整形数字的二进制格式下1的个数
思路:在while循环中首先用这个数求余2,如果余数为1,则个数加1,然后 将该数字除以2,判断该数字是否为0,是结束循环,否则继续
题意:计算一个无符号整形数字的二进制格式下1的个数
思路:在while循环中首先用这个数求余2,如果余数为1,则个数加1,然后 将该数字除以2,判断该数字是否为0,是结束循环,否则继续
class Solution: # @param n, an integer # @return an integer def hammingWeight(self, n): res = 0 while n != 0: if n%2 == 1: res = res+1 n = n/2 return res
相关文章推荐
- leetcode-191 Number of 1 Bits 二进制数字中1的个数
- LeetCode 191 Number of 1 Bits
- [leetcode]Number of 1 Bits
- LeetCode(191) Number of 1 Bits
- leetcode--Number of 1 Bits
- number of 1 bits
- Number of 1 Bits
- Number of 1 Bits
- LeetCode:Number of 1 Bits
- LeetCode#191 Number of 1 Bits
- Number of 1 Bits
- LeetCode|Number of 1 Bits-java
- leetcode --Number of 1 Bits
- leetcode - Number of 1 Bits
- leetcode 191 Number of 1 Bits(位运算)
- leetCode之旅(14)-Number of 1 Bits
- 【LeetCode-191】 Number of 1 Bits(C++)
- Number of 1 Bits(二进制中1的个数)
- leetcode 191 Number of 1 Bits
- Number of 1 Bits