forked from Aaaaaaron/algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDequeInArray.go
More file actions
67 lines (60 loc) · 1.42 KB
/
DequeInArray.go
File metadata and controls
67 lines (60 loc) · 1.42 KB
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
package main
import (
"fmt"
"log"
)
type Deque struct {
item [8]string
head int
tail int
}
func (deque *Deque) LPush(value string) { // add firstN
deque.head = (deque.head - 1) % len(deque.item)
if deque.head < 0 { // head = -1
deque.head += len(deque.item)
}
if deque.head == deque.tail {
log.Fatal("full")
}
deque.item[deque.head] = value
fmt.Println("head", deque.head)
}
func (deque *Deque) RPush(value string) { // add last
if (deque.tail+1)%len(deque.item) == deque.head {
log.Fatal("full")
}
deque.item[deque.tail] = value
deque.tail = (deque.tail + 1) % len(deque.item)
fmt.Println("tail", deque.tail)
}
func (deque *Deque) LPop() string {
head := deque.head
deque.head = (deque.head + 1) % len(deque.item) //因为不删除元素,所以这里要是pop的比push多,会取到过期数据.还有一种方案是置为""
return deque.item[head]
}
func (deque *Deque) RPop() string {
deque.tail = (deque.tail - 1) % len(deque.item)
if deque.tail < 0 {
deque.tail += len(deque.item)
}
return deque.item[deque.tail]
}
func main() {
var item [8]string
deque := Deque{item, 0, 0}
deque.LPush("1")
deque.LPush("2")
deque.LPush("3")
deque.RPush("4")
deque.RPush("5")
deque.RPush("6")
deque.RPush("7")
fmt.Println(deque.RPop())
fmt.Println(deque.RPop())
fmt.Println(deque.RPop())
fmt.Println(deque.RPop())
fmt.Println(deque.RPop())
fmt.Println(deque.RPop())
//fmt.Println(-1&7)
//deque.LPush("4")
}