/*
Author: King, [email protected]
Date: Dec 20, 2014
Problem: Merge Intervals
Difficulty: Medium
Source: https://oj.leetcode.com/problems/merge-intervals/
Notes:
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. Sort in ascending order of 'start'.
2. Traverse the 'intervals', merge or push...
*/
/**
* 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