729. My Calendar I
Posted learning-c
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了729. My Calendar I相关的知识,希望对你有一定的参考价值。
c++代码
判断两个线段是否重复。
fast-rcnn目标检测中nms代码中有这个代码段:)
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:
- The number of calls to
MyCalendar.book
per test case will be at most1000
. - In calls to
MyCalendar.book(start, end)
,start
andend
are integers in the range[0, 10^9]
.
class MyCalendar { public: vector<pair<int,int>> vec; MyCalendar() { } bool book(int start, int end) { for(int i=0;i<vec.size();++i){ if(min(vec[i].second,end)>max(vec[i].first,start)) { //vec.push_back(pair<int,int>(start,end)); return false; } } vec.push_back(pair<int,int>(start,end)); return true; } }; /** * Your MyCalendar object will be instantiated and called as such: * MyCalendar obj = new MyCalendar(); * bool param_1 = obj.book(start,end); */
以上是关于729. My Calendar I的主要内容,如果未能解决你的问题,请参考以下文章
[LeetCode] 729. My Calendar I 731. My Calendar II 732. My Calendar III 题解