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

[leetcode] Number of 1 Bits

时间:2015-03-10 12:02:10      阅读:112      评论:0      收藏:0      [点我收藏+]

标签:

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).

For example, the 32-bit integer ’11‘ has binary representation 00000000000000000000000000001011, so the function should return 3.
 
 
 1 class Solution
 2 {
 3 public:
 4   int hammingWeight(uint32_t n)
 5   {
 6     int count = 0;
 7     while(n > 0)
 8     {
 9       if(n % 2 != 0)
10         count++;
11       n /= 2;
12     }
13 
14     return count;
15   }
16 };

 

[leetcode] Number of 1 Bits

标签:

原文地址:http://www.cnblogs.com/lxd2502/p/4325483.html

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