252J. Meeting Rooms

https://leetcode.com/problems/meeting-rooms/

Trivial

水 秒之

class Solution {
    public boolean canAttendMeetings(int[][] intervals) {
        if(intervals.length < 1) return true;
        Arrays.sort(intervals,(a,b) -> a[0] - b[0]);
        for(int i = 1; i < intervals.length; i++){
            if(intervals[i][0] < intervals[i-1][1]){
                return false;
            }
        }
        return true;
    }
}