leetcode之Number of 1 Bits

最新推荐文章于 2016-04-18 20:46:54 发布

原创最新推荐文章于 2016-04-18 20:46:54 发布 · 429 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leetcode 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一个函数，用于计算给定无符号整数的二进制表示中1的数量，即Hamming重量。通过与操作依次递减整数，统计每次与操作后的1数量。

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

主要思想是：利用了与操作依次对数进行递减1，统计每次相与后1的数目。

class Solution {
public:
    int hammingWeight(int n) {
     
		int count=0;;
	//memset(a,0,size(int)*32);
	 while(n)
	{
		n=n&(n-1);
			count++;
		
	}
	return count;

    }

};