57. 插入区间

最新推荐文章于 2024-09-28 22:05:59 发布

void1024

最新推荐文章于 2024-09-28 22:05:59 发布

阅读量258

点赞数 5

分类专栏：面试经典 150 题文章标签：算法深度优先数据结构 leetcode java

本文链接：https://blog.csdn.net/diOSyu/article/details/140562745

版权

面试经典 150 题专栏收录该内容

132 篇文章 1 订阅

订阅专栏

class Solution {
    public int[][] insert(int[][] intervals, int[] newInterval) {
        int[][] tmp = new int[intervals.length + 1][2];
        System.arraycopy(intervals, 0, tmp, 0, intervals.length);
        tmp[intervals.length] = newInterval;
        return merge(tmp);
    }

    public int[][] merge(int[][] intervals) {
        int n = intervals.length;
        if (n == 1) {
            return intervals;
        }
        Arrays.sort(intervals, new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                if (o1[0] == o2[0]) {
                    return o1[1] - o2[1];
                }
                return o1[0] - o2[0];
            }
        });
        List<int[]> lst = new ArrayList<>();
        int i = 0;
        while (i < n) {
            int[] ai = intervals[i];
            int j = i + 1, li = ai[0], ri = ai[1];
            while (j < n) {
                int[] aj = intervals[j];
                if (ri >= aj[0]) {
                    ri = Math.max(aj[1], ri);
                } else {
                    break;
                }
                j++;
            }
            i = j;
            lst.add(new int[]{li, ri});
        }
        int[][] result = new int[lst.size()][2];
        for (int j = 0; j < lst.size(); j++) {
            result[j] = lst.get(j);
        }
        return result;
    }
}