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.

题意：实现一个Hash表。

方法一：开辟一个足够大的数组来模拟哈希表。

class MyHashMap {
public:
    int aa[1000100]; 
    MyHashMap() {
        fill(aa,aa+1000100,-1);
    }
    
    void put(int key, int value) {
        aa[key]=value;
    }
    
    int get(int key) {
             return aa[key];
    }
    
    void remove(int key) {
        if(aa[key]!=-1)
             aa[key]=-1;
    }
};

方法二：使用动态数组，需要时才动态分配空间。

class MyHashMap {
public:
    vector<int>vec;
    MyHashMap() {
    }
    
    void put(int key, int value) {
        if(key>=vec.size()){
            for(int i=vec.size();i<=key;i++){
                vec.push_back(-1);
            }
        }
        vec[key]=value;
    }
    
    int get(int key) {
        //这里要注意可能删除的键并不在动态数组中 
        if(key>=vec.size()) 
            return -1;
        else     
            return vec[key];
    }
    
    void remove(int key) {
        if(key<vec.size()) 
            vec[key]=-1;
    }
};