不使用任何内建的哈希表库设计一个哈希映射(HashMap)。
实现 MyHashMap 类:
MyHashMap() 用空映射初始化对象
void put(int key, int value) 向 HashMap 插入一个键值对 (key, value) 。如果 key 已经存在于映射中,则更新其对应的值 value 。
int get(int key) 返回特定的 key 所映射的 value ;如果映射中不包含 key 的映射,返回 -1 。
void remove(key) 如果映射中存在 key 的映射,则移除 key 和它所对应的 value 。
示例:
输入:
["MyHashMap", "put", "put", "get", "get", "put", "get", "remove", "get"]
[[], [1, 1], [2, 2], [1], [3], [2, 1], [2], [2], [2]]
输出:
[null, null, null, 1, -1, null, 1, null, -1]
class MyHashMap {
/*使用链表*/
private static final int BASE = 999;
private LinkedList[] data;
/** Initialize your data structure here. */
public MyHashMap() {
data =new LinkedList[BASE];
for(int i=0;i<BASE;i++)
{
data[i]=new LinkedList<Data>();
}
}
/** value will always be non-negative. */
public void put(int key, int value) {
LinkedList<Data> list =data[hash(key)];
for(Data d:list)
{
if(d.key == key)
{
d.value = value;
return;
}
}
list.add(new Data(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) {
LinkedList<Data> list = data[hash(key)];
for(Data d :list)
{
if(d.key == key)
return d.value;
}
return -1;
}
/** Removes the mapping of the specified value key if this map contains a mapping for the key */
public void remove(int key) {
LinkedList<Data> list= data[hash(key)];
for(Data d:list)
{
if(d.key==key)
{
list.remove(d);
return;
}
}
}
private int hash(int key)
{
return key%BASE;
}
}
class Data{
int key;
int value;
public Data(int key,int value)
{
this.key=key;
this.value=value;
}
}
/**
* 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);
*/