-
Notifications
You must be signed in to change notification settings - Fork 62
/
linked_queue.go
79 lines (64 loc) · 1.04 KB
/
linked_queue.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 linked_queue
import "fmt"
//链式队列的实现(基于链表)
type ListNode struct {
next *ListNode
val interface{}
}
type LinkedQueue struct {
head *ListNode
tail *ListNode
size int
}
func newNode(val interface{}) *ListNode {
return &ListNode{nil, val}
}
func New() *LinkedQueue {
return &LinkedQueue{nil, nil, 0}
}
//入队列
func (q *LinkedQueue) Enqueue(val interface{}) {
node := newNode(val)
if q.head == nil {
q.head = node
} else {
q.tail.next = node
}
q.tail = node
q.size++
}
//出队列
func (q *LinkedQueue) Dequeue() *ListNode {
if q.size <= 0 {
return nil
}
r := q.head
q.head = q.head.next
q.size--
return r
}
//队头节点
func (q *LinkedQueue) Front() *ListNode {
if q.size <= 0 {
return nil
}
return q.head
}
//队尾节点
func (q *LinkedQueue) Back() *ListNode {
if q.size <= 0 {
return nil
}
return q.tail
}
func (q *LinkedQueue) Size() int {
return q.size
}
func (q *LinkedQueue) PrintData() {
p := q.head
for p != nil {
fmt.Print(p.val, " ")
p = p.next
}
fmt.Println()
}