706. 设计哈希映射

链接：706. 设计哈希映射

题解：https://leetcode-cn.com/problems/design-hashmap/solution/xiang-jie-hashmap-de-she-ji-zai-shi-jian-85k9/

https://leetcode-cn.com/problems/design-hashmap/solution/she-ji-ha-xi-ying-she-by-leetcode-soluti-klu9/

class MyHashMap {
private: 
    int hash_code(int key) {
        return key%bucket_size;
    }
    struct Node{
        int val;
        int key;
        Node(int _key, int _val) {
            key = _key;
            val = _val;
        }
    };
    vector<list<Node>> _table;
    const int bucket_size = 1000;
public:
    /** Initialize your data structure here. */
    MyHashMap() {
        _table.resize(bucket_size);
    }
    
    /** value will always be non-negative. */
    void put(int key, int value) {
        int bucket_key = hash_code(key);
        for(auto& ite : _table[bucket_key]) {
            if(ite.key == key) {
                ite.val = value;
                return;
            }
        }
        _table[bucket_key].push_back(Node(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) {
        int bucket_key = hash_code(key);
        for(auto ite : _table[bucket_key]) {
            if(ite.key == key) {
                return ite.val; 
            }
        }
        return -1;
    }
    
    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
    void remove(int key) {
        int bucket_key = hash_code(key);
        for(auto ite = _table[bucket_key].begin(); ite != _table[bucket_key].end(); ++ite) {
            if(ite->key == key) {
                _table[bucket_key].erase(ite);
                break;
            }
        }
    }
};

/**
 * 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);
 */