LeetCode Top 100 Liked Questions 56. Merge Intervals (Java版; Medium)

welcome to my blog

LeetCode Top 100 Liked Questions 56. Merge Intervals (Java版; Medium)

题目描述

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.

第二次做; 核心: 1) 对二维数组按照左边界排序; 2)选定一个区间, 和另外一个区间进行比较; 3)循环结束后要单独处理最后一个区间 4)用lambda表达式写比较器

class Solution {
    public int[][] merge(int[][] intervals) {
        List<int[]> list = new  ArrayList<>();
        if(intervals.length<=1){
            return intervals;
        }
        //按照左边界排序
        //Arrays.sort(intervals, (a,b)->a[0]-b[0]); lambda表达式写法
        Arrays.sort(intervals, new Comparator<int[]>(){
            public int compare(int[] o1, int[] o2){
                return o1[0] - o2[0];
            }
        });

        int[] cur = intervals[0];
        for(int i=1; i<intervals.length; i++){
            int[] cur2 = intervals[i];
            //不相交
            if(cur[1]<cur2[0] || cur[0]>cur2[1]){
                list.add(cur);
                cur = cur2;
            }
            //相交
            else{
                cur[0] = Math.min(cur[0], cur2[0]);
                cur[1] = Math.max(cur[1], cur2[1]);
            }
        }
        list.add(cur);
        int[][] res = new int[list.size()][];
        for(int i=0; i<res.length; i++){
            res[i] = list.get(i);
        }
        return res;
    }
}

第一次做, 每一次只比较两个; 可以确定的是, 对于一个区间, 左侧的值小于右侧的值; 处理之前得先按照每个区间的首元素排序

import java.util.ArrayList;
import java.util.Comparator;
import java.util.Arrays;

class Solution {
    public int[][] merge(int[][] intervals) {
        if(intervals==null || intervals.length==0 || intervals[0].length!=2)
            return intervals;
        //按照第一个元素排序
        Arrays.sort(intervals, new Comparator<int[]>(){
            public int compare(int[] o1, int[] o2){
                return o1[0] - o2[0];
            }
        });

        //因为不知道融合后最终有多少个结果, 所以用ArrayList存结果, 最后再转成数组
        ArrayList<int[]> res = new ArrayList<>();
        int[] arr = intervals[0];
        for(int i=1; i<intervals.length; i++){
            //没有重叠
            if(arr[1] < intervals[i][0] || arr[0] > intervals[i][1]){
                res.add(new int[]{arr[0], arr[1]});
                arr = intervals[i];
            }
            //有重叠
            else{
                int left = Math.min(arr[0], intervals[i][0]);
                int right = Math.max(arr[1], intervals[i][1]);
                //有重叠的时候不加到res
                arr = new int[]{left, right};
            }
        }
        //最后的arr还没有加入到res中,清算一下
        res.add(new int[]{arr[0], arr[1]});
        //转成二维数组
        int[][] result = new int[res.size()][2];
        for(int i=0; i<res.size(); i++){
            result[i][0] = res.get(i)[0];
            result[i][1] = res.get(i)[1];
        }
        return result;
    }
}

题解的写法, 主要是看看Arrays.sort(intervals, (a, b) -> a[0] - b[0]); 和 res.toArray(new int[0][]);

class Solution {
    public int[][] merge(int[][] intervals) {
        List<int[]> res = new ArrayList<>();
        if (intervals.length == 0 || intervals == null) return res.toArray(new int[0][]);
        Arrays.sort(intervals, (a, b) -> a[0] - b[0]);
        int i = 0;
        while (i < intervals.length) {
            int left = intervals[i][0];
            int right = intervals[i][1];
            while (i < intervals.length - 1 && intervals[i + 1][0] <= right) {
                i++;
                right = Math.max(right, intervals[i][1]);
            }
            res.add(new int[]{left, right});
            i++;
        }
        return res.toArray(new int[0][]);
    }
}