class Solution(object):
def merge(self, intervals):
"""
:type intervals: List[List[int]]
:rtype: List[List[int]]
"""
ans = []
if intervals is None or 0 == len(intervals):
return []
intervals = sorted(intervals, key=lambda x: x[0])
ans.append(intervals[0])
for i in range(1, len(intervals)):
start, end = intervals[i]
# cur box start postion less than end of last box in the ans
if start <= ans[-1][1]:
last_box = ans.pop()
last_box[0] = min(last_box[0], start)
last_box[1] = max(last_box[1], end)
ans.append(last_box)
else:
ans.append(intervals[i])
return ans
class Solution(object): def merge(self, intervals): """ :type intervals: List[List[int]] :rtype: List[List[int]] """ ans = [] if intervals is None or 0 == len(intervals): return [] int
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
