snippets
filter:96 snippets
py-lc-mergeintervals·python·leetcode
class Solution:
def merge(self, intervals):
intervals.sort()
out = []
for start, end in intervals:
if out and start <= out[-1][1]:
out[-1][1] = max(out[-1][1], end)
else:
out.append([start, end])
return out
py-lc-mergeintervals·python·leetcode
class Solution:
def merge(self, intervals):
intervals.sort()
out = []
for start, end in intervals:
if out and start <= out[-1][1]:
out[-1][1] = max(out[-1][1], end)
else:
out.append([start, end])
return out