Design a HashMap without using any built-in hash table libraries.
To be specific, your design should include these functions:
put(key, value) : Insert a (key, value) pair into the HashMap. If the value already exists in the HashMap, update the value.
get(key): Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key.
remove(key) : Remove the mapping for the value key if this map contains the mapping for the key.
Example:
MyHashMap hashMap = new MyHashMap();
hashMap.put(1, 1);
hashMap.put(2, 2);
hashMap.get(1); // returns 1
hashMap.get(3); // returns -1 (not found)
hashMap.put(2, 1); // update the existing value
hashMap.get(2); // returns 1
hashMap.remove(2); // remove the mapping for 2
hashMap.get(2); // returns -1 (not found)
Note:
- All keys and values will be in the range of [0, 1000000].
- The number of operations will be in the range of [1, 10000].
- Please do not use the built-in HashMap library.
哈希表的长度最好开一个远离2的整数次幂的质数
拉链法
class MyHashMap {
public:
/** Initialize your data structure here. */
const static int N = 20011;
vector<list<pair<int,int>>> hash;
MyHashMap() {
hash = vector<list<pair<int,int>>>(N);
}
list<pair<int,int>>::iterator find(int key)
{
int t = key % N;
auto it = hash[t].begin();
for (; it != hash[t].end(); it ++ )
if (it->first == key)
break;
return it;
}
/** value will always be non-negative. */
void put(int key, int value) {
int t = key % N;
auto it = find(key);
if (it == hash[t].end())
hash[t].push_back(make_pair(key, value));
else
it->second = 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) {
auto it = find(key);
if (it == hash[key % N].end())
return -1;
return it->second;
}
/** Removes the mapping of the specified value key if this map contains a mapping for the key */
void remove(int key) {
int t = key % N;
auto it = find(key);
if (it != hash[t].end())
hash[t].erase(it);
}
};
开放寻址法
代补