mirror of
https://github.com/prdlk/leetcode.git
synced 2026-11-02 13:12:44 +00:00
feat(work): implement insert interval solution
This commit is contained in:
1 parent
cd9aef1229
commit
b76b199b17
1 file changed
+23
-2
@@ -55,6 +55,27 @@ Constraints:
|
||||
• 0 <= start <= end <= 10^5
|
||||
"""
|
||||
|
||||
class Solution:
|
||||
def insert(self, intervals: list[list[int]], newInterval: list[int]) -> list[list[int]]:
|
||||
|
||||
class Solution:
|
||||
def insert(
|
||||
self, intervals: list[list[int]], newInterval: list[int]
|
||||
) -> list[list[int]]:
|
||||
result = []
|
||||
i, n = 0, len(intervals)
|
||||
start, end = newInterval
|
||||
|
||||
# Everything before
|
||||
while i < n and intervals[i][1] < start:
|
||||
result.append(intervals[i])
|
||||
i += 1
|
||||
|
||||
# Everything merged
|
||||
while i < n and intervals[i][0] <= end:
|
||||
start = min(start, intervals[i][0])
|
||||
end = max(end, intervals[i][1])
|
||||
i += 1
|
||||
result.append([start, end])
|
||||
|
||||
# Everything after
|
||||
result.extend(intervals[i:])
|
||||
return result
|
||||
Reference in new issue
Block a user