0729-my-calendar-i

Try it on leetcode

Description

You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking.

A double booking happens when two events have some non-empty intersection (i.e., some moment is common to both events.).

The event can be represented as a pair of integers startTime and endTime that represents a booking on the half-open interval [startTime, endTime), the range of real numbers x such that startTime <= x < endTime.

Implement the MyCalendar class:

• MyCalendar() Initializes the calendar object.
• boolean book(int startTime, int endTime) Returns 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.

 

Example 1:

Input
["MyCalendar", "book", "book", "book"]
[[], [10, 20], [15, 25], [20, 30]]
Output
[null, true, false, true]

Explanation
MyCalendar myCalendar = new MyCalendar();
myCalendar.book(10, 20); // return True
myCalendar.book(15, 25); // return False, It can not be booked because time 15 is already booked by another event.
myCalendar.book(20, 30); // return True, The event can be booked, as the first event takes every time less than 20, but not including 20.

 

Constraints:

• 0 <= start < end <= 109
• At most 1000 calls will be made to book.

Solution(Python)

from sortedcontainers import SortedList

class MyCalendar:
    def __init__(self):
        self.Naivecalendar = []
        self.sortedCalnder = SortedList()

    def book(self, start, end):
        return self.sorting(start, end)
    
    # Time Complexity: O(N**2)
    # Spac complexity: O(N)
    def naive(self, start, end):
        for s, e in self.Naivecalendar:
            if s < end and start < e:
                return False
        self.Naivecalendar.append((start, end))
        return True

    # Time Complexity: O(NlogN)
    # Spac complexity: O(N)
    def sorting(self, start, end):
        idx = self.sortedCalnder.bisect_right((start, end))
        if (idx > 0 and self.sortedCalnder[idx-1][1] > start) or (idx < len(self.sortedCalnder) and self.sortedCalnder[idx][0] < end):
            return False
        self.sortedCalnder.add((start, end))
        return True

        

# Your MyCalendar object will be instantiated and called as such:
# obj = MyCalendar()
# param_1 = obj.book(startTime,endTime)