zoukankan      html  css  js  c++  java
  • [LeetCode] My Calendar I

    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.

    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].

    日程设计
    要求两个日程范围不存在重复。
    每次添加时需要和以往所有的日程进行比较。才可以确实是否可以添加。
    现罗列出重叠的情况。
    a为已存在日程,b为待添加日程。
    a   a0 l------------l a1
    b     b0 l----l b1

    a      a0 l------------l a1
    b         b0 l---------l b1

    a   a0 l------------l a1
    b  b0 l------l b1

    根据以上重叠情况,可以得到一个抽象的描述
    max(a0, b0) < min(a1, b1)

    根据这个表达式进行判断即可,

    class MyCalendar {
    public:
        vector<pair<int, int>> pvec;
    public:
        MyCalendar() {
            
        }
        
        bool book(int start, int end) {
            for (auto p : pvec) {
                if (max(p.first, start) < min(p.second, end))
                    return false;
            }
            pvec.push_back({start, end});
            return true;
        }
    };
    // 108 ms
    /**
     * Your MyCalendar object will be instantiated and called as such:
     * MyCalendar obj = new MyCalendar();
     * bool param_1 = obj.book(start,end);
     */
     
  • 相关阅读:
    剖析VC++函数调用约定转
    C++的坑真的多吗?转
    An Introduction to LockFree Programming转
    __cdecl __stdcall区别转
    学习PHP感谢帅哥分享O(∩_∩)O~
    28个Unix/Linux的命令行神器转
    C++ 对象的内存布局(上)转
    一个fork的面试题转
    20本最好的Linux免费书籍转
    谁说外国人都很文明
  • 原文地址:https://www.cnblogs.com/immjc/p/7866875.html
Copyright © 2011-2022 走看看