1import java.util.LinkedList;
2
3class MyHashMap {
4
5    private class Pair {
6        int key, value;
7
8        Pair(int k, int v) {
9            key = k;
10            value = v;
11        }
12    }
13
14    private static final int SIZE = 1000;
15    private LinkedList<Pair>[] map;
16
17    public MyHashMap() {
18        map = new LinkedList[SIZE];
19    }
20
21    public void put(int key, int value) {
22        int index = key % SIZE;
23        if (map[index] == null) {
24            map[index] = new LinkedList<Pair>();
25            map[index].add(new Pair(key, value));
26        } else {
27            for (Pair p : map[index]) {
28                if (p.key == key) {
29                    p.value = value;
30                    return;
31                }
32            }
33            map[index].add(new Pair(key, value));
34        }
35    }
36
37    public int get(int key) {
38        int index = key % SIZE;
39        if (map[index] != null) {
40            for (Pair p : map[index]) {
41                if (p.key == key) {
42                    return p.value;
43                }
44            }
45        }
46        return -1;
47    }
48
49    public void remove(int key) {
50        int index = key % SIZE;
51        if (map[index] != null) {
52            Pair toRemove = null;
53            for (Pair p : map[index]) {
54                if (p.key == key) {
55                    toRemove = p;
56                }
57            }
58            if (toRemove != null) map[index].remove(toRemove);
59        }
60    }
61}

1#