Programming
Leetcode-252. Meeting Rooms
Given an array of meeting time intervals where intervals[i] = [starti, endi], determine if a person could attend all meetings.
Example 1:
Input: intervals = [[0,30],[5,10],[15,20]] Output: false
Example 2:
Input: intervals = [[7,10],[2,4]] Output: true
<解法>
class Solution {
public boolean canAttendMeetings(int[][] arr) {
Arrays.sort(arr, (a, b) -> Integer.compare(a[0], b[0]));
for (int i = 1; i < arr.length; i++) {
if (arr[i - 1][1] > arr[i][0])
return false;
}
return true;
}
}