[LeetCode]56 Merge Intervals

/**
* 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<Interval> merge(List<Interval> inputIntervals)
{
// Sort
List<Interval> intervals = new ArrayList<>(inputIntervals);
Collections.sort(intervals, new Comparator<Interval>()
{
public int compare(Interval a, Interval b)
{
return Integer.compare(a.start, b.start);
}
});

int i = 0;
while (i < intervals.size() - 1)
{
Interval a = intervals.get(i);
Interval b = intervals.get(i + 1);
if (overlap(a, b))
{
merge(a, b);
intervals.remove(i + 1);
}
else
{
i ++;
}
}
return intervals;
}

private boolean overlap(Interval a, Interval b)
{
return !(a.start > b.end || b.start > a.end);
}

// Merge b into a.
private void merge(Interval a, Interval b)
{
a.start = Math.min(a.start, b.start);
a.end = Math.max(a.end, b.end);
}
}