《中英双解》leetcode Merge Intervals(合并区间)

56. Merge Intervals

Medium

10516454Add to ListShare

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Example 1:

Input: intervals = [[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: intervals = [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.

Constraints:

• 1 <= intervals.length <= 104
• intervals[i].length == 2
• 0 <= starti <= endi <= 104

Accepted

1,151,455

Submissions

2,650,214

这一题我们先看看第一种思路的解决方法，大家都能看出来的是每个元素的第二位，只要大于他下一位元素的第一位就可以进行重叠了。

所以，这个时候，我们需要对二维数组中的元素进行排序，这里涉及到一个Comparator接口的用法。还有对于集合排序的用法，下面我们来看看代码。

class Solution {
    public int[][] merge(int[][] intervals) {
      if(intervals.length <= 1){
         return intervals   
      }
      //对集合进行排序
      Arrays.sort(intervals,new Comparator<int[]>{
         public int compare(int[] a,int[] b){
            return a[0] - b[0];//升序
         }
      });
      
      List<int[]> result = new ArrayList<>();
      int[] newInterval = intervals[0];
      result.add(newInterval);
      
      for(int[] interval : intervals){
         if(interval[0] <= newInterval[1]){
            newInterval[1] = Math.max(interval[1],newInterval[1]);
         } else {
            newInterval = interval;
            result.add(newInterval);
         }
      }
      return result.Array(new int[result.size()][]);
   }
}

 链表

public int[][] merge(int[][] intervals) {
        Arrays.sort(intervals, Comparator.comparingInt(i -> i[0]));
        LinkedList<int[]> merged = new LinkedList<>();
        for (int[] i : intervals)
            if (!merged.isEmpty() && merged.getLast()[1] >= i[0])
                merged.getLast()[1] = Math.max(merged.getLast()[1], i[1]);
            else merged.add(i);
        return merged.toArray(new int[0][]);
    }