-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathP_432.java
More file actions
106 lines (93 loc) · 2.83 KB
/
Copy pathP_432.java
File metadata and controls
106 lines (93 loc) · 2.83 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
package leetcode.hard;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
@SuppressWarnings("unused")
public class P_432 {
static class Node {
Node prev, next;
Set<String> set;
int val;
Node(int val) {
this.val = val;
set = new HashSet<>();
}
}
static class AllOne {
Node head, tail;
Map<String, Integer> keyMap;
Map<Integer, Node> countMap;
AllOne() {
head = new Node(Integer.MIN_VALUE);
tail = new Node(Integer.MAX_VALUE);
head.next = tail;
tail.prev = head;
keyMap = new HashMap<>();
countMap = new HashMap<>();
}
public void inc(String key) {
if (keyMap.containsKey(key)) {
changeKey(key, 1);
} else {
keyMap.put(key, 1);
if (head.next.val != 1) {
addAfter(new Node(1), head);
}
head.next.set.add(key);
countMap.put(1, head.next);
}
}
public void dec(String key) {
if (!keyMap.containsKey(key)) {
return;
}
final int count = keyMap.get(key);
if (count == 1) {
keyMap.remove(key);
removeKey(key, countMap.get(1));
} else {
changeKey(key, -1);
}
}
public String getMaxKey() {
if (tail.prev == head) {
return "";
}
return tail.prev.set.iterator().next();
}
public String getMinKey() {
if (head.next == tail) {
return "";
}
return head.next.set.iterator().next();
}
private void changeKey(String key, int offSet) {
final int count = keyMap.get(key);
keyMap.put(key, count + offSet);
final Node cur = countMap.get(count);
Node next = countMap.get(count + offSet);
if (next == null) {
next = new Node(count + offSet);
addAfter(next, offSet > 0 ? cur : cur.prev);
countMap.put(count + offSet, next);
}
next.set.add(key);
removeKey(key, cur);
}
private static void addAfter(Node node, Node prev) {
node.next = prev.next;
node.prev = prev;
prev.next.prev = node;
prev.next = node;
}
private void removeKey(String key, Node node) {
node.set.remove(key);
if (node.set.isEmpty()) {
node.next.prev = node.prev;
node.prev.next = node.next;
countMap.remove(node.val);
}
}
}
}