Merge Intervals(Medium)

Merge Intervals by LeetCode
java编写
public List merge(List intervals) {
if (intervals.size() <= 1)
return intervals;

// Sort by ascending starting point using an anonymous Comparator
intervals.sort((i1, i2) -> Integer.compare(i1.start, i2.start));

List<Interval> result = new LinkedList<Interval>();
int start = intervals.get(0).start;
int end = intervals.get(0).end;

for (Interval interval : intervals) {
    if (interval.start <= end) // Overlapping intervals, move the end if needed
        end = Math.max(end, interval.end);
    else {                     // Disjoint intervals, add the previous one and reset bounds
        result.add(new Interval(start, end));
        start = interval.start;
        end = interval.end;
    }
}

// Add the last interval
result.add(new Interval(start, end));
return result;

}
讲道理，现在越往后面做，越看不懂题目的意思，即使给我例子，但是我还是看不懂是什么原因，然后按照自己的想法写出来也不对，以上是参考答案，我看着答案，然后发现他所写的跟我理解的完全不一样，所以不知道是不是我练了太少的原因，继续加油吧。