Leetcode 191. 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的个数。

 1 class Solution {
 2 public:
 3     int hammingWeight(uint32_t n) {
 4         int k;
 5         while(n){
 6             if(n&1)
 7                 k++;
 8             n >>= 1;
 9         }
10         return k;
11     }
12 };

Leetcode 191. Number of 1 Bits

原文：http://www.cnblogs.com/qinduanyinghua/p/5727682.html