我正在寻找计算一个位转换次数的最快方法unsigned int.
unsigned int
如果int包含: 0b00000000000000000000000000001010
0b00000000000000000000000000001010
转换次数为:4
如果int包含: 0b00000000000000000000000000001001
0b00000000000000000000000000001001
转换次数为:3
语言是C.
c counting bit
bit ×1
c ×1
counting ×1