706. 设计哈希映射

706. 设计哈希映射

**思路一：**用一个大小为10的6次方+1的大小来对应哈希表的键值对映射。用空间换时间。缺点：元素太多，存不下去，元素太少浪费空间。

class MyHashMap {
    private int[] map;
    public MyHashMap() {
        map = new int[1000001];
        for (int i = 0; i < 1000001; i ++) {
            map[i] = -1;
        }
    }
    
    public void put(int key, int value) {
        map[key] = value;
    }
    
    public int get(int key) {
        return map[key];
    }
    
    public void remove(int key) {
        map[key] = -1;
    }
}

思路二： 数组+链表实现，平衡时间和空间，用链地址法实现。

class MyHashMap {
    // 定义一个内部类，来存放键值对
    class Pair {
        private int key;
        private int value;
        public Pair(int key, int value) {
            this.key = key;
            this.value = value;
        }
        public int getKey() {
            return key;
        }
        public int getValue() {
            return value;
        }
       	public void setValue(int value) {
            this.value = value;
        }
    }
    private final static int Bash = 769;
    private LinkedList[] data;
    public MyHashMap() {
        data = new LinkedList[Bash];
        for (int i = 0; i < Bash; i ++) {
            data[i] = new LinkedList<Pair>();
        }
    }
    public void put(int key, int value) {
        int index = hash(key);
        Iterator<Pair> iterator = data[index].iterator();
        while (iterator.hasNext()) {
            Pair pair = iterator.next();
            if (pair.getKey() == key) {
                pair.setValue(value);
                return;
            }
        }
        data[index].offerLast(new Pair(key, value));
    }
    public int get(int key) {
        int index = hash(key);
        Iterator<Pair> iterator = data[index].iterator();
        while (iterator.hasNext()) {
            Pair pair = iterator.next();
            if (pair.getKey() == key) {
                return pair.getValue();
            }
        }
        return -1;
    }
    public void remove(int key) {
        int index = hash(key);
        Iterator<Pair> iterator = data[index].iterator();
        while (iterator.hasNext()) {
            Pair pair = iterator.next();
            if (pair.getKey() == key) {
                data[index].remove(pair);
                return;
            }
        }
    }
    private static int hash(int n) {
        return n % Bash;
    }
}