合并区间

问题描述

给出一个区间的集合，请合并所有重叠的区间。

示例 1:

输入: [[1,3],[2,6],[8,10],[15,18]]
输出: [[1,6],[8,10],[15,18]]
解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6].

示例 2:

输入: [[1,4],[4,5]]
输出: [[1,5]]
解释: 区间 [1,4] 和 [4,5] 可被视为重叠区间。

class Solution {

    
    public static int[][] merge(int[][] nums){
        if(null == nums || nums.length == 0){
            return new int[0][0];
        }

        quickSort(nums, 0, nums.length - 1);
        LinkedList<Integer> stack = new LinkedList<Integer>();
        for(int i = 0; i < nums.length; i++){
            if(stack.isEmpty() || stack.peek() < nums[i][0]){
                stack.push(nums[i][0]);
                stack.push(nums[i][1]);
            }else if(stack.peek() < nums[i][1]){
                stack.pop();
                stack.push(nums[i][1]);
            }
        }

        int[][] result = new int[stack.size() / 2][2];
        int index = 0;
        while(!stack.isEmpty()){
            result[index][1] = stack.pop();
            result[index++][0] = stack.pop();
        }

        return result;
    }


    private static void quickSort(int[][] nums, int begin, int end){
        if(end <= begin){
            return;
        }

        int partition = partition(nums, begin, end);

        quickSort(nums, begin, partition - 1);
        quickSort(nums, partition + 1, end);
    }

    private static int partition(int[][] nums, int begin, int end){
        int[] left = nums[begin];

        while(begin < end){
            while(begin < end  && nums[end][0] >= left[0]){
                end--;
            }
            nums[begin] = nums[end];
            while(begin < end && nums[begin][0] <= left[0]){
                begin++;
            }
            nums[end] = nums[begin];
        }

        nums[begin] = left;
        return begin;
    }
}