# 间隔问题2 [No. 57]

771人阅读 评论(0)

	/*
* s1: start point of interval 1
* e1: end point of interval 1
* s2: start point of interval 2
* e2: end point of interval 2
*/
public boolean overlap(int s1, int e1, int s2, int e2) {
return Math.max(s1, s2) < Math.min(e1, e2);
}

public class Test {
//check whether the two intervals intersect
public boolean overlap(Interval i1, Interval i2) {
return Math.max(i1.start, i2.start) < Math.min(i1.end, i2.end);
}

//merge the intervals and return a new interval list without overlapping
public void merge(ArrayList<Interval> list) {
int currentPosition = 0;
for (int i = 1; i < list.size(); i++) {
//no intersection
if (overlap(list.get(i), list.get(currentPosition)) == false) {
currentPosition++;
} else {
//get the new interval
int start = Math.min(list.get(i).start, list.get(currentPosition).start);
int end = Math.max(list.get(i).end, list.get(currentPosition).end);
Interval interval = new Interval(start, end);
list.remove(currentPosition);
}
}

int size = list.size();
for (int i = currentPosition + 1; i < size; i++) {
list.remove(currentPosition + 1);
}
}

public static void main(String[] args) {
ArrayList<Interval> list = new ArrayList<Interval>();

Collections.sort(list);

new Test().merge(list);
for(Interval inter : list) {
System.out.println("[" + inter.start + ", " + inter.end + "]");
}
}
}

class Interval implements Comparable<Interval>{
int start;
int end;

Interval(int start, int end) {
this.start = start;
this.end = end;
}

public int compareTo(Interval o) {
if (start > ((Interval)o).start ||
(start == ((Interval)o).start && end > ((Interval)o).end)) {
return 1;
} else if (start == ((Interval)o).start && end == ((Interval)o).end) {
return 0;
}
return -1;
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：613212次
• 积分：6463
• 等级：
• 排名：第3890名
• 原创：122篇
• 转载：21篇
• 译文：0篇
• 评论：172条
文章分类
评论排行
最新评论