剑指offer：二进制中1的个数

public class Solution {
    public int NumberOf1(int n) {
        /*
		int ans=0;
        while (n!=0){
            ans++;
            n=n&(n-1);
            
        }
        return ans;
        */
        
        int flag=1;
        int count=0;
        while (flag!=0){
            if ((flag&n)!=0){
                count++;
            }
            flag=flag<<1;
        }
        return count;
    }
}