Given an array of meeting time intervals consisting of start and end times[[s1,e1],[s2,e2],...](si< ei), determine if a person could attend all meetings.
[[s1,e1],[s2,e2],...]
Example 1:
Input: [[0,30],[5,10],[15,20]] Output: false
Example 2:
Input: [[7,10],[2,4]] Output: true
False condition is:
intervals[i].end > intervals[i + 1].start
Array的自定义排序:
Arrays.sort(intervals, new Comparator<Interval>() { public int compare(Interval i1, Interval i2) { return i1.start - i2.start; } });
class Solution { public boolean canAttendMeetings(Interval[] intervals) { Arrays.sort(intervals, new Comparator<Interval>() { public int compare(Interval i1, Interval i2) { return i1.start - i2.start; } }); for (int i = 0; i < intervals.length - 1; i++) { if (intervals[i].end > intervals[i + 1].start) return false; } return true; } }
Last updated 5 years ago