-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution855.cs
59 lines (50 loc) · 1.25 KB
/
Solution855.cs
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
using System.Text;
using LeetCode.DataStructures;
namespace LeetCode.Solutions;
public class Solution855
{
/// <summary>
/// 855. Exam Room - Medium
/// <a href="https://leetcode.com/problems/exam-room">See the problem</a>
/// </summary>
public class ExamRoom
{
private readonly int n;
private readonly SortedSet<int> seats = [];
public ExamRoom(int n)
{
this.n = n;
}
public int Seat()
{
if (seats.Count == 0)
{
seats.Add(0);
return 0;
}
var maxDistance = seats.Min;
var start = 0;
var end = 0;
foreach (var seat in seats)
{
var distance = (seat - start) / 2;
if (distance > maxDistance)
{
maxDistance = distance;
end = start + distance;
}
start = seat;
}
if (n - 1 - seats.Max > maxDistance)
{
end = n - 1;
}
seats.Add(end);
return end;
}
public void Leave(int p)
{
seats.Remove(p);
}
}
}