整数的二进制表达中有多少个1

//整数的二进制表达中有多少个1
public class CountOne{
	
     //方法一
	public static int Count01(int n)
	{
		int res=0;
		while(n!=0)
		{
			res+=n&1;
			n>>>=1;
		}
		return res;
	}
    
    //方法二
    public static int Count02(int n)
    {
    	 int sum=0;
    	 while(n!=0)
    	 {
    	 	n=n&(n-1);
    	 	sum++;
    	 }
    	 return sum;
    }

    //方法三
    public static int Count03(int n)
    {
       n=(n&0x55555555)+((n>>>1)&0x55555555);
       n=(n&0x33333333)+((n>>>2)&0x33333333);
       n=(n&0x0f0f0f0f)+((n>>>4)&0x0f0f0f0f);
       n=(n&0x00ff00ff)+((n>>>8)&0x00ff00ff);
       n=(n&0x0000ffff)+((n>>>16)&0x0000ffff);
       return n;
    }

	public static void main(String[]args)
	{
             int n=-1;
             System.out.println(Count01(n));
             System.out.println(Count02(n));
             System.out.println(Count03(n));
	}
}