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

191. Number of 1 Bits

时间:2016-09-12 10:52:56      阅读:105      评论: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 class Solution {
 2 public:
 3     int hammingWeight(uint32_t n) {
 4         
 5         int count = 0;
 6         
 7         while(n)
 8         {
 9             n = (n & (n-1));
10             count++;
11         }
12         return count;
13     }
14 };

 

191. Number of 1 Bits

标签:

原文地址:http://www.cnblogs.com/sankexin/p/5863929.html

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