NumberOfOneInBinary

最新推荐文章于 2023-10-29 06:15:11 发布

踏雪留印

最新推荐文章于 2023-10-29 06:15:11 发布

阅读量241

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/u014558484/article/details/52180128

版权

剑指offer 专栏收录该内容

30 篇文章 1 订阅

订阅专栏

//计算整数中二进制1的个数(采用位运算)
#include<stdio.h>
//向左进行移位
int NumberOfOneInBinary(int n){
	unsigned int flag=1;
	int count=0;
	while(flag){
		if(n&flag) count++;
		flag=flag<<1;
	}
	return count;
}
//
int NumberOfOneInBinary_1(int n){
	int count=0;
	while(n){
		count++;
		n=(n-1)&n;
	}
	return count;
}
void main(){
	printf("%3d\n",NumberOfOneInBinary(0));
	printf("%3d\n",NumberOfOneInBinary_1(0));
	printf("%3d\n",NumberOfOneInBinary(1));
	printf("%3d\n",NumberOfOneInBinary_1(1));
	printf("%3d\n",NumberOfOneInBinary(0x7FFFFFFF));
	printf("%3d\n",NumberOfOneInBinary_1(0x7FFFFFFF));
	printf("%3d\n",NumberOfOneInBinary(0xFFFFFFFF));
	printf("%3d\n",NumberOfOneInBinary_1(0xFFFFFFFF));
	printf("%3d\n",NumberOfOneInBinary(0x80000000));
	printf("%3d\n",NumberOfOneInBinary_1(0x80000000));
}