datastuct/LinkStack.go at main · TidalHash/datastuct · GitHub

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
package LinkStack

type StackNode struct {
	Data interface{}
	Next *StackNode
}

type LinkStack struct {
	Head *StackNode
	Size int
}

func (ls *LinkStack) InitStack() *LinkStack {
	HeadNode := &StackNode{}
	return &LinkStack{
		Head: HeadNode,
		Size: 0,
	}
}

func (ls LinkStack) Push(e interface{}) *LinkStack {
	node := &StackNode{
		Data: e,
		Next: nil,
	}
	cur := ls.Head
	for cur.Next != nil {
		cur = cur.Next
	}
	cur.Next = node
	ls.Size++
	return ls
}

func (ls *LinkStack) Pop() interface{} {
	if ls.Size == 0 {

		return nil
	}

	cur := ls.Head
	for cur.Next.Next != nil {
		cur = cur.Next
	}

	e := cur.Next
	cur.Next = nil
	ls.Size--
	return e.Data
}

func (ls *LinkStack) GetTop() interface{} {
	if ls.Size == 0 {
		return nil
	}
	cur := ls.Head
	for cur.Next != nil {
		cur = cur.Next
	}
	return cur.Data
}

func (ls *LinkStack) Stack2Slice() []interface{} {
	rs := make([]interface{}, 0)
	cur := ls.Head.Next
	if cur != nil {
		rs = append(rs, cur.Data)
		cur = cur.Next
	}
	return rs
}