https://leetcode.cn/problems/SsGoHC/

排序

非常妙！顺便复习了一下Comparator接口自定义排序。

image.png

  1. public static int[][] merge(int[][] intervals) {
  2.     if (intervals.length == 0) {
  3.         return new int[0][2];
  4.     }
  6.     Arrays.sort(intervals, new Comparator<int[]>() {
  7.         @Override
  8.         public int compare(int[] o1, int[] o2) {
  9.             return o1[0] - o2[0];
  10.         }
  11.     });
  13.     ArrayList<int[]> merged = new ArrayList<>();
  14.     for (int i = 0; i < intervals.length; i++) {
  15.         int L = intervals[i][0];
  16.         int R = intervals[i][1];
  17.         if (merged.size() == 0 || L > merged.get(merged.size() - 1)[1]) {
  18.             merged.add(new int[]{L, R});
  19.         } else {
  20.             merged.get(merged.size() - 1)[1] = Math.max(merged.get(merged.size() - 1)[1], R);
  21.         }
  22.     }
  23.     return merged.toArray(new int[merged.size()][]);
  24. }