CPMagical CP Library

Problem solution · Python

Data Stream as Disjoint Intervals

Data Stream as Disjoint Intervals: a Python solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Direct simulation
Source
walkccc LeetCode Solutions
Length
46 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For Data Stream as Disjoint Intervals, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 46 lines of Python from the credited upstream file 352.py.
  • The implementation visibly relies on sequence storage.
  • No explicit loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeData Stream as Disjoint Intervals · PythonPython
Use this to learn the idea, then write your own version.
from sortedcontainers import SortedDict  class SummaryRanges:  def __init__(self):    self.intervals = SortedDict()  # {start: (start, end)}   def addNum(self, val: int) -> None:    if val in self.intervals:      return     lo = self._lowerKey(val)    hi = self._higherKey(val)     # {lo, map[lo][1]} + val + {hi, map[hi][1]} = {lo, map[hi][1]}    if lo >= 0 and hi >= 0 and self.intervals[lo][1] + 1 == val and val + 1 == hi:      self.intervals[lo][1] = self.intervals[hi][1]      del self.intervals[hi]      # {lo, map[lo][1]} + val = {lo, val}      # Prevent adding duplicate entry by using '>=' instead of '=='.    elif lo >= 0 and self.intervals[lo][1] + 1 >= val:      self.intervals[lo][1] = max(self.intervals[lo][1], val)    elif hi >= 0 and val + 1 == hi:      # val + {hi, map[hi][1]} = {val, map[hi][1]}      self.intervals[val] = [val, self.intervals[hi][1]]      del self.intervals[hi]    else:      self.intervals[val] = [val, val]   def getIntervals(self) -> list[list[int]]:    return list(self.intervals.values())   def _lowerKey(self, key: int):    """Returns the maximum key in `self.intervals` < `key`."""    i = self.intervals.bisect_left(key)    if i == 0:      return -1    return self.intervals.peekitem(i - 1)[0]   def _higherKey(self, key: int):    """Returns the minimum key in `self.intervals` < `key`."""    i = self.intervals.bisect_right(key)    if i == len(self.intervals):      return -1    return self.intervals.peekitem(i)[0]

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗