第一种方法,使用普通循环:
unsigned int GetBitNum1(unsigned int nValue) { const unsigned int nNumOfBitInByte = 8; unsigned int tempMask = 1; unsigned int n = 0; for(unsigned int i = 0 ; i < sizeof(nValue) * nNumOfBitInByte ; i++) { (0 < (nValue & tempMask)) ? n++ : 0; tempMask<<=1; } return n; }
或者
unsigned int GetBitNum2(unsigned int nValue) { const unsigned int nNumOfBitInByte = 8; unsigned int tempMask = 1; unsigned int n = 0; for(unsigned int i = 0 ; i < sizeof(nValue) * nNumOfBitInByte ; i++) { (0 < (nValue & tempMask)) ? n++ : 0; nValue>>=1; } return n; }
第二种方法,使用优化的循环统计:
unsigned int GetBitNum3(unsigned int nValue) { unsigned int n = 0; while(0 < nValue) {//这句代码是把nValue 的某位(其实具体点说为从低位算起的第一个值为1 //的位)及其以后的所有位都变成0 nValue &=(nValue - 1); n++; } return n; }
第三种方法,我一直都想不到...参考别人的:
unsigned int GetBitNum4(unsigned int nValue) { nValue = ((0xaaaaaaaa & nValue)>>1) + (0x55555555 & nValue); nValue = ((0xcccccccc & nValue)>>2) + (0x33333333 & nValue); nValue = ((0xf0f0f0f0 & nValue)>>4) + (0x0f0f0f0f & nValue); nValue = ((0xff00ff00 & nValue)>>8) + (0x00ff00ff & nValue); nValue = ((0xffff0000 & nValue)>>16) + (0x0000ffff & nValue); return nValue; }
参考资料:http://www.cppblog.com/OnTheWay2008/archive/2010/03/29/110467.html