#352 Leetcode Data Stream as Disjoint Intervals Solution in C, C++, Java, JavaScript, Python, C# Leetcode

#1 Code Example with Javascript Programming

Code - Javascript Programming

var SummaryRanges = function() {
  this.intervals = []
}

SummaryRanges.prototype.addNum = function(val) {
  const current = [val, val]
  const intervals = this.intervals
  const less = []
  const more = []
  for (let vals of intervals) {
    if (vals[0] > current[1] + 1) {
      more.push(vals)
    } else if (vals[1] + 1 < current[0]) {
      less.push(vals)
    } else {
      current[0] = Math.min(current[0], vals[0])
      current[1] = Math.max(current[1], vals[1])
    }
  }
  this.intervals = [...less, current, ...more]
}

SummaryRanges.prototype.getIntervals = function() {
  return this.intervals
}

Input

#2 Code Example with Python Programming

Code - Python Programming

class SummaryRanges:

    def __init__(self):
        self.starts, self.ends, self.used = [-float("inf"), float("inf")], [-float("inf"), float("inf")], set()
        
    def addNum(self, val):
        if val not in self.used:
            self.used.add(val)
            i = bisect.bisect_left(self.starts, val) - 1
            if self.ends[i] + 1 == val and val + 1 == self.starts[i + 1]: # if val is the gap btw 2 intervals
                del self.starts[i + 1]
                del self.ends[i]
            elif self.ends[i] + 1 == val: #if val is adjacent to current end
                self.ends[i] += 1
            elif self.starts[i + 1] == val + 1: # if val is adjacent to next start
                self.starts[i + 1] -= 1
            elif val > self.ends[i]: # if val is independent of those 2 intervals
                self.starts.insert(i + 1, val) 
                self.ends.insert(i + 1, val)
            
    def getIntervals(self):

Input

Output

#3 Code Example with C# Programming

Code - C# Programming

using System;
using System.Collections.Generic;
using System.Linq;

namespace LeetCode
{
    public class _0352_DataStreamAsDisjointIntervals
    {
        private readonly SortedDictionary < int, int[]> map;

        /** Initialize your data structure here. */
        public _0352_DataStreamAsDisjointIntervals()
        {
            map = new SortedDictionary<int, int[]>();
        }

        public void AddNum(int val)
        {
            if (map.ContainsKey(val)) return;

            var keys = map.Keys.ToArray();
            var indexHi = Array.BinarySearch(keys, val);
            indexHi = ~indexHi;
            var indexLo = indexHi - 1;
            if (indexLo >= 0 && indexLo  <  keys.Length && indexHi < keys.Length && map[keys[indexLo]][1] + 1 == val && keys[indexHi] == val + 1)
            {
                map[keys[indexLo]][1] = map[keys[indexHi]][1];
                map.Remove(keys[indexHi]);
            }
            else if (indexLo >= 0 && indexLo  <  keys.Length && map[keys[indexLo]][1] + 1 >= val)
                map[keys[indexLo]][1] = Math.Max(map[keys[indexLo]][1], val);
            else if (indexHi < keys.Length && keys[indexHi] == val + 1)
            {
                map[val] = new int[] { val, map[keys[indexHi]][1] };
                map.Remove(keys[indexHi]);
            }
            else
                map[val] = new int[] { val, val };
        }

        public int[][] GetIntervals()
        {
            return map.Values.ToArray();
        }
    }

}

Input

Output