[leetcode]56. Merge Intervals(Java)

最新推荐文章于 2022-07-22 11:38:00 发布

JacobGo

最新推荐文章于 2022-07-22 11:38:00 发布

阅读量796

点赞数

分类专栏： leetcode 文章标签： Merge Intervals leetcode

本文链接：https://blog.csdn.net/zjkC050818/article/details/73734445

版权

leetcode 专栏收录该内容

130 篇文章 0 订阅

订阅专栏

本文介绍了一种有效的合并区间算法，并提供了详细的Java实现代码。通过排序和遍历的方式，该算法可以将一系列可能存在重叠的区间合并为最简形式。文章包含两个版本的实现，旨在帮助读者理解并掌握这一常见面试题的解决方案。

摘要由CSDN通过智能技术生成

https://leetcode.com/problems/merge-intervals/#/description

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].

Java Code:

package go.jacob.day626;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class Demo3 {
	/*
	 * Runtime: 25 ms.Your runtime beats 83.79 % of java submissions.
	 * 参考自：@danchou 
	 */
	public List<Interval> merge(List<Interval> intervals) {
		Collections.sort(intervals, new Comparator<Interval>() {
			@Override
			public int compare(Interval obj0, Interval obj1) {
				return obj0.start - obj1.start;
			}
		});

		List<Interval> ret = new ArrayList<>();
		Interval prev = null;
		for (Interval inter : intervals) {
			if (prev == null || inter.start > prev.end) {
				ret.add(inter);
				prev = inter;
			} else if (inter.end > prev.end) {
				// Modify the element already in list
				prev.end = inter.end;
			}
		}
		return ret;
	}

	/*
	 * 首先对intervals中的元素进行排序(按start升序) 然后循环判断能否增加end
	 * 
	 * Runtime: 27 ms.Your runtime beats 68.55 % of java submissions.
	 */
	public List<Interval> merge_byme(List<Interval> intervals) {
		List<Interval> res = new ArrayList<Interval>();

		if (intervals == null)
			return res;
		// 对intervals中元素进行排序
		Collections.sort(intervals, new Comparator<Interval>() {

			@Override
			public int compare(Interval i1, Interval i2) {
				return i1.start - i2.start;
			}
		});

		int index = 0;
		while (index < intervals.size()) {
			Interval temp1 = intervals.get(index);
			while (index != intervals.size() - 1) {
				Interval temp2 = intervals.get(index + 1);
				if (temp2.start <= temp1.end) {
					index++;
					if (temp2.end > temp1.end) {
						temp1.end = temp2.end;
					}
				} else
					break;
			}
			res.add(temp1);
			index++;
		}
		return res;
	}
}

class Interval {
	int start;
	int end;

	Interval() {
		start = 0;
		end = 0;
	}

	Interval(int s, int e) {
		start = s;
		end = e;
	}
}