int count_bit_one(int n)
{
int b = 0;
while (n)
{
n = n & (n - 1);
b++;
}
return b;
}
int main()
{
int a = 0;
scanf("%d",&a);//二进制中含有几个1(补码)
int count = count_bit_one(a);
printf("count = %d\n", count);
return 0;
}
按位与,谷歌面试题数字找2进制中的1
最新推荐文章于 2024-10-12 22:54:21 发布