[ST]백준 - 스택(10828) - Java

 

https://www.acmicpc.net/problem/10828

10828번: 스택

 

자료구조 중 스택(Stack) 문제를 풀어보았다.

 

 

import java.util.Scanner;
import java.util.Stack;

public class stack {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int len = sc.nextInt();
		func(len);
	}

	public static void func(int len) {
		Scanner sc = new Scanner(System.in);
		Stack<Integer> stack = new Stack<Integer>();
		String command = "";
		for (int i = 0; i < len; i++) {
			command = sc.nextLine();
			String[] commands = command.split(" ");
			switch (commands[0]) {
			case "push":
				stack.push(Integer.parseInt(commands[1]));
				break;
			case "pop":
				if (stack.isEmpty()) {
					System.out.println(-1);
				} else {
					System.out.println(stack.peek());
					stack.pop();
				}
				break;
			case "size":
				int size = stack.size();
				System.out.println(size);
				break;
			case "empty":
				if (stack.isEmpty()) {
					System.out.println(1);
				} else {
					System.out.println(0);
				}
				break;
			case "top":
				System.out.println(stack.peek());
				break;
			default:
				break;
			}

		}
	}
}