求无符号整型二进制数1个数的优化程序

sunshine552

于 2015-04-11 20:35:22 发布

阅读量408

点赞数

本文链接：https://blog.csdn.net/sunshine552/article/details/44998737

版权

<span style="font-size:24px;">#include <stdio.h>
int count_bit(unsigned int value)
{
	int count=0;        //15->1111    1111 & 1110 = 1110
	while(value)			//1110 & 1101 = 1100
	{			<span style="white-space:pre">	</span>//1100 & 1001 = 1000
		count++;		//1000 & 0111 = 0000
		value=value & (value-1);
	}
	return count;
}
int main()
{
	int ret=0;
	ret=count_bit(15);
	printf("%d\n",ret);
	return 0;
}</span>