花了7分钟写完答案,假定大家都是排序的。后来发现答案当中很多case是不排序的,所以又花了七八分钟查Comparator,写sort。所以实际面试的话,还是有可能在10分钟之内写完(可以推说comparator不记得,要求跳过)
这个题目的Tricky 地方就在于如果你要从后往前排(应该的),排序应该compare end而不是start,有了这一点就很容易了。否则这样的case就fail了
[2,3], [4,5], [6,7], [1, 10]
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) {
if (intervals == null || intervals.isEmpty()) {
return intervals;
}
Collections.sort(intervals, new Comparator<Interval>() {
@Override
public int compare(Interval i1, Interval i2) {
Integer s1 = (i1 == null ? Integer.MAX_VALUE : i1.end);
Integer s2 = (i2 == null ? Integer.MAX_VALUE : i2.end);
return s1.compareTo(s2);
}
});
Interval ti = null;
for (int i = intervals.size() - 1; i >= 0; i--) {
Interval in = intervals.get(i);
if (ti == null) {
ti = in;
intervals.remove(i);
} else {
if (hasOverlap(in, ti)) {
intervals.remove(i);
ti = mergeInterval(ti, in);
} else {
intervals.add(i + 1, ti);
ti = in;
intervals.remove(i);
}
}
}
if (ti != null) {
intervals.add(0, ti);
}
return intervals;
}
private boolean hasOverlap(Interval i1, Interval i2) {
if (i1 == null || i2 == null) {
return false;
}
return (i1.start - i2.end) * (i1.end - i2.start) <= 0;
}
private Interval mergeInterval(Interval i1, Interval i2) {
if (hasOverlap(i1, i2)) {
return new Interval(Math.min(i1.start, i2.start), Math.max(i2.end, i1.end));
}
return null;
}
}