728x90
https://www.acmicpc.net/problem/10828
package BKD_0x5_Stack;
import java.io.*;
import java.util.Stack;
import java.util.StringTokenizer;
public class BOJ_10828 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int N = Integer.parseInt(br.readLine());
Stack<Integer> stack = new Stack<>();
for(int i=0;i<N;i++){
StringTokenizer st = new StringTokenizer(br.readLine());
String command = st.nextToken();
switch (command){
case "push":
int value = Integer.parseInt(st.nextToken());
stack.push(value);
break;
case "pop":
int pop_value = stack.isEmpty()?-1:stack.pop();
bw.write(pop_value+"\n");
break;
case "size":
bw.write(stack.size()+"\n");
break;
case "empty":
int isEmpty = stack.isEmpty()?1:0;
bw.write(isEmpty+"\n");
break;
case "top":
int top_value = stack.isEmpty()?-1:stack.peek();
bw.write( top_value+"\n");
break;
}
}
bw.flush();
bw.close();
br.close();
}
}
728x90
'🐣 알고리즘 삐약 > 💻 백준 삐약' 카테고리의 다른 글
39 삐약 : 백준 1874|스택 수열[바킹독 문제 풀이|스택|JAVA] (0) | 2023.10.20 |
---|---|
38 삐약 : 백준 10773|제로[바킹독 문제 풀이|스택|JAVA] (0) | 2023.10.20 |
36 삐약 : 백준 1158| 요세푸스 [바킹독 문제 풀이|연결리스트|JAVA] (0) | 2023.10.20 |
35 삐약 : 백준 5397 | 키로거 [바킹독 문제 풀이|연결리스트|JAVA] (0) | 2023.10.19 |
34 삐약 : 백준 1406[바킹독 문제 풀이|연결리스트|JAVA] (0) | 2023.10.19 |