merge intervals solution

Author: chapse57

merge-intervals/Chapse57.py

@@ -0,0 +1,15 @@
+class Solution:
+    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
+        # O(nlogn)
+
+        intervals.sort(key = lambda i : i[0])
+        output = [intervals[0]]
+
+        for start , end in intervals[1:]:
+            lastEnd = output[-1][1]  #last end value
+            if start <= lastEnd:
+                output[-1][1] = max(lastEnd, end)
+            else:
+                output.append([start, end])
+        return output
+