leetcode刷题（76）—— 56. 合并区间

//56. 合并区间
public class Solution56 {
    public static int[][] merge(int[][] intervals) {
        if (intervals.length == 0) {
            return intervals;
        }
        Arrays.sort(intervals, new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                return o1[0] - o2[0];
            }
        });
        int[][] result = new int[intervals.length][2];
        int currentPos = 0;
        result[0] = intervals[0];
        for (int i = 1; i < intervals.length; i++) {
            int leftEdge = intervals[i][0];
            if (leftEdge > result[currentPos][1]) {
                result[++currentPos] = intervals[i];
            } else {
                result[currentPos][1] = Math.max(result[currentPos][1], intervals[i][1]);
            }
        }
        return Arrays.copyOf(result, currentPos + 1);
    }
}

  if (intervals.length == 0) {
            return intervals;
        }