三天一题-38-Merge Intervals

题目地址：Merge Intervals
Given a collection of intervals, merge all overlapping intervals.
Example 1:
Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:
Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.

//答案借鉴：https://leetcode.com/problems/merge-intervals/discuss/21222/A-simple-Java-solution
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class MergeIntervals {
    public static int[][] merge(int[][] intervals) {
        List<int[]> res = new ArrayList<>();
        int nums =0;
        //首先进行排序
        Arrays.sort(intervals, (i1, i2) -> Integer.compare(i1[0], i2[0]));
        int[] temp = intervals[0];
        for (int[] interval:intervals) {
            if(interval[0] <= temp[1]){
                temp[1]=Math.max(interval[1],temp[1]);
            }else{
                temp = interval;
                res.add(temp);
            }
        }
        return res.toArray(new int[res.size()][]);
    }
    public static void main(String[] args) {

       int[][] arr ={{8,9},{1,3},{2,6},{5,7}};
        int[][] res = merge(arr);
        System.out.println(res);
    }
}