二进制中1的个数

题目如下:
这里我总结了多种方法:

import java.util.Scanner;

public class Demo_二进制中1的个数 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		//第一种方法,拆成字符串数组
		//anwser1();
		
		//法二:拿一个1,从右到左与原数字做&运算,循环到32次
		//answer2();
		
		//法三:从高位开始运算
		//answer3();
		
		//法三:消除1,计算消除的次数,消除法就用二进制减去1.再将结果与原数做一个&运算,这样就消掉最低位的1
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		System.out.println(Integer.toString(n,2));
		int count = 0;
		while (n!=0) {
			n = ((n-1)&n);
			count++;
		}
		System.out.println(count);
		
		
	}

	public static void answer3() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		System.out.println(Integer.toString(n,2));
		int count = 0;
		for (int i = 0; i < 32; i++) {
			if (((n>>>i)&1) == 1) {
				count++;
			}
		}
		
		System.out.println(count);
	}

	public static void answer2() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		System.out.println(Integer.toString(n,2));
		int count = 0;
		//比对每一位
		for (int i = 0; i < 32; i++) {
			if ((n&(1<<i))==(1<<i)) {
				count++;
			}
		}
		System.out.println(count);
	}

	public static void anwser1() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		String binaryString = Integer.toBinaryString(n);
		String[] split = binaryString.split("");
		for (int i = 0; i < split.length; i++) {
			if (split[i].equals("1") == true) {
				cnt++;
			}
		}
		System.out.println(cnt);
	}

}