码迷,mamicode.com
首页 > 其他好文 > 详细

Number of 1 Bits

时间:2015-12-16 21:27:08      阅读:96      评论:0      收藏:0      [点我收藏+]

标签:

Number of 1 Bits

Total Accepted: 64907 Total Submissions: 171590 Difficulty: Easy

 

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.

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int cnt = 0;
        while(n){
            cnt++;
            n=n&(n-1);
        }
        return cnt;
    }
};

 

Number of 1 Bits

标签:

原文地址:http://www.cnblogs.com/zengzy/p/5052293.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!