Create Merge Intervals - Leetcode 56.py

Author: gahogg

Merge Intervals - Leetcode 56.py

@@ -0,0 +1,14 @@
+class Solution:
+    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
+        intervals.sort(key=lambda interval: interval[0])
+        merged = []
+
+        for interval in intervals:
+            if not merged or merged[-1][1] < interval[0]:
+                merged.append(interval)
+            else:
+                merged[-1] = [merged[-1][0], max(merged[-1][1], interval[1])]
+        
+        return merged
+        # Time: O(n log n)
+        # Space: O(n)