백준 10828 알고리즘
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
type Stack struct {
data []int
size int
}
func New(size int) *Stack {
return &Stack{
data: make([]int, size),
size: 0,
}
}
func (stack *Stack) Push(num int) {
if len(stack.data) > stack.size {
stack.data[stack.size] = num
stack.size++
}
}
func (stack *Stack) Pop() int {
if stack.Empty() == 1 {
return -1
} else {
result := stack.data[stack.size-1]
stack.size--
return result
}
}
func (stack *Stack) Empty() int {
if stack.size == 0 {
return 1
} else {
return 0
}
}
func (stack *Stack) Size() int {
return stack.size
}
func (stack *Stack) Top() int {
if stack.Empty() == 1 {
return -1
} else {
return stack.data[stack.size-1]
}
}
func main() {
w := bufio.NewWriter(os.Stdout)
defer w.Flush()
scn := bufio.NewScanner(os.Stdin)
var n int
fmt.Scanln(&n)
stack := New(n)
for i := 0; i < n; i++ {
scn.Scan()
text := scn.Text()
split := strings.Split(text, " ")
switch split[0] {
case "push":
value, _ := strconv.Atoi(split[1])
stack.Push(value)
case "top":
fmt.Fprintf(w, "%d\n", stack.Top())
case "pop":
fmt.Fprintf(w, "%d\n", stack.Pop())
case "empty":
fmt.Fprintf(w, "%d\n", stack.Empty())
case "size":
fmt.Fprintf(w, "%d\n", stack.Size())
}
}
}