攒点人品,昨天和MS SVC的一个面试题# JobHunting - 待字闺中
i*s
1 楼
Counting set bits in a number.
First version:
int CountSetBits(int num)
{
for(int count=0; num; num >>= 1)
{
if (num & 1)
count++;
}
return count;
}
Optimized version:
int CountBits(int num)
{
for(int count =0; num; count++)
{
num &= num -1;
}
return count;
}
First version:
int CountSetBits(int num)
{
for(int count=0; num; num >>= 1)
{
if (num & 1)
count++;
}
return count;
}
Optimized version:
int CountBits(int num)
{
for(int count =0; num; count++)
{
num &= num -1;
}
return count;
}