LeeCode-Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of ’1' bits it has 

For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011,

so the function should return 3.

 

 1 int hammingWeight(uint32_t n)
 2 {
 3     int count=0;
 4     while(n)
 5     {
 6         n=n&(n-1);
 7         count++;
 8     }
 9     return count;
10 }

 

posted @ 2015-07-20 09:11  vpoet  阅读(160)  评论(0)  编辑  收藏  举报