See More

56. 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]. /** * 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 List merge(List intervals) { Collections.sort(intervals, new Comparator() { public int compare(Interval a, Interval b) { return a.start-b.start; } }); List res = new ArrayList(); int i=0; while(i