分析
难度 易
来源
https://leetcode.com/problems/number-of-1-bits/
题目
Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).
Example 1:
- Input: 11
- Output: 3
- Explanation: Integer 11 has binary representation 00000000000000000000000000001011
Example 2:
- Input: 128
- Output: 1
- Explanation: Integer 128 has binary representation 00000000000000000000000010000000
- 解答
- 1 package LeetCode;
- 2
- 3 public class L191_NumberOf1Bits {
- 4 public int hammingWeight(int n) {
- 5 int result=0;
- 6 for(int i=0;i<32;i++){
- 7 if (1==(n&1))
- 8 result++;
- 9 n>>>=1;
- 10 }
- 11 return result;
- 12 }
- 13 public static void main(String[] args){
- 14 L191_NumberOf1Bits l191=new L191_NumberOf1Bits();
- 15 int n=11;
- 16 System.out.println(l191.hammingWeight(n));
- 17 }
- 18 }
-
经验首页