Number of 1s

最新推荐文章于 2020-12-30 15:08:20 发布

taoqick

最新推荐文章于 2020-12-30 15:08:20 发布

阅读量824

点赞数

分类专栏：算法 careercup c++

算法同时被 3 个专栏收录

474 篇文章 6 订阅

订阅专栏

c++

265 篇文章 1 订阅

订阅专栏

careercup

86 篇文章 0 订阅

订阅专栏

Count the number of set bits for an 32 bits integer. How to improve the process for the second time use if the memory is unlimited?

-------------------------------------------

Tricky Solution:

uint bit_count(uint value)
{
	printf("0x%08X has ", value, value);
    value = (value & 0x55555555) + ((value & 0xaaaaaaaa) >> 1);
    value = (value & 0x33333333) + ((value & 0xcccccccc) >> 2);
    value = (value & 0x0F0F0F0F) + ((value & 0xF0F0F0F0) >> 4);
    value = (value & 0x00FF00FF) + ((value & 0xFF00FF00) >> 8);
    value = (value & 0x0000FFFF) + ((value & 0xFFFF0000) >> 16);
    printf("%d bits set.\n", value);
    return value;
}

General solution:

int count=0; 
while(n>0){ 
  //n-1 will set the right most set bit to zero. AND with the same number will sustain the remaining bits 
  n&=n-1; 
  count++; 
}