Leetcode #252. Meeting Rooms

[yokostan]

class Solution {
    public boolean canAttendMeetings(int[][] intervals) {
        if (intervals == null || intervals.length == 0 || intervals[0].length == 0) return true;
        int[] start = new int[intervals.length];
        int[] end = new int[intervals.length];

        for (int i = 0; i < intervals.length; i++) {
            start[i] = intervals[i][0];
            end[i] = intervals[i][1];
        }

        Arrays.sort(start);
        Arrays.sort(end);

        for (int i = 1; i < intervals.length; i++) {
            if (start[i] < end[i - 1]) return false;
        }
        return true;
    }

}