方法一:这种方法只适合当a正整数,当为负数时则没办法正常运行
int connt_bit_one( int n)//这种方法只适合当a正整数,当a为负数时则没办法正常运行;
//{
int count = 0;
while (n)
{
if (n % 2 == 1)
{
count++;
}
n = n / 2;
}
return count;
}
int main()
{
int a = 0;
scanf("%d", &a);
int count = connt_bit_one(a);
printf("%d\n", count);
return 0;
}
改进:
int connt_bit_one(unsigned int n)//
//{//这样修改以后则可以对负数进行
int count = 0;
while (n)
{
if (n % 2 == 1)
{
count++;
}
n = n / 2;
}
return count;
}
int main()
{
int a = 0;
scanf("%d", &a);
int count = connt_bit_one(a);
printf("%d\n", count);
return 0;
}
方法三:把每一位移到最低位,然后按位于(循环三十二次)
int count_bit_one(int n)
{
int count = 0;
int i = 0;
for (i = 0; i < 32; i++)
{
if ((n >> i) & 1 == 1);
count++;
}
return count;
}
int main()
{
int a = 0;
scanf("%d", &a);
int count = count_bit_one(a);
printf("count=%d", count);
return 0;
}
方法四:(有几个一循环几次)
/*n= n&(n-1)
* n
* 13
* 1101 n
* 1100 n-1
* 1100 n
* 1011 n-1
* 1000 n
* 0111 n-1
* 0000 n
*/
int count_bit_one(int n)
{
int count = 0;
while (n)
{
n = n & (n - 1);
count++;
}
return count;
}
int main()
{
int a = 0;
scanf("%d", &a);
int count = count_bit_one(a);
printf("%d", count);
return 0;
}