Leetcode Problem 57. Insert Interval

57. Insert Interval

Leetcode Solutions

Linear Insertion and Merging of Intervals

  1. Initialize an empty list result to store the final merged intervals.
  2. Iterate through each interval interval in intervals.
    • If interval ends before newInterval starts, add interval to result.
    • Else, if interval starts after newInterval ends, add newInterval to result and update newInterval to interval.
    • Otherwise, there is an overlap, so update newInterval to be the merged interval of newInterval and interval.
  3. After the loop, add the remaining newInterval to result as it might not have been added inside the loop.
  4. Return result.
UML Thumbnail

Binary Search Insertion and Merging of Intervals

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...