253. Meeting Rooms II

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference rooms required.

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

将所有的start和end分别存储并排序，解题关键思路：一间会议室，只有结束之后才能用，一个会议开始之前，需要有一个会议结束，才能用这间会议室，否则就要多加一间。代码如下：

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public int minMeetingRooms(Interval[] intervals) {
        int[] start = new int[intervals.length];
        int[] end = new int[intervals.length];
        for (int i = 0; i < intervals.length; i++) {
            start[i] = intervals[i].start;
            end[i] = intervals[i].end;
        }
        Arrays.sort(start);
        Arrays.sort(end);
        int room = 0, endRoom = 0;
        for (int i = 0; i < start.length; i++) {
            if (start[i] < end[endRoom]) {
                room ++;
            } else {
                endRoom ++;
            }
        }
        return room;
    }
}