leetcode729. My schedule 1

Problem description

Achieve one MyCalendar Class to store your schedule . If there is no other schedule for the time to be added , You can store this new schedule .

MyCalendar There is one book(int start, int end) Method . It means in start To end Add a schedule in time , Be careful , The time here is a half open interval , namely [start, end), The set of real Numbers x For the range of , start <= x < end.

When there is some time overlap between the two schedules （ For example, both schedules are in the same time ）, There will be repeat bookings .

Every time you call MyCalendar.book When the method is used , 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 .

Please follow the steps below to call MyCalendar class : 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

explain : 
The first schedule can be added to the calendar .  
The second schedule cannot be added to the calendar , Because of time 15 It has been scheduled by the first schedule .
The third schedule can be added to the calendar , Because the first schedule doesn't include time 20 .

explain :

Each test case , call MyCalendar.book The function is no more than 100 Time .
Call function MyCalendar.book(start, end) when , start and end The value range of is [0, 10^9].

 

import java.util.Comparator;
import java.util.Map;
import java.util.TreeMap;

public class MyCalendar1 {
    TreeMap<Integer, Integer> treeMap = null;

    public MyCalendar1() {
        treeMap = new TreeMap<>(Comparator.naturalOrder());
    }

    public boolean book(int start, int end) {
        if (end <= start) {
            return false;
        }

        for (Map.Entry<Integer, Integer> entry : treeMap.entrySet()) {
            if (start >= entry.getValue()) {
                break;
            }
            if(end <= entry.getKey()){
                continue;
            }

            if (start < entry.getValue() || end > entry.getKey()) {
                return false;
            }
        }

        treeMap.put(start, end);
        return true;
    }
}