Merge Intervals

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

violet_program

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

阅读量512

点赞数

CC 4.0 BY-SA版权

分类专栏： Interval

本文链接：https://blog.youkuaiyun.com/violet_program/article/details/9052809

Interval 专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一种使用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 ArrayList<Interval> merge(ArrayList<Interval> intervals) {
		// Start typing your Java solution below
		// DO NOT write main() function
		int size = intervals.size();
		ArrayList<Interval> res = new ArrayList<Interval>();
		if(size < 1)
			return res;
		Interval[] intervals_array = new Interval[size];
		for(int i = 0; i < size; i++){
			intervals_array[i] = intervals.get(i);
		}
		Arrays.sort(intervals_array, comp);
		Interval cur = intervals_array[0];
		Interval next;
		for(int i = 1; i < size; i++){
			next = intervals_array[i];
			if(next.start > cur.end){
				res.add(new Interval(cur.start, cur.end));
				cur = next;
			}
			else{
				cur.end = cur.end > next.end ? cur.end : next.end;
			}
		}
		res.add(new Interval(cur.start, cur.end));
		return res;
	}

	public static Comparator<Interval> comp = new Comparator<Interval>() {
		public int compare(Interval i1, Interval i2) {
			if (i1.start > i2.start)
				return 1;
			else if (i1.start == i2.start)
				return 0;
			else
				return -1;
		}
	};
}