Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
lhp-1
class Solution: def merge(self, intervals: List[List[int]]) -> List[List[int]]: intervals = sorted(intervals)//按区间左端点大小进行排序 j = 0 result = [] if len(intervals)==0://如果intervals为空,返回空值 return result elif len(intervals)==1://如果intervals只含有一个区间,不需合并,返回intervals return intervals result.append([intervals[0][0],intervals[0][1]])//先将intervals的第一个元素赋给result length = len(intervals) for i in range(1,length)://遍历intervals if result[j][1]>=intervals[i][0]://满足合并条件 result[j][1] = max(result[j][1],intervals[i][1]) else://不满足合并条件,把intervals的这个元素直接添加到result的末位,成为下一个比较的元素 result.append([intervals[i][0],intervals[i][1]]) j += 1 return result
run
|
edit
|
history
|
help
0
Lesson8
Lesson 9
String Toggling
Python
binarySearch.py
pytest
количество 1 и 0 в последовательности чисел до n
Lab_I_1_25_11_2020
Magic Calendar of any month
Hesap makinesi