Description
Implement a MyCalendar class to store your events. A new event can be added if adding the event
will not cause a double booking.
Your class will have the 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 double booking happens when two events have some non-empty intersection (ie., there is some
time that is common to both events.)
For each call to the method MyCalendar.book, return true if the event can be added to the
calendar successfully without causing a double 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(15, 25); // returns false
MyCalendar.book(20, 30); // returns true
Explanation:
The first event can be booked. The second can't because time 15 is already booked by another event.
The third event can be booked, as the first event takes every time less than 20, but not including 20.
Note
1.The number of calls to MyCalendar.book per test case will be at most 1000.
2.In calls to MyCalendar.book(start, end), start and end are integers in the range [0, 10^9].
Solution 1(C++)
class MyCalendar {
public:
vector<pair<int,int>> v;
MyCalendar() {
}
bool book(int s, int e) {
for (auto p:v) {
if (p.first <= s && p.second > s) return false;
if (s <= p.first && e > p.first) return false;
}
v.push_back({s,e});
return true;
}
};
算法分析
分别判断s是否在之前的时间段内,然后判断之前的s是否在新加入的时间段。
主要是要找对合适的判断规则。
后面更新,此题可与:LeetCode-731. My Calendar II,联系起来一起思考。
程序分析
vector<pair<int,int>> v;
v.push_back({s,e});
学习pair< int, int >,可以直接用{}构造。