Solution: Data Stream as Disjoint Intervals
Understand how to summarize a stream of non-negative integers into disjoint intervals by merging and updating intervals efficiently. Learn to implement a data structure that dynamically manages intervals as new numbers arrive, ensuring compact and sorted interval storage. This lesson helps you solve interval pattern problems commonly seen in coding interviews.
We'll cover the following...
Statement
You are given a stream of non-negative integers
Your task is to implement the Summary Ranges class, where:
Constructor: Initializes the Summary Ranges object with an empty stream.
Add Num(int value): Adds the integer
valueto the stream.Get Intervals(): Returns the current summary of numbers as a list of disjoint intervals
[start_i, end_i], sorted bystart_i.
Note: Each number belongs to exactly one interval. Intervals must merge whenever new numbers connect or extend existing ones, and duplicate insertions should not affect the summary.
Constraints:
value...