Leetcode_56_合并区间_贪心

和之前acm那道一天内看最多的电视节目差不多

// 冲刺033
class Solution {
    public int[][] merge(int[][] intervals) {
        Arrays.sort(intervals, Comparator.comparingInt(o -> o[0]));
        int len = intervals.length;
        List<int[]> ans = new LinkedList<>();
        for (int i = 0; i < len; i++) {
            int index = i;
            while (i < len - 1 && intervals[index][1] >= intervals[i + 1][0]) {
                intervals[index][1] = Math.max(intervals[index][1], intervals[i + 1][1]);
                i++;
            }
            ans.add(intervals[index]);
        }
        return ans.toArray(new int[ans.size()][2]);
    }
}