【LeetCode】706. Design HashMap（C++）

地址：https://leetcode.com/problems/design-hashmap/

描述：

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.

理解：

和705 Design HashSet 相似，自己设计一个哈希表。不同的是，这里需要存储对应key的value。

思路：

采用除留余数法，把key对一个素数p取模，用一个vector<int,list<int,int>>表示哈希表，其中list<int,int>是采用拉链法解决冲突，存储所有哈希值相同的元素。

实现：

class MyHashMap {
	const int size = 4093;
	vector<list<pair<int, int>>> bucket;
	int hash(int key) {
		return key%size;
	}

	list<pair<int, int>>::iterator myFind(int index, int key) {
		return find_if(bucket[index].begin(), bucket[index].end(), [key](pair<int, int> tmp) {return tmp.first == key; });
	}
public:
	/** Initialize your data structure here. */
	MyHashMap():bucket(size,list<pair<int,int>>()) {
		
	}

	/** value will always be non-negative. */
	void put(int key, int value) {
		int index = hash(key);
		auto iter = myFind(index, key);
		if (iter == bucket[index].end()) {
			bucket[index].push_front({ key,value });
		}
		else {
			iter->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) {
		int index = hash(key);
		auto iter = myFind(index, key);
		if (iter == bucket[index].end()) {
			return -1;
		}
		else {
			return iter->second;
		}
	}

	/** Removes the mapping of the specified value key if this map contains a mapping for the key */
	void remove(int key) {
		int index = hash(key);
		auto iter = myFind(index, key);
		if (iter == bucket[index].end()) {
			return;
		}
		else {
			bucket[index].erase(iter);
		}
	}
};

困。。没睡午觉