blob: 984c403cf94f58164c47324262e25b8ac64f3009 (
plain)
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 "errors"
type PQueue struct {
id int
array []int
}
func (q *PQueue) isEmpty() bool {
return q.array == nil || len(q.array) < 2
}
func (q *PQueue) push( v int) {
if q.array == nil {
q.array = make([]int, 1)
}
q.array = append(q.array, v)
for i := len(q.array) - 1 ; i > 1 ; i = i >> 1 {
if q.array[i] > q.array[i>>1] {
q.array[i], q.array[i>>1] = q.array[i>>1], q.array[i]
} else {
break
}
}
return
}
func (q *PQueue) pop() (v int,err error) {
if q.isEmpty() {
return -1, errors.New("PQeueue empty")
}
v = q.array[1]
q.array[1] = q.array[len(q.array)-1]
q.array = q.array[:len(q.array)-1]
ind := 2
for i := 1 ; i*2 < len(q.array) ; i = ind {
if i << 1 + 1 < len(q.array) {
if q.array[i<<1+1] > q.array[i<<1] {
ind=i<<1+1
} else {
ind=i<<1
}
}
if q.array[ind] > q.array[i] {
q.array[ind], q.array[i] = q.array[i], q.array[ind]
} else {
break
}
}
return
}
|
