1
0
0

LeetCode56-合并区间

文章摘要
|

思路,先给左端点排序,排完序后我们只需要判断前一个区间的右端点和后一个区间的左端点大小关系即可

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

支持与分享

如果这篇文章对你有帮助,欢迎分享给更多人或者给予支持!

评论