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
80
81
82
83
84
85
86
87
88
|
package search
type HashElem struct {
key int
val int
next *HashElem
}
type Hash struct {
root *HashElem
size int
}
func NewHash() *Hash {
return &Hash{}
}
func (h *Hash) Empty() bool {
return s.root == nil
}
func (h *Hash) Size() int {
return s.size
}
func (h *Hash) Put(key int, val int) {
if s.Empty() {
s.root = &HashElem{key, val, nil}
s.size++
return
}
elem := s.root
for {
if elem.key == key {
elem.val = val
return
}
if elem.next == nil {
elem.next = &HashElem{key, val, nil}
s.size++
return
}
elem = elem.next
}
}
func (h *Hash) Get(key int) (int, error) {
elem := s.root
for elem != nil {
if elem.key == key {
return elem.val, nil
}
elem = elem.next
}
return 0, NotFound
}
func (h *Hash) Del(key int) (int, error) {
if s.Empty() {
return 0, NotFound
}
if s.root.key == key {
defer func() {
s.root = s.root.next
}()
s.size--
return s.root.val, nil
}
elem := s.root
for elem.next != nil {
if elem.next.key == key {
defer func() {
elem.next = elem.next.next
}()
s.size--
return elem.next.val, nil
}
elem = elem.next
}
return 0, NotFound
}
|
