LeetCode – Meeting Rooms (Java)
Given an array of meeting time intervals consisting of start and end times [s1, e1], [s2, e2], ... , determine if a person could attend all meetings.
For example,
Given [ [0, 30], [5, 10], [15, 20] ],
return false.
Java Solution
If a person can attend all meetings, there must not be any overlaps between any meetings. After sorting the intervals, we can compare the current end and next start.
public boolean canAttendMeetings(Interval[] intervals) { Arrays.sort(intervals, new Comparator<Interval>(){ public int compare(Interval a, Interval b){ return a.start-b.start; } }); for(int i=0; i<intervals.length-1; i++){ if(intervals[i].end>intervals[i+1].start){ return false; } } return true; } |
<pre><code> String foo = "bar"; </code></pre>