class MyHashMap {
    class Node{
        int key;
        int value;
        Node next;
        public Node(int key, int value){
            this.key= key;
            this.value=value;
        }
    }
    private Node [] buckets;
    int size;
    public MyHashMap() {
        size=0;
        buckets =new Node[16];
    }
    public void put(int key, int value) {
        //用key直接代表hashcode（），%bucket.length能保證不會溢出
        int index = key %buckets.length;
        Node head =buckets[index];
        //只要頭節(jié)點不為空，就一種找下去
        while(head != null && head.key != key){
            head =head.next;
        }
        //找到相同key
        if(head != null ){
            head.value=value;
        //不存在這個key，用的是頭插法
        }else{
            Node newnode =new Node(key,value);
            newnode.next=buckets[index];
            buckets[index] =newnode;
            size++;
        }
    }
    public int get(int key) {
        int index= key % buckets.length;
        Node head =buckets[index];
        while(head != null && head.key != key){
            head=head.next;
        }
        return  head == null ? -1 : head.value;
    }
    public void remove(int key) {
        int index= key % buckets.length;
        Node head =buckets[index];      
        //創(chuàng)建兩個臨時變量,如果只有一個臨時變量，則最后不能給bucket[index]進行賦值
        Node dummy= new Node(0,0);
        Node cur=dummy;
        dummy.next=head;
        while(cur.next != null && cur.next.key != key){
            cur=cur.next;
        }     
        if(cur.next!=null && cur.next.key == key){
            cur.next=cur.next.next;
            size--;
        }   
        buckets[index] =dummy.next;
    }
}
/**
 * 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);
 */