-
Notifications
You must be signed in to change notification settings - Fork 1
/
day_73_hash_table.go
73 lines (64 loc) · 1.19 KB
/
day_73_hash_table.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
package main
import (
"container/list"
"errors"
"fmt"
)
var (
ErrKeyNotFound = errors.New("key not found")
)
type Item struct {
key int
value interface{}
}
type hashtable struct {
size int
data []*list.List
}
func (h *hashtable) insert(key int, value interface{}) {
item := &Item{key: key, value: value}
hashed := key % h.size
l := h.data[hashed]
if l == nil {
l = list.New()
h.data[hashed] = l
}
for elem := l.Front(); elem != nil; elem = elem.Next() {
i, _ := elem.Value.(*Item)
if i.key == item.key {
i.value = value
return
}
}
l.PushFront(item)
return
}
func (h *hashtable) get(key int) (interface{}, error) {
hashed := key % h.size
l := h.data[hashed]
if l == nil {
return nil, ErrKeyNotFound
}
for elem := l.Front(); elem != nil; elem = elem.Next() {
item := elem.Value.(*Item)
if item.key == key {
return item.value, nil
}
}
return nil, ErrKeyNotFound
}
func newhash(size int) *hashtable {
return &hashtable{
size: size,
data: make([]*list.List, size),
}
}
func main() {
h := newhash(10)
h.insert(1, "a")
value, _ := h.get(1)
fmt.Printf("h[1] = %s\n", value)
h.insert(11, "bcd~")
value, _ = h.get(11)
fmt.Printf("h[11] = %s\n", value)
}