56合并区间

56

class Solution {
    public int[][] merge(int[][] intervals) {
        Arrays.sort(intervals, (o1,o2) -> o1[0]-o2[0]);
        int[][] res = new int[intervals.length][2];
        int idx = 0;
        for(int[] interval: intervals){
            if(idx == 0 || interval[0] > res[idx-1][1]){
                res[idx++] = interval;
            }else{
                res[idx-1][1] = Math.max(res[idx-1][1],interval[1]); 
            }
        }
        return Arrays.copyOf(res, idx);
    }
}