-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathQueue.go
More file actions
63 lines (53 loc) · 904 Bytes
/
Copy pathQueue.go
File metadata and controls
63 lines (53 loc) · 904 Bytes
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
package main
import (
//"fmt"
"log"
)
// 用链表实现队列几乎是最优的方式
//type Node struct {
// item string
// next *Node
//}
type Queue struct {
first *Node
last *Node
size int
}
func (q *Queue) IsEmpty() bool {
return q.size == 0
}
func (q *Queue) Size() int {
return q.size
}
func (q *Queue) enqueue(msg string) {
newNode := Node{msg, nil}
if q.last != nil {
q.last.next = &newNode
q.last = &newNode
} else {
q.last = &Node{msg, nil}
q.first = q.last
}
q.size++
}
func (q *Queue) dequeue() string {
if q.first == nil {
log.Fatal("nil")
}
r := q.first.item
q.first = q.first.next
q.size--
return r
}
//func main() {
// var q Queue
// q.enqueue("a")
// q.enqueue("b")
// q.enqueue("c")
// q.enqueue("d")
// fmt.Println(q.dequeue())
// fmt.Println(q.dequeue())
// fmt.Println(q.dequeue())
// fmt.Println(q.dequeue())
// fmt.Println(q.dequeue())
//}