zoukankan      html  css  js  c++  java
  • LeetCode 729. My Calendar I

    原题链接在这里:https://leetcode.com/problems/my-calendar-i/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.

    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]

    题解:

    根据开始时间二分法找到插入位置看前后是否有重叠.

    这里使用TreeMap. floorKey找到<=给出start的最大key. ceilingKey找到>=给出start的最小key.

    Time Complexity: book, O(logn).n是treemap的大小.

    Space: O(n).

    AC Java:

     1 class MyCalendar {
     2     TreeMap<Integer, Integer> tm;
     3     
     4     public MyCalendar() {
     5         tm = new TreeMap<Integer, Integer>();
     6     }
     7     
     8     public boolean book(int start, int end) {
     9         Integer prev = tm.floorKey(start);
    10         Integer next = tm.ceilingKey(start);
    11         
    12         if((prev==null || tm.get(prev)<=start) && (next==null || end<=next)){
    13             tm.put(start, end);
    14             return true;
    15         }
    16            
    17         return false;   
    18     }
    19 }
    20 
    21 /**
    22  * Your MyCalendar object will be instantiated and called as such:
    23  * MyCalendar obj = new MyCalendar();
    24  * boolean param_1 = obj.book(start,end);
    25  */

    跟上My Calendar IIMy Calendar III.

  • 相关阅读:
    2014年广州区域赛k题解
    2014年广州区域赛e题解
    2014年广州区域赛i题解
    最大化平均值问题
    codeforces 976e 题解
    maven
    机器学习入门
    拟合
    插值
    熵权法
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/8310531.html
Copyright © 2011-2022 走看看