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
|
#include "leetcode.h"
struct lNode {
public:
int start, end;
lNode *next;
lNode(int s, int e, lNode *n) {
start = s;
end = e;
next = n;
}
};
class MyCalendar {
public:
MyCalendar() {
lNode *tail = new lNode(INT_MAX, INT_MAX, nullptr);
calendar = new lNode(-1, -1, tail);
}
bool book(int start, int end) {
lNode *curr = calendar, *last = curr;
while (start >= curr->end)
last = curr, curr = curr->next;
if (curr->start < end)
return false;
last->next = new lNode(start, end, curr);
return true;
}
private:
lNode *calendar;
};
int main() {
int start, end;
MyCalendar *obj = new MyCalendar();
bool param_1 = obj->book(start, end);
}
|