# 706 - Design HashMap
解法一 - bucket + linked list
class MyHashMap {
public:
/** Initialize your data structure here. */
MyHashMap() {
m_data.resize(m_size);
}
/** value will always be non-negative. */
void put(int key, int value) {
auto &list = m_data[key % m_size];
for (auto & val : list) {
if (val.first == key) {
val.second = value;
return;
}
}
list.emplace_back(key, value);
}
/** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
int get(int key) {
const auto &list = m_data[key % m_size];
if (list.empty()) {
return -1;
}
for (const auto & val : list) {
if (val.first == key) {
return val.second;
}
}
return -1;
}
/** Removes the mapping of the specified value key if this map contains a mapping for the key */
void remove(int key) {
auto &list = m_data[key % m_size];
list.remove_if([key](auto n) { return n.first == key; });
}
private:
vector<list<pair<int,int>>> m_data;
size_t m_size = 10000;
};
/**
* 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);
*/
Last updated