解题思路
遍历检测
代码
class MyCalendar {
Set<int[]> set;
public MyCalendar() {
set = new HashSet<>();
}
public boolean book(int start, int end) {
//区间[start,end)与[left,right)如果没有交集
//那么left>=end || right<=start
//如果有交集,那么 left<end && right>start
for (int[] ints : set) {
final int left = ints[0];
final int right = ints[1];
if (left<end && right>start){
return false;
}
}
set.add(new int[]{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);
*/