LeetCode #706 - 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.

class MyHashMap {
public:
    /** Initialize your data structure here. */
    MyHashMap() {
        hash.resize(1000,vector<int>());
    }
    
    /** value will always be non-negative. */
    void put(int key, int value) { //只有需要插入key/1000行的时候才创建对应的数组，这样可以减少空间复杂度
        if(hash[key/1000].size()==0) hash[key/1000].resize(1000,-1);
        hash[key/1000][key%1000]=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) {
        if(hash[key/1000].size()>0) return hash[key/1000][key%1000];
        else return -1;
    }
    
    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
    void remove(int key) {
        if(hash[key/1000].size()>0) hash[key/1000][key%1000]=-1;
    }

private: //构造1000*1000的二维数组，对于给定key，key/1000是行数，key%1000是列数
    vector<vector<int>> hash;
};