Solution: Data Stream as Disjoint Intervals
Explore how to implement a data structure that summarizes a stream of non-negative integers into sorted, disjoint intervals. Understand how to add new numbers efficiently by merging intervals when necessary and retrieving the current list of intervals. This lesson helps you master interval manipulation techniques and develop optimal solutions for stream data problems.
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:
...