LeetCode第56题 Merge Intervals

1.题意

Given a collection of intervals, merge all overlapping intervals.

2.示例

输入: [[1,3],[2,6],[8,10],[15,18]]
输出: [[1,6],[8,10],[15,18]]
解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6]

3.题解

class Solution {
    public int[][] merge(int[][] intervals) {
        if(intervals.length <= 1 )
            return intervals;
        //按升序对起点进行排序
        Arrays.sort(intervals,(i1, i2) -> Integer.compare(i1[0], i2[0]));

        List<int[]> result = new ArrayList<>();
        int[] newInterval = intervals[0];
        result.add(newInterval);
        for(int[] interval : intervals){
            if(interval[0] <= newInterval[1])
                newInterval[1] = Math.max(newInterval[1],interval[1]);
            else{
                newInterval = interval;
                result.add(newInterval);
            }
        }

        return result.toArray(new int[result.size()][]);


    }
}

4.知识点

使用Java 8 Lambda表达式对List进行排序

参考：

https://leetcode-cn.com/problems/merge-intervals/

https://leetcode.com/problems/merge-intervals/discuss/21222/A-simple-Java-solution

https://www.baeldung.com/java-8-sort-lambda