-
Notifications
You must be signed in to change notification settings - Fork 0
/
My Calendar II
125 lines (108 loc) · 3.98 KB
/
My Calendar II
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
/*
LeetCode 731:
Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not cause a triple booking.
Your class will have one method, book(int start, int end). Formally, this represents a booking on the half open interval [start, end), the range of real numbers x such that start <= x < end.
A triple booking happens when three events have some non-empty intersection (ie., there is some time that is common to all 3 events.)
For each call to the method MyCalendar.book, return true if the event can be added to the calendar successfully without causing a triple booking. Otherwise, return false and do not add the event to the calendar.
Your class will be called like this: MyCalendar cal = new MyCalendar(); MyCalendar.book(start, end)
Example 1:
MyCalendar();
MyCalendar.book(10, 20); // returns true
MyCalendar.book(50, 60); // returns true
MyCalendar.book(10, 40); // returns true
MyCalendar.book(5, 15); // returns false
MyCalendar.book(5, 10); // returns true
MyCalendar.book(25, 55); // returns true
Explanation:
The first two events can be booked. The third event can be double booked.
The fourth event (5, 15) can't be booked, because it would result in a triple booking.
The fifth event (5, 10) can be booked, as it does not use time 10 which is already double booked.
The sixth event (25, 55) can be booked, as the time in [25, 40) will be double booked with the third event;
the time [40, 50) will be single booked, and the time [50, 55) will be double booked with the second event.
Note:
The number of calls to MyCalendar.book per test case will be at most 1000.
In calls to MyCalendar.book(start, end), start and end are integers in the range [0, 10^9].
Solution:
Language: C++
Tag: map sweep-line
*/
class MyCalandar {
private:
map<int, int> myCal;
public:
MyCalandar() {
}
bool book(int start, int end) {
if (start >= end) {
return false;
}
map<int, int>::iterator it = myCal.lower_bound(start); //it->first >= start
if (it != myCal.end() && it->first < end) {
return false;
}
if (it != myCal.begin() && (--it)->second > start) {
return false;
}
myCal[start] = end;
return true;
}
};
class MyCalendarTwo {
private:
/*
// 1.
vector<pair<int, int>> times;
*/
// 2. sweep line
map<int, int> times;
public:
MyCalendarTwo() {
}
bool book(int start, int end) {
if (start >= end) {
return false;
}
/*
// 1. use MyCalandar -- check whether overlap intervals are overlapped again
// O(N) for each query --> O(N^2) time + O(N) space
MyCalandar *overlapped = new MyCalandar;
for (pair<int, int> time : times) {
if (time.first < end && time.second > start) {
int overlap_start = max(start, time.first);
int overlap_end = min(end, time.second);
if (overlapped->book(overlap_start, overlap_end) == false) {
return false;
}
}
}
times.push_back({start, end});
return true;
*/
// 2. sweep line -- O(N^2) time + O(N) space
if (times.find(start) != times.end()) {
++times[start];
} else {
times[start] = 1;
}
if (times.find(end) != times.end()) {
--times[end];
} else {
times[end] = -1;
}
int overlap = 0;
for (pair<int, int> time : times) { // make use of map has already sorted from small to large
overlap += time.second;
if (overlap == 3) {
--times[start];
++times[end];
return false;
}
}
return true;
}
};
/**
* Your MyCalendarTwo object will be instantiated and called as such:
* MyCalendarTwo obj = new MyCalendarTwo();
* bool param_1 = obj.book(start,end);
*/