문제

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


문제 풀이

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
import java.util.*;

public class Main {
    public static int[] stack;
    public static int size = 0;

    public static void push(int num) {
        stack[size] = num;
        size++;
    }

    public static int pop() {
        if (size == 0) {
            return -1;
        } else {
            int result = stack[size - 1];
            stack[size - 1] = 0;
            size--;
            return result;
        }
    }

    public static int size() {
        return size;
    }

    public static int top() {
        if (size() == 0) {
            return -1;
        } else {
            return stack[size - 1];
        }
    }

    public static int empty() {
        if (size() == 0) {
            return 1;
        } else {
            return 0;
        }
    }

    public static void main(String[] args) {
        StringBuilder sb = new StringBuilder();
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        stack = new int[n];

        for (int i = 0; i < n; i++) {
            String order = sc.next();

            switch (order) {
                case "push":
                    push(sc.nextInt());
                    break;
                case "pop":
                    sb.append(pop()).append("\n");
                    break;
                case "size":
                    sb.append(size()).append("\n");
                    break;
                case "top":
                    sb.append(top()).append("\n");
                    break;
                case "empty":
                    sb.append(empty()).append("\n");
                    break;
            }
        }

        System.out.println(sb);
    }
}

카테고리:

업데이트:

댓글남기기