LeetCode(191):Number of 1 Bits
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode(191):Number of 1 Bits相关的知识,希望对你有一定的参考价值。
Number of i Bits: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.
题意:求出一个整数2进制表示时1的个数。
思路:位操作,一位一位右移,然后判断最后一位是否为1。
代码:
public class Solution { // you need to treat n as an unsigned value public int hammingWeight(int n) { int count = 0; while(n!=0){ count+=n&1; n>>>=1; } return count; } }
以上是关于LeetCode(191):Number of 1 Bits的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 191. Number of 1 Bits
leetcode 191. Number of 1 Bits
191. Number of 1 Bits(LeetCode)