開放尋址法

//開放尋址法
class MyHashMap 
{
public:
    const static int N = 2000003;
    int hash_key[N], hash_value[N];

    MyHashMap() 
    {
        memset(hash_key, -1, sizeof hash_key);
        memset(hash_value, -1, sizeof hash_value);
    }

    int find(int key)
    {
        int t = key % N;
        while (hash_key[t] != key && hash_key[t] != -1)
        {
            if ( ++t == N) t = 0;
        }
        return t;
    }

    void put(int key, int value) 
    {
        int t = find(key);
        hash_key[t] = key;
        hash_value[t] = value;
    }

    int get(int key) 
    {
        int t = find(key);
        if (hash_key[t] == -1) return -1;
        return hash_value[t];
    }

    void remove(int key) 
    {
        int t = find(key);
        if (hash_key[t] != -1)
        {
            hash_key[t] = -1;
            hash_value[t] = -1;
        }
    }
};