会议室


/**
* https://leetcode-cn.com/problems/meeting-rooms/
*/
public class _252_会议室 {
public boolean canAttendMeetings(int[][] intervals) {
if (intervals == null || intervals.length == 0) return true;

// 按照会议的开始时间,从小到大排序
Arrays.sort(intervals, (m1, m2) -> m1[0] - m2[0]);

// 遍历每一个会议
for (int i = 1; i < intervals.length; i++) {
if (intervals[i][0] < intervals[i - 1][1]) return false;
}

return true;
}
}

posted @ 2021-07-06 14:42  syh-918  阅读(82)  评论(0)    收藏  举报