[leetcode] Design HashMap

problem

code

1st try: simple

class MyHashMap {
    private int[] bucket;

    /** Initialize your data structure here. */
    public MyHashMap() {
        bucket = new int[1000001];
        for (int i = 0; i < 1000001; i++) {
            bucket[i] = -1;
        }
    }
    
    /** value will always be non-negative. */
    public void put(int key, int value) {
        this.bucket[key] = value;
    }
    
    /** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
    public int get(int key) {
        return this.bucket[key];
    }
    
    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
    public void remove(int key) {
        this.bucket[key] = -1;
    }
}

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