剑指offer——二进制表示中1的个数

class Solution {
public:
     int  (int n) {
        int countn =0;
    while(n)
    {
        countn++;
        n = n&(n-1);
    }
    return countn;
     }
};