Given a collection of intervals, merge all overlapping intervals.
Example 1:
Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:
Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.
class Solution {
public int[][] merge(int[][] intervals) {
}
}
給一些數(shù)囚衔，合并所有相交的集合。
解：
也不知道給的集合有木有序，如果能先排個(gè)序贞间，然后遍歷比較相鄰兩個(gè)集合惶凝，就知道能不能合并了瞒斩。
