706_Design_HashMap.java

classMyHashMap {
privateclassNode {
privateintkey, value;

publicNode(intk, intv) {
key = k;
value = v;
 }
 }

privateNode[] m;
privateintsize, capacity;
privatestaticfinaldoubleLOAD_CAPACITY = 0.66;

publicMyHashMap() {
size = 0;
capacity = 5000;
m = newNode[capacity];
 }

privateintgetHash(intkey) {
returnkey % capacity;
 }

privatevoidresize() {
if (size <= LOAD_CAPACITY * capacity) {
return;
 }

size = 0;
capacity *= 2;

Node[] temp = m;
m = newNode[capacity];

for (inti = 0; i < temp.length; i++) {
if (temp[i] == null || temp[i].key == -1) {
continue;
 }
put(temp[i].key, temp[i].value);
 }
 }

publicvoidput(intkey, intvalue) {
intidx = getHash(key);

while (m[idx] != null) {
if (m[idx].key == key) {
m[idx].value = value;
return;
 }

 ++idx;
idx %= capacity;
 }

m[idx] = newNode(key, value);
 ++size;

resize();
 }

publicintget(intkey) {
intidx = getHash(key);

while (m[idx] != null) {
if (m[idx].key == key) {
returnm[idx].value;
 }

 ++idx;
idx %= capacity;
 }

return -1;
 }

/**
 * Removes the mapping of the specified value key if this map contains a mapping
 * for the key
 */
publicvoidremove(intkey) {
intidx = getHash(key);

while (m[idx] != null) {
if (m[idx].key == key) {
m[idx] = newNode(-1, -1);
 --size;
return;
 }

 ++idx;
idx %= capacity;
 }
 }
}