forked from super30admin/Design-2
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhashMap_without_library.java
More file actions
89 lines (76 loc) · 2.22 KB
/
hashMap_without_library.java
File metadata and controls
89 lines (76 loc) · 2.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
import java.util.*;
class Pair<U, V> {
public U first;
public V second;
public Pair(U first, V second) {
this.first = first;
this.second = second;
}
}
class Bucket {
private List<Pair<Integer, Integer>> bucket;
public Bucket() {
this.bucket = new LinkedList<Pair<Integer, Integer>>();
}
public Integer get(Integer key) {
for (Pair<Integer, Integer> pair : this.bucket) {
if (pair.first.equals(key)) {
return pair.second;
}
}
return -1;
}
public void update(Integer key, Integer value) {
boolean found = false;
for (Pair<Integer, Integer> pair : this.bucket) {
if (pair.first.equals(key)) {
pair.second = value;
found = true;
}
}
if (!found) {
this.bucket.add(new Pair<Integer, Integer>(key, value));
}
}
public void remove(Integer key) {
for (Pair<Integer, Integer> pair : this.bucket) {
if (pair.first.equals(key)) {
this.bucket.remove(pair);
break;
}
}
}
}
class MyHashMap {
private int key_space;
private List<Bucket> hash_table;
/** Initialize your data structure here. */
public MyHashMap() {
this.key_space = 2069;
this.hash_table = new ArrayList<Bucket>();
for (int i = 0; i < this.key_space; ++i) {
this.hash_table.add(new Bucket());
}
}
/** value will always be non-negative. */
public void put(int key, int value) {
int hash_key = key % this.key_space;
this.hash_table.get(hash_key).update(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) {
int hash_key = key % this.key_space;
return this.hash_table.get(hash_key).get(key);
}
/**
* Removes the mapping of the specified value key if this map contains a mapping
* for the key
*/
public void remove(int key) {
int hash_key = key % this.key_space;
this.hash_table.get(hash_key).remove(key);
}
}