zoukankan      html  css  js  c++  java
  • 729. 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].

    解题思路:

    把数据用pair存起来,每次判断是否重复。

    1. class MyCalendar {  
    2.       
    3. private:  
    4.     vector<pair<int,int>> store;  
    5. public:  
    6.     MyCalendar() {  
    7.     store.clear();  
    8.     }  
    9.       
    10.     bool book(int start, int end) {  
    11.         for(int i=0;i<store.size();i++){  
    12.               
    13.             if(start<=store[i].first&&end>store[i].first){  
    14.                 return false;  
    15.             }  
    16.             else if(start<store[i].second&&end>store[i].first)  
    17.                 return false;  
    18.               
    19.         }  
    20.             store.push_back(make_pair(start,end));return true;  
    21.   
    22.     }  
    23. };  
    24.   
    25. /** 
    26.  * Your MyCalendar object will be instantiated and called as such: 
    27.  * MyCalendar obj = new MyCalendar(); 
    28.  * bool param_1 = obj.book(start,end); 
    29.  */  
  • 相关阅读:
    [数据结构]图的DFS和BFS的两种实现方式
    [算法]两个栈实现一个队列
    [数据结构]手动实现队列
    [数据结构]手动实现栈
    [数据结构]手动实现单链表
    Hive分组取Top K数据
    HBase解决海量图片存储方案
    非结构化数据存储方案
    头条面试题之实现两个线程轮流打印字符串
    [算法]最大连续子数组和,最长重复子串,最长无重复字符子串
  • 原文地址:https://www.cnblogs.com/liangyc/p/8859251.html
Copyright © 2011-2022 走看看