-
Notifications
You must be signed in to change notification settings - Fork 32
Expand file tree
/
Copy pathDesignANumberContainerSystem.java
More file actions
91 lines (79 loc) · 2.39 KB
/
DesignANumberContainerSystem.java
File metadata and controls
91 lines (79 loc) · 2.39 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
90
91
// two maps
class NumberContainers {
HashMap<Integer,TreeSet<Integer>> numberToIdx;
HashMap<Integer,Integer> idxToNumber;
public NumberContainers() {
numberToIdx = new HashMap<>();
idxToNumber = new HashMap<>();
}
public void change(int index, int number) {
// delete old
if(idxToNumber.containsKey(index)){
int prev = idxToNumber.get(index);
numberToIdx.get(prev).remove(index);
if(numberToIdx.get(prev).size()==0){
numberToIdx.remove(prev);
}
}
// insert new
idxToNumber.put(index,number);
if(!numberToIdx.containsKey(number)){
numberToIdx.put(number, new TreeSet<>());
}
numberToIdx.get(number).add(index);
}
public int find(int number) {
if(!numberToIdx.containsKey(number)){
return -1;
}
return numberToIdx.get(number).first();
}
}
/**
* Your NumberContainers object will be instantiated and called as such:
* NumberContainers obj = new NumberContainers();
* obj.change(index,number);
* int param_2 = obj.find(number);
*/
// lazy update
class NumberContainers {
HashMap<Integer,PriorityQueue<Integer>> numberToIdx;
HashMap<Integer,Integer> idxToNumber;
public NumberContainers() {
numberToIdx = new HashMap<>();
idxToNumber = new HashMap<>();
}
public void change(int index, int number) {
// insert new
idxToNumber.put(index,number);
if(!numberToIdx.containsKey(number)){
numberToIdx.put(number, new PriorityQueue<>());
}
numberToIdx.get(number).offer(index);
}
public int find(int number) {
if(!numberToIdx.containsKey(number)){
return -1;
}
PriorityQueue<Integer> pq = numberToIdx.get(number);
while(!pq.isEmpty()){
int idx = pq.peek();
if(idxToNumber.get(idx) == number){
break;
}else{
pq.poll();
}
}
if(pq.isEmpty()){
numberToIdx.remove(number);
return -1;
}
return numberToIdx.get(number).peek();
}
}
/**
* Your NumberContainers object will be instantiated and called as such:
* NumberContainers obj = new NumberContainers();
* obj.change(index,number);
* int param_2 = obj.find(number);
*/