706. 设计哈希映射

处理冲突方法采用链表法,利用list

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
class MyHashMap {

public:
vector<list<pair<int, int>>> data;
static const int base = 769;
static int hash(int x) {

return x % base;
}
MyHashMap(): data(base) {
}

void put(int key, int value) {

for(auto it = data[hash(key)].begin(); it != data[hash(key)].end(); it ++) {

if((*it).first == key) {

(*it).second = value;
return ;
}
}
data[hash(key)].push_back(make_pair(key, value));
return ;
}

int get(int key) {

int h = hash(key);
for(auto it = data[h].begin(); it != data[h].end(); it ++) {

if((*it).first == key) {

return (*it).second;
}
}
return -1;
}

void remove(int key) {

int h = hash(key);
for(auto it = data[h].begin(); it != data[h].end(); it ++) {

if((*it).first == key) {

data[h].erase(it);
return;
}
}
}
};

/**
* Your MyHashMap object will be instantiated and called as such:
* MyHashMap* obj = new MyHashMap();
* obj->put(key,value);
* int param_2 = obj->get(key);
* obj->remove(key);
*/