首页 > 代码库 > [Leetcode] Merge Intervals
[Leetcode] Merge Intervals
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].
Solution:
1 /** 2 * Definition for an interval. 3 * public class Interval { 4 * int start; 5 * int end; 6 * Interval() { start = 0; end = 0; } 7 * Interval(int s, int e) { start = s; end = e; } 8 * } 9 */10 public class Solution {11 static public class MyCompare implements Comparator<Interval> {12 @Override13 public int compare(Interval o1, Interval o2) {14 // TODO Auto-generated method stub15 if (o1.start != o2.start)16 return o1.start < o2.start ? -1 : 1;17 else if (o1.end != o2.end)18 return o1.end < o2.end ? -1 : 1;19 else20 return 0;21 }22 }23 24 public List<Interval> merge(List<Interval> intervals) {25 List<Interval> result = new ArrayList<Interval>();26 27 if (intervals.size() == 0)28 return result;29 if (intervals.size() == 1)30 return intervals;31 32 Collections.sort(intervals, new MyCompare());33 Interval last=intervals.get(0);34 int N=intervals.size();35 for(int i=1;i<N;++i){36 if(intervals.get(i).start>last.end){37 result.add(new Interval(last.start,last.end));38 last=intervals.get(i);39 }else{40 last.end=Math.max(intervals.get(i).end, last.end);41 }42 }43 result.add(last);44 return result;45 }46 }
[Leetcode] Merge Intervals
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。