hdu2051 Bitset （十进制转化为二进制） java

Problem Description
Give you a number on base ten,you should output it on base two.(0 < n < 1000)

Input
For each case there is a postive number n on base ten, end of file.

Output
For each case output a number on base two.

Sample Input
1
2
3

Sample Output
1
10
11

方法一： 直接用Integer中自带方法

import java.util.Scanner;

public class Main {
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        int n;
        while(sc.hasNext()){
            n=sc.nextInt();
            System.out.println(Integer.toBinaryString(n));
        }
    }
}

方法二： 利用栈原理

import java.util.*;
public class Main {
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        int n;
        Stack<Integer> stack=new Stack<Integer>();
        while(sc.hasNext()){
            n=sc.nextInt();
            while(n!=0){
                int r;
                r=n%2;
                n=n/2;
                stack.push(new Integer(r));
            }
            while(!stack.isEmpty()){
                System.out.print(stack.pop());
            }
            System.out.println();

        }
    }
}