-------------------------------------
int func(int x)
{
int countx = 0;
while(x)
{
countx++;
x = x&(x-1);
}
return countx;
}
假定x = 9999
10011100001111
答案: 8
注: 每执行一次x = x&(x-1),会将x用二进制表示时最右边的一个1变为0,因为x-1将会将该位(x用二进制表示时最右边的一个1)变为0
过程如下:
(x)10011100001111&(x-1)10011100001110=10011100001110;
(x)10011100001110&(x-1)10011100001101=10011100001100;
(x)10011100001100&(x-1)10011100001011=10011100001000;
判断一个数(x)是否是2的n次方
-------------------------------------
#include <stdio.h>
int func(int x)
{
if( (x&(x-1)) == 0 )
return 1;
else
return 0;
}
int main()
{
int x = 8;
printf("%d\n", func(x));
}
注:
(1) 如果一个数是2的n次方,那么这个数用二进制表示时其最高位为1,其余位为0,如00000001(1),00000010(2),00000100(4),00001000(8),00010000(16)等等
所以有00000001&00000000==0,00000010&00000001==0,00000100&00000011==0,00001000&00000111==0
(2) == 优先级高于 &