Force buckle 729 My schedule I

subject

Achieve one MyCalendar Class to store your schedule . If the schedule to be added does not cause Repeat Booking , You can store this new schedule .

When there is some time overlap between the two schedules （ For example, both schedules are in the same time ）, It will produce Repeat Booking .

The schedule can use a pair of integers start and end Express , The time here is a half open interval , namely [start, end), The set of real Numbers x For the range of , start <= x < end .

Realization MyCalendar class ：

MyCalendar() Initialize calendar object .
boolean book(int start, int end) If the schedule can be successfully added to the calendar without causing duplicate bookings , return true . otherwise , return false And don't add the schedule to the calendar .

Example

Input ：
[“MyCalendar”, “book”, “book”, “book”]
[[], [10, 20], [15, 25], [20, 30]]
Output ：
[null, true, false, true]

explain ：
MyCalendar myCalendar = new MyCalendar();
myCalendar.book(10, 20); // return True
myCalendar.book(15, 25); // return False , This schedule cannot be added to the calendar , Because of time 15 Has been booked by another schedule .
myCalendar.book(20, 30); // return True , This schedule can be added to the calendar , Because the first schedule is booked at less than each time 20 , And does not include time 20 .

source ： Power button （LeetCode）
link ：https://leetcode.cn/problems/my-calendar-i
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

Method 1： simulation

Java Realization

class MyCalendar {
    
    List<int[]> list;
    public MyCalendar() {
    
        list = new ArrayList<>();
    }
    
    public boolean book(int start, int end) {
    
        end--; //
        for (int[] var : list) {
    
            int l = var[0], r = var[1];
            if (start > r || end < l) continue;
            return false;
        }
        list.add(new int[]{
    start, end});
        return true;
    }
}