leetcode 729. My Calendar I 我的日历 + 区间插入

àì夳堔傛蜴生んèń 2022-06-03 08:59 140阅读 0赞

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 most 1000.  
In calls to MyCalendar.book(start, end), start and end are integers in the range \[0, 10^9\].

本题题意很简单，就是做一个区间交集的判断，这里采用的是暴力遍历

建议和[leetcode 731. My Calendar II][] 和 [leetcode 732. My Calendar III 使用Map记录出入度][leetcode 732. My Calendar III _Map]一起学习

代码如下：

#include <iostream>
    #include <vector>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <string>
    #include <climits>
    #include <algorithm>
    #include <sstream>
    #include <functional>
    #include <bitset>
    #include <numeric>
    #include <cmath>
    #include <regex>
    
    using namespace std;
    
    
    
    
    class MyCalendar
    {
    public:
        vector<pair<int, int>> all;
        MyCalendar() 
        {
    
        }
    
        bool book(int start, int end) 
        {
            for (auto a : all)
            {
                if (a.first <= start && start < a.second
                    || start <= a.first && a.first < end)
                    return false;
    
            }
            all.push_back({ 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);
    */

[leetcode 731. My Calendar II]: http://blog.csdn.net/jackzhang_123/article/details/78887221
[leetcode 732. My Calendar III _Map]: http://blog.csdn.net/jackzhang_123/article/details/78887324