LeetCode 191. Number of 1 Bits

发布时间：2020-12-14 04:29:39 所属栏目：大数据来源：网络整理

导读：分析难度易来源 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 Explanati

分析

难度易

来源

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 }

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!