-
Notifications
You must be signed in to change notification settings - Fork 62
/
array_stack.go
80 lines (65 loc) · 1.38 KB
/
array_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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
package array_stack
import (
"errors"
"fmt"
)
//顺序栈的实现(基于数组)
const DefaultCapacity = 16
type ArrayStack struct {
data []interface{}
size int
capacity int
}
//新建数组
func New(capacity int) *ArrayStack {
return &ArrayStack{
data: make([]interface{}, 0, capacity),
size: 0,
capacity: capacity,
}
}
func Default() *ArrayStack {
return New(DefaultCapacity)
}
//压栈,往栈中加入数据
func (stack *ArrayStack) Push(val interface{}) error {
if stack.size == stack.capacity {
return errors.New("stack is full")
}
stack.data = append(stack.data, val)
stack.size++
return nil
}
//出栈,取出栈顶数据
func (stack *ArrayStack) Pop() (interface{}, error) {
if stack.Empty() {
return nil, errors.New("stack is empty")
}
stack.size--
result := stack.data[stack.size]
stack.data[stack.size] = nil
return result, nil
}
//获取栈顶元素
func (stack *ArrayStack) Peek() (interface{}, error) {
if stack.Empty() {
return nil, errors.New("stack is empty")
}
return stack.data[stack.size-1], nil
}
func (stack *ArrayStack) Size() int {
return stack.size
}
func (stack *ArrayStack) Empty() bool {
return stack.size <= 0
}
func (stack *ArrayStack) PrintData() {
if stack.Empty() {
fmt.Println("stack is empty")
} else {
for i := stack.size - 1; i >= 0; i-- {
fmt.Print(stack.data[i], " ")
}
fmt.Println()
}
}