56. Merge Intervals (M)

关注

原创最新推荐文章于 2026-06-30 00:00:00 发布 217 阅读 AI 写同款· GEO 优化 ›

手把手教你学Simulink——基础电机控制场景实例：基于Simulink的永磁同步发电机温度场耦合仿真摘要：本文详细介绍了基于Simulink的永磁同步发电机(PMSG)电-热耦合仿真方法。通过Simscape Electrical搭建含热端口的PMSG模型，结合集总参数热网络(LPTN)实现损耗计算与温度反馈，分析了过载工况下温升对电阻和永磁体性能的影响。仿真结果表明：150%过载20秒会导致绕组温升132°C，电阻增加42%，磁链衰减10.5%。文章还提供了自然冷却与强迫风冷的对比数据，并建议通过多物理场耦合仿真预防实机过热问题。该方法可有效支撑高功率密度电机热设计，避免永磁体退磁风险。阅读详情

Merge Intervals (M)

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.

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

题意

将给定数组中所有互相重叠的区间合并为一个大区间。

思路

将区间按照左端点值排序后进行处理。

代码实现 - Java

class Solution {
    public int[][] merge(int[][] intervals) {
        if (intervals.length == 0) {
            return new int[][]{};
        }
        Arrays.sort(intervals, new Comparator<int[]>() {
            @Override
            public int compare(int[] a, int[] b) {
                return a[0] - b[0];
            }
        });
        List<int[]> list = new ArrayList<>();
        int left = intervals[0][0], right = intervals[0][1];
        for (int i = 1; i < intervals.length; i++) {
            int[] interval = intervals[i];
            if (left <= interval[1] && right >= interval[0]) {
                left = Math.min(left, interval[0]);
                right = Math.max(right, interval[1]);
            } else {
                list.add(new int[]{left, right});
                left = interval[0];
                right = interval[1];
            }
        }
        list.add(new int[]{left, right});
        return list.toArray(new int[list.size()][]);
    }
}

代码实现 - JavaScript

var merge = function(intervals) {
    let ans = [];
    if (intervals.length == 0) {
        return ans;
    }
    intervals.sort((a, b) => a[0] - b[0]);
    let left = intervals[0][0], right = intervals[0][1];
    for (let interval of intervals) {
        if (left <= interval[1] && right >= interval[0]) {
            left = Math.min(left, interval[0]);
            right = Math.max(right, interval[1]);
        } else {
            ans.push([left, right]);
            left = interval[0];
            right = interval[1];
        }
    }
    ans.push([left, right]);
    return ans;
};