LeetCode 191. Number of 1 Bits

分析

难度 易
来源
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

解答

package LeetCode;

public class L191_NumberOf1Bits {
    public int hammingWeight(int n) {
        int result=0;
        for(int i=0;i<32;i++){
            if (1==(n&1))
                result++;
            n>>>=1;
        }
        return result;
    }
    public static void main(String[] args){
        L191_NumberOf1Bits l191=new L191_NumberOf1Bits();
        int n=11;
        System.out.println(l191.hammingWeight(n));
    }
}