-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack.go
62 lines (50 loc) · 823 Bytes
/
stack.go
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
package main
import "fmt"
var size = 10
type Stack struct {
items []int
top int
}
func (stack *Stack) push(value int) {
if stack.top == size {
fmt.Println("Stack is full")
return
}
stack.items = append(stack.items, value)
stack.top++
return
}
func (stack *Stack) pop() {
if stack.top == 0 {
fmt.Println("Stack is empty")
return
}
stack.items = stack.items[:stack.top-1]
stack.top--
}
func (stack *Stack) peek() {
if stack.top == 0 {
fmt.Println("Stack is empty")
return
}
fmt.Println(stack.items[stack.top-1])
}
func (stack *Stack) print() {
if stack.top == 0 {
fmt.Println("Stack is empty")
return
}
for i := 0; i < stack.top; i++ {
fmt.Print(stack.items[i], " ")
}
}
func main() {
s := Stack{}
s.push(4)
s.push(2)
s.push(9)
s.push(3)
s.peek()
s.pop()
s.print()
}