编写代码实现，一个整数存储在内存中二进制中1的个数

方法一：先右移，再&1

//方法一:先右移,再按位与1
#include <stdio.h>
int count_one(int num)
{
	int count = 0;
	int i = 0;
	for (i = 0; i < 32; i++)
	{
		if (1 == (num >> i) & 1)
		{
			count++;
		}
	}
	return count;
}

int main()
{
	int num = 0;
	scanf("%d", &num);
	int ret = count_one(num);
	printf("result=%d\n", ret);

	return 0;
}

方法二：先%2，再/2.

//方法二：先%2，再/2.
#include <stdio.h>
int count_one(unsigned int n)
{
	int count = 0;
	while (n)
	{
		if (1 == n % 2) //判断该位是否是1
		{
			count++;
		}
		n /= 2;  //将该位的1去掉
	  //11---- 00000000000000000000000000001011
	}
	return count;
}

int main()
{
	int num = 0;
	scanf("%d", &num);
	int ret = count_one(num);
	printf("%d", ret);

	return 0;
}

方法三：n=n&(n-1)

//方法3：n&（n-1）法 (比前两种方法更为高效，只关注二进制位中的1)
//思路：n=n&(n-1);n=13;
//1101-n
//1100-(n-1)
//1100-n
//1011-(n-1)
//1000-n
//0111-(n-1)
//0000-n

#include <stdio.h>
int count_one(int n)
{
	int count = 0;
	while (n)
	{
		n = n & (n-1); //每按位与 1次，就相当于去掉n的二进制位中最右面的1.
		count++;
	}
	return count;
}

int main()
{
    int num = 0;
	scanf("%d",&num);
	int ret = count_one(num);
	printf("%d",ret);

	return 0;
}