-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
79 lines (63 loc) · 1 KB
/
main.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
package main
import "fmt"
type Node struct {
Val int
Next *Node
}
type Stack struct {
Node *Node
Size uint
}
func NewStack() *Stack {
return &Stack{}
}
func (s *Stack) Push(val int) bool {
if s.Node == nil {
s.Node = &Node{Val: val}
s.Size++
return true
}
tmp := &Node{val, nil}
tmp.Next = s.Node
s.Node = tmp
s.Size++
return true
}
func (s *Stack) Pop() (int, bool) {
if s.Size == 0 {
return 0, false
}
tmp := s.Node
s.Node = s.Node.Next
s.Size--
return tmp.Val, true
}
func (s *Stack) Traverse() {
t := s.Node
if t == nil {
fmt.Println("-> Empty list!")
}
for ; t != nil; t = t.Next {
fmt.Printf("%d ->", t.Val)
}
fmt.Println()
}
func main() {
stack := NewStack()
stack.Push(000)
stack.Push(100)
stack.Push(200)
stack.Push(300)
stack.Push(400)
stack.Push(500)
// 500 ->400 ->300 ->200 ->100 ->0 ->
stack.Traverse()
// 500 400 300 200 100 0
for i := 0; i < 6; i++ {
v, _ := stack.Pop()
fmt.Print(v, " ")
}
fmt.Println()
//-> Empty list!
stack.Traverse()
}