原題鏈接在這里：https://leetcode.com/problems/meeting-rooms/

題目：

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.

For example,
Given?[[0, 30],[5, 10],[15, 20]],
return?false.

題解：

對array進行排序，從i = 1開始判斷start是否在前一個end之前, 若是就return false. 完成loop返回true.

Time Complexity: O(nlogn). Space: O(1).

AC Java:

1 /** 2 * Definition for an interval. 3 * public class Interval { 4 * int start; 5 * int end; 6 * Interval() { start = 0; end = 0; } 7 * Interval(int s, int e) { start = s; end = e; } 8 * } 9 */ 10 public class Solution { 11 public boolean canAttendMeetings(Interval[] intervals) { 12 if(intervals == null || intervals.length == 0){ 13 return true; 14 } 15 Arrays.sort(intervals, new Comparator<Interval>(){ 16 public int compare(Interval i1, Interval i2){ 17 if(i1.start == i2.start){ 18 return i1.end - i2.end; 19 } 20 return i1.start - i2.start; 21 } 22 }); 23 24 for(int i = 1; i<intervals.length; i++){ 25 if(intervals[i].start < intervals[i-1].end){ 26 return false; 27 } 28 } 29 return true; 30 } 31 }

?跟上Meeting Rooms II

轉載于:https://www.cnblogs.com/Dylan-Java-NYC/p/5206592.html

總結

以上是生活随笔為你收集整理的LeetCode 252. Meeting Rooms的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。