My Calendar I

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.

A 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.

思路：标准扫描线算法，比treemap慢点；每次都要nlogn的排序；

class MyCalendar {
    
    public class Node {
        public int time;
        public int flag;
        public Node(int time, int flag) {
            this.time = time;
            this.flag = flag;
        }
    }

    private List<Node> list;
    public MyCalendar() {
        this.list = new ArrayList<Node>();
    }
    
    public boolean book(int start, int end) {
        Node startNode = new Node(start, 1);
        Node endNode = new Node(end, -1);
        list.add(startNode);
        list.add(endNode);
        
        Collections.sort(list, (a, b) -> {
            if(a.time != b.time) {
                return a.time - b.time;
            } else {
                return a.flag - b.flag;
            }
        });
        
        int count = 0;
        for(Node n: list) {
            if(n.flag == 1) {
                count++;
            } else {
                count--;
            }
            if(count >= 2) {
                list.remove(startNode);
                list.remove(endNode);
                return false;
            }
        }
        return true;
    }
}

/**
 * Your MyCalendar object will be instantiated and called as such:
 * MyCalendar obj = new MyCalendar();
 * boolean param_1 = obj.book(start,end);
 */

思路：用treemap去存所有之前的 (start, end) ， key is start, end is value; 那么就按照start自然的进行sort,每次加入是logn的操作；然后treemap,  有floorKey 和ceilingKey的操作，分别也是logn, 判断一下 (floorkey, flookey_value)  (start, end) (ceilingkey, ceilingkey_value)是否有重合；log(n)

class MyCalendar {

    TreeMap<Integer, Integer> treemap;
    public MyCalendar() {
        this.treemap = new TreeMap<>();
    }
    
    // (floorkey, floorvalue), (start, end), (ceilingkey, ceilingvalue);
    public boolean book(int start, int end) {
        Integer floorkey = treemap.floorKey(start);
        if(floorkey != null && treemap.get(floorkey) > start) {
            return false;
        }
        Integer ceilingkey = treemap.ceilingKey(start);
        if(ceilingkey != null && end > ceilingkey) {
            return false;
        }
        treemap.put(start, end);
        return true;
    }
}

/**
 * Your MyCalendar object will be instantiated and called as such:
 * MyCalendar obj = new MyCalendar();
 * boolean param_1 = obj.book(start,end);
 */