首页 > 其他 > 详细

Number of 1 Bits

时间:2015-06-03 23:11:58      阅读:350      评论: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.
 */public class Numberof1Bits {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        System.out.println(hammingWeight(11));
    }

    public static int hammingWeight(int n) {
        String str = Integer.toBinaryString(n);
        char[] ch = str.toCharArray();
        int count = 0;
        for (int i = 0; i < ch.length; i++) {
            if (ch[i] == 49)
                count++;
        }

        return count;
    }
}

 

Number of 1 Bits

原文:http://www.cnblogs.com/kydnn/p/4550432.html

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