Insert Interval LeetCode solution in Python

1
# Runtime: 202 ms (Top 7.96%) | Memory: 17.3 MB (Top 91.79%)
2
class Solution:
3
    def insert(
4
        self, intervals: List[List[int]], newInterval: List[int]
5
    ) -> List[List[int]]:
6

7
        intervals.append(newInterval)
8
        intervals.sort(key=lambda x: x[0])
9

10
        result = []
11
        for interval in intervals:
12
            if not result or result[-1][1] < interval[0]:
13
                result.append(interval)
14
            else:
15
                result[-1][1] = max(result[-1][1], interval[1])
16

17
        return result