[daily training] 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 .

Tips ：
0 <= start < end <= 10⁹
Each test case , call book The maximum number of methods is 1000 Time .

Code

package dayLeetCode;

import java.util.ArrayList;
import java.util.List;

public class dayleetcode729 {
    
    List<int[]> booked;

    public dayleetcode729() {
    
        booked = new ArrayList<>();
    }

    public boolean book(int start, int end) {
    
        for (int[] arr : booked){
    
            //  There is intersection 
            if (arr[0] < end && start < arr[1]){
    
                return false;
            }
        }
        booked.add(new int[]{
    start, end});
        return true;
    }

}