leetcode hot 15

合集 - leetcode hot100(25)

1.leetcode hot 0102-152.leetcode hot 0202-153.leetcode hot 0402-164.leetcode hot 0302-155.leetcode hot 0502-176.leetcode hot 0602-197.leetcode hot 0702-208.leetcode hot 0802-219.leetcode hot 0902-2110.leetcode hot 1002-2411.leetcode hot 1202-2512.leetcode hot 1302-2613.leetcode hot 1402-28

14.leetcode hot 1503-01

15.leetcode hot 1103-0316.leetcode hot 1603-0317.leetcode hot 1703-0318.leetcode hot 1803-0319.leetcode hot 1903-0420.leetcode hot 2003-0521.leetcode hot 2103-0522.leetcode hot 2203-1223.leetcode hot 2303-1224.leetcode hot 2403-1225.leetcode hot 2503-12

收起

解题思路：思路还是比较清晰，先按照起始位置排序，然后再逐个遍历，根据起始位置与前一个结束位置进行比较，两种情况进行处理即可(这边代码比较麻烦因为前面list泛型用错了)

import java.util.Arrays;
class Solution {
    public int[][] merge(int[][] intervals) {
        List<List<Integer>> list = new ArrayList<>(); 
        Arrays.sort(intervals, (int[] a,int[] b)->{
            return Integer.compare(a[0], b[0]);
        });
        int left = intervals[0][0];
        int right = intervals[0][1];
        for(int i=0;i<intervals.length;i++){
            if(intervals[i][0]>right){
                int[] l = {left,right};
                list.add(Arrays.asList(left, right));
                left = intervals[i][0];
                right = intervals[i][1];
            }else{
                right = Math.max(right,intervals[i][1]);
            }
        }
        list.add(Arrays.asList(left, right));
        int[][] res = new int[list.size()][2];
        for(int i=0;i<list.size();i++){
            res[i][0] = list.get(i).get(0);
            res[i][1] = list.get(i).get(1);
        }
        return res;
    }
}