【算法】求二进制中1的个数

//除法int Count(int src){    int nNum = 0;    while (src)    {        if (src % 2 == 1)        {            nNum++;        }        src /= 2;    }    return nNum;}//右移int Count1(int src){    int nNum = 0;    while (src)    {       nNum += src & 0x01;        src >>= 1;    }    return nNum;}//减法int Count2(int src){    int nNum = 0;    while (src)    {        src &= src -1;        nNum++;    }    return nNum;}