-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
294 lines (270 loc) · 7.1 KB
/
Solution.cs
File metadata and controls
294 lines (270 loc) · 7.1 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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
public class AllOne_Second
{
public class DoublyLinkedList
{
public DoublyLinkedList(int value)
{
Value = value;
Prev = Next = null;
Keys = [];
}
public int Value;
public HashSet<string> Keys;
public DoublyLinkedList Prev;
public DoublyLinkedList Next;
}
public Dictionary<string, DoublyLinkedList> map;
public DoublyLinkedList tail;
public DoublyLinkedList head;
public AllOne_Second()
{
map = [];
tail = head = null;
}
public void Inc(string key)
{
if (map.ContainsKey(key))
{
var node = map[key];
node.Keys.Remove(key);
var nextNode = node.Next;
if (nextNode is null)
{
var newNode = new DoublyLinkedList(node.Value + 1);
newNode.Keys.Add(key);
map[key] = newNode;
tail.Next = newNode;
newNode.Prev = tail;
tail = newNode;
}
else if (nextNode.Value == node.Value + 1)
{
nextNode.Keys.Add(key);
map[key] = nextNode;
}
else
{
var newNode = new DoublyLinkedList(node.Value + 1);
newNode.Keys.Add(key);
map[key] = newNode;
newNode.Next = nextNode;
nextNode.Prev = newNode;
node.Next = newNode;
newNode.Prev = node;
}
if (node.Keys.Count == 0)
{
if (node.Prev is null)
{
head = node.Next;
node.Next.Prev = null;
}
else
{
node.Prev.Next = node.Next;
node.Next.Prev = node.Prev;
}
}
}
else
{
if (head is null)
{
var node = new DoublyLinkedList(1);
node.Keys.Add(key);
map.Add(key, node);
head = tail = node;
}
else if (head.Value == 1)
{
map.Add(key, head);
head.Keys.Add(key);
}
else
{
var node = new DoublyLinkedList(1);
node.Keys.Add(key);
map.Add(key, node);
node.Next = head;
head.Prev = node;
head = node;
}
}
}
public void Dec(string key)
{
var node = map[key];
node.Keys.Remove(key);
if (node.Value == 1)
{
map.Remove(key);
}
else if (node.Prev is null)
{
var newNode = new DoublyLinkedList(node.Value - 1);
newNode.Keys.Add(key);
map[key] = newNode;
newNode.Next = node;
node.Prev = newNode;
head = newNode;
}
else if (node.Prev.Value == node.Value - 1)
{
node.Prev.Keys.Add(key);
map[key] = node.Prev;
}
else
{
var newNode = new DoublyLinkedList(node.Value - 1);
newNode.Keys.Add(key);
map[key] = newNode;
node.Prev.Next = newNode;
newNode.Prev = node.Prev;
newNode.Next = node;
node.Prev = newNode;
}
if (node.Keys.Count == 0)
{
if (node.Next is null && node.Prev is null)
{
head = tail = null;
}
else if (node.Next is null)
{
node.Prev.Next = null;
tail = node.Prev;
}
else if (node.Prev is null)
{
node.Next.Prev = null;
head = node.Next;
}
else
{
node.Next.Prev = node.Prev;
node.Prev.Next = node.Next;
}
}
}
public string GetMaxKey()
{
if (tail is null) return "";
return tail.Keys.First();
}
public string GetMinKey()
{
if (head is null) return "";
return head.Keys.First();
}
}
public class AllOne
{
private Dictionary<string, int> frequency;
private List<HashSet<string>> dp;
private int minFrequency;
public AllOne()
{
frequency = [];
dp = [];
minFrequency = 0;
}
public void Inc(string key)
{
if (frequency.ContainsKey(key))
{
if (frequency[key] >= dp.Count)
{
dp.Add([]);
}
dp[frequency[key]].Add(key);
dp[frequency[key] - 1].Remove(key);
frequency[key]++;
if (dp[minFrequency].Count == 0)
{
minFrequency++;
}
return;
}
if (dp.Count == 0)
{
dp.Add([]);
}
frequency.Add(key, 1);
dp[0].Add(key);
minFrequency = 0;
}
public void Dec(string key)
{
if (!frequency.ContainsKey(key)) return;
frequency[key]--;
dp[frequency[key]].Remove(key);
if (dp[^1].Count == 0)
{
dp.RemoveAt(dp.Count - 1);
}
if (frequency[key] == 0)
{
frequency.Remove(key);
while (minFrequency < dp.Count && dp[minFrequency].Count == 0)
{
minFrequency++;
}
}
else
{
dp[frequency[key] - 1].Add(key);
minFrequency = int.Min(frequency[key] - 1, minFrequency);
}
}
public string GetMaxKey()
{
if (dp.Count == 0) return "";
return dp[^1].FirstOrDefault("");
}
public string GetMinKey()
{
if (dp.Count == 0) return "";
return dp[minFrequency].FirstOrDefault("");
}
}
public class Solution
{
public List<string> Execute(string[] events, string[][] values)
{
List<string> result = [];
AllOne_Second allOne = new();
for (int i = 0; i < events.Length; i++)
{
switch (events[i])
{
case "AllOne":
allOne = new AllOne_Second();
result.Add("null");
break;
case "inc":
allOne.Inc(values[i][0]);
result.Add("null");
break;
case "dec":
allOne.Dec(values[i][0]);
result.Add("null");
break;
case "getMaxKey":
result.Add(allOne.GetMaxKey());
break;
case "getMinKey":
result.Add(allOne.GetMinKey());
break;
}
}
return result;
}
}
/**
* Your AllOne object will be instantiated and called as such:
* AllOne obj = new AllOne();
* obj.Inc(key);
* obj.Dec(key);
* string param_3 = obj.GetMaxKey();
* string param_4 = obj.GetMinKey();
*/