剑指 Offer 15. 二进制中1的个数

package leetcode;

public class offer_15 {

    //n与n-1进行与运算会消除n中最后一个1
    public int hammingWeight(int n) {
        int count=0;
        while(n!=0) {
            count=count+1;
            n=n&(n-1);
        }
        return count;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        offer_15 off=new offer_15();
        System.out.println(off.hammingWeight(11));
    }

}