打卡题目:leetcode第57题,插入区间
相似题目:56
【代码】
class Solution:def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:intervals.append(newInterval)intervals = sorted(intervals, key=lambda x:(x[0], x[1]))index = 0while index<len(intervals)-1:# 合并删除if intervals[index][1]>=intervals[index+1][0]:intervals[index][1] = max(intervals[index][1], intervals[index+1][1])intervals.pop(index+1)else:index += 1return intervals
