Python // 6 lines easy to understand // 60 ms // beats 96 %
\nclass Solution:\n    def insert(self, intervals, newInterval):\n        new, i = [], 0\n        for i, it in enumerate(intervals):\n            if newInterval
```\nclass Solution:\n    def insert(self, intervals, newInterval):\n        new, i = [], 0\n        for i, it in enumerate(intervals):\n            if newInterval.end < it.start: i -= 1; break\n            elif it.end < newInterval.start: new += it,\n            else: newInterval.start, newInterval.end = min(it.start, newInterval.start), max(it.end, newInterval.end)\n        return new + [newInterval] + intervals[i + 1:]\n```
[]