Merge Intervals

最新推荐文章于 2024-01-11 13:27:32 发布

原创最新推荐文章于 2024-01-11 13:27:32 发布 · 181 阅读

0 ·

CC 4.0 BY-SA版权

sort 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种有效的合并区间算法，该算法能够将一系列可能存在重叠的区间合并为最小数量的不重叠区间。通过排序和遍历的方式，文章详细解释了如何实现这一算法，并提供了完整的Java代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],

return [1,6],[8,10],[15,18].

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public List<Interval> merge(List<Interval> intervals) {
        
        ArrayList<Interval> result = new ArrayList<Interval>();
        if (intervals == null || intervals.size() <= 1)
            return intervals;
            
        Comparator<Interval> comp = new Comparator<Interval>() {
            public int compare(Interval i1, Interval i2) {
                return i1.start - i2.start;
            }
        };
        Collections.sort(intervals, comp);
        
        result.add(intervals.get(0));
        for (int i = 1; i < intervals.size(); i++) {
            if (result.get(result.size() - 1).end >= intervals.get(i).start) {
                result.get(result.size() - 1).end = Math.max(intervals.get(i).end, result.get(result.size() - 1).end);
            } else {
                result.add(intervals.get(i));
            }
        }
        
        
        return result;
    }
    
}