题目:
给出若干闭合区间,合并所有重叠的部分。
给出的区间列表 => 合并后的区间列表:
[ [
[1, 3], [1, 6],
[2, 6], => [8, 10],
[8, 10], [15, 18]
[15, 18] ]
]
思路:说不出来。
代码:
/**
* Definition of Interval:
* public class Interval {
* int start, end;
* Interval(int start, int end) {
* this.start = start;
* this.end = end;
* }
*/
class Solution {
/**
* @param intervals, a collection of intervals
* @return: A new sorted interval list.
*/
public List<Interval> merge(List<Interval> intervals) {
// write your code here
if(intervals == null || intervals.size()<=0)
return intervals;
Collections.sort(intervals,new IntervalComparator());
List<Interval> result = new ArrayList<Interval>();
Interval last = intervals.get(0);
for(int i=0;i<intervals.size();i++){
Interval curt = intervals.get(i);
if(curt.start<=last.end){
last.end = Math.max(last.end,curt.end);
}else{
result.add(last);
last = curt;
}
}
result.add(last);
return result;
}
private class IntervalComparator implements Comparator<Interval>{
public int compare(Interval a,Interval b){
return a.start - b.start;
}
}
};
感想:这道题我认为很难,我想了好久没想出来一个能a的算法,后来看了一篇博客也是迷迷糊糊,写上过了,也就没管了,可现在感觉还是迷糊,感觉思想清楚,就是好多语句不太懂。