1102 : 스택 (stack)

import java.util.Scanner;
 
public class Main {
 
    static int stack[] = new int [101];
    static int pos;
     
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan = new Scanner(System.in);
         
        int n, i, j;
        String arr = null;
        int number[] = new int [101];
         
        n = scan.nextInt();
     
        for (i = 0; i < n; i++) {
            arr = scan.next();
             
            if (arr.charAt(0) == 'i') {
                int num = scan.nextInt();
                push(num);
            }
            else if (arr.charAt(0) == 'o') {
                if(Empty()) {
                    System.out.printf("empty\n");
                }else {
                    int num = pop();
                    System.out.printf("%d\n", num);
                }
                 
            }
            else if (arr.charAt(0) == 'c') {
                int num = count();
                System.out.printf("%d\n", num);
            }
        }
         
         
    }
 
    private static int count() {
        // TODO Auto-generated method stub
        int i, j;
         
        return pos;
    }
 
    private static int pop() {
        // TODO Auto-generated method stub
        return stack[--pos];
    }
 
    private static void push(int a) {
        // TODO Auto-generated method stub
        int i, j;
         
        stack[pos++] = a;   
    }
 
    private static boolean Empty() {
        // TODO Auto-generated method stub
        return pos == 0;
    }
 
}

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=382&sca=2070