feat: Solve merge-intervals

Author: hu6r1s

merge-intervals/hu6r1s.py

@@ -0,0 +1,9 @@
+class Solution:
+    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
+        result = []
+        for interval in sorted(intervals):
+            if not result or result[-1][1] < interval[0]:
+                result.append(interval)
+            else:
+                result[-1][1] = max(result[-1][1], interval[1])
+        return result