LeetCode 56. Merge Intervals - Python

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.

[maged_helmy]

class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:

intervals.sort(key=lambda x:x[0])

non_overlapping_array = []

for i in intervals:

if not non_overlapping_array or non_overlapping_array[-1][-1] < i[0]:


else:
non_overlapping_array[-1][-1] = max(non_overlapping_array[-1][-1], i[-1])



return non_overlapping_array