面试题:以最快的速度计算一个字节（byte）里有多少bit被置1

 

算法一

int count_ones(unsigned a) {     int count = 0;     for (; a; a >>= 1) {         if (a & 1) count ++;     }     return count; }

算法二

int count_ones(unsigned a) {     int count = 0;     for (; a; count ++) {         a &= a - 1;     }     return count; }

算法三

int count_ones(unsigned a) {     a = (a & 0x55555555) + ((a >> 1) & 0x55555555);     a = (a & 0x33333333) + ((a >> 2) & 0x33333333);     a = (a & 0x0f0f0f0f) + ((a >> 4) & 0x0f0f0f0f);     a = (a & 0x00ff00ff) + ((a >> 8) & 0x00ff00ff);     a = (a & 0x0000ffff) + ((a >> 16) & 0x0000ffff);     return a; }

算法四

const int ones[] = {0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2,\  3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4,\  3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2,\  3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5,\  5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5,\  6, 4, 5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,\  2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3,\  4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 2, 3,\  3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5,\  6, 5, 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 5, 5, 6,\  5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8}; int count_ones(unsigned a) {     return (ones[a & 0xff] + ones[(a >> 8) & 0xff] + ones[(a >> 16) & 0xff]\         + ones[(a >> 24) & 0xff]); }

 

分析算法二：

一个32位的数减1相当于把从后数第一个1及之后的数取反，然后与原数相与就把这些去反以后的位清0了，等到所有的位都被清0，就会跳出循环。这种算法的效率跟1的个数有关，有多少1就循环多少次。老牛了。