class Solution(object):
def merge(self, intervals):
"""
:type intervals: List[List[int]]
:rtype: List[List[int]]
"""
intervals.sort(key=lambda x: x[0])
ans = []
for i in intervals:
if ans and i[0] <= ans[-1][1]:
ans[-1][1] = max(ans[-1][1], i[1])
else:
ans.append(i)
return ans