合并区间(56)力扣

最新推荐文章于 2024-09-15 11:04:13 发布

Daydreamer10

最新推荐文章于 2024-09-15 11:04:13 发布

阅读量81

点赞数

分类专栏： LeetCode 文章标签： leetcode 数据结构算法

本文链接：https://blog.csdn.net/m0_53924828/article/details/128394198

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

题目描述

以数组 intervals 表示若干个区间的集合，其中单个区间为 intervals[i] = [starti, endi]。

请你合并所有重叠的区间，并返回一个不重叠的区间数组，该数组需恰好覆盖输入中的所有区间。

示例 1：

输入：intervals = [[1,3],[2,6],[8,10],[15,18]]

输出：[[1,6],[8,10],[15,18]]

解释：区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6].

示例 2：

输入：intervals = [[1,4],[4,5]]

输出：[[1,5]]

解释：区间 [1,4] 和 [4,5] 可被视为重叠区间。

提示：

1 <= intervals.length <= 104

intervals[i].length == 2

0 <= starti <= endi <= 104

排序法（时间复杂度为O(NlogN)，空间复杂度为O(N)）

java实现

import java.util.ArrayList;
import java.util.Arrays;
class Solution {
    public int[][] merge(int[][] intervals) {
        ArrayList<int[]> result=new ArrayList();
        if(intervals==null||intervals.length<2)
        {
            return intervals;
        }
        
        //sort intervals based on the first element
        Arrays.sort(intervals,(a,b)->a[0]-b[0]); //此步骤时间复杂度为O(NlogN)
        for(int[] interval:intervals) //此步骤时间复杂度为O(N)
        {
            if(result.size()==0||interval[0]>result.get(result.size()-1)[1])
            {
                result.add(interval);
            }
            else
            {
                result.get(result.size()-1)[1]=Math.max(result.get(result.size()-1)[1],
                interval[1]);
            }
        }
        return result.toArray(new int[result.size()][2]);
    }
}

Python实现

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        if len(intervals)<2:
            return intervals
        result=[]
        
        #sort intervals based on the first element
        intervals.sort(key=lambda x:x[0])  #此步骤时间复杂度为O(NlogN)
        for interval in intervals:  #此步骤时间复杂度为O(N)
            #if nothing in result, we should add current interval into result, because the interval is the first interval
            #if current interval start time larger than previous end time, it means there is no overlap between two intervals, we should add current interval into result
            if len(result)==0 or interval[0]>result[-1][1]:
                result.append(interval)
            else:
                #otherwise, if current interval start time smaller than previous end time, it means there is a overlap between two intervals, we need to merge the two intervals into one interval
                result[-1][1]=max(result[-1][1],interval[1])
        return result