首页 > 其他 > 详细

Leetcode: Number of 1 Bits

时间:2015-03-14 06:10:50      阅读:143      评论:0      收藏:0      [点我收藏+]
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.

注意两点:1. 我用的 rightshift 是>>>, 是unsigned right shift

2. & 的优先级不如 ==, 所以要把&的两个参数括起来

 1 public class Solution {
 2     // you need to treat n as an unsigned value
 3     public int hammingWeight(int n) {
 4         int count = 0;
 5         for (int i=0; i<32; i++) {
 6             if ((n>>>i & 1) == 1) count++;
 7         }
 8         return count;
 9     }
10 }

 

Leetcode: Number of 1 Bits

原文:http://www.cnblogs.com/EdwardLiu/p/4336965.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!