10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T432,import java.util.TreeMap; class SummaryRanges { TreeMap intervals; public SummaryRanges() { intervals = new TreeMap<>(); } public void addNum(int value) { if (intervals.containsKey(value)) return; Integer l = intervals.lowerKey(value); Integer h = intervals.higherKey(value); if (l != null && intervals.get(l)[1] >= value) { return; } boolean mergeL = l != null && intervals.get(l)[1] + 1 == value; boolean mergeH = h != null && h - 1 == value; if (mergeL && mergeH) { intervals.get(l)[1] = intervals.get(h)[1]; intervals.remove(h); } else if (mergeL) { intervals.get(l)[1] = value; } else if (mergeH) { intervals.put(value, new int[]{value, intervals.get(h)[1]}); intervals.remove(h); } else { intervals.put(value, new int[]{value, value}); } } public int[][] getIntervals() { return intervals.values().toArray(new int[0][]); } }13:T42a,#include #include using namespace std; class SummaryRanges { private: struct IntervalCompare { bool operator()(const vector& a, const vector& b) const { return a[0] < b[0]; } }; set, IntervalCompare> intervals; public: SummaryRanges() {} void addNum(int value) { auto it = intervals.lower_bound({value, value}); int start = value, end = value; if (it != intervals.begin()) { auto prev_it = prev(it); if ((*prev_it)[1] >= value) { return; } if ((*prev_it)[1] + 1 == value) { start = (*prev_it)[0]; intervals.erase(prev_it); } } if (it != intervals.end() && (*it)[0] - 1 == value) { end = (*it)[1]; intervals.erase(it); } intervals.insert({start, end}); } vector> getIntervals() { return vector>(intervals.begin(), intervals.end()); } };14:T50e,class SummaryRanges { constructor() { this.intervals = []; } addNum(value) { let left = 0, right = this.intervals.length - 1; let insertIdx = this.intervals.length; while (left <= right) { let mid = Math.floor((left + right) / 2); if (this.intervals[mid][0] >= value) { insertIdx = mid; right = mid - 1; } else { left = mid + 1; } } const prevIdx = insertIdx - 1; if (prevIdx >= 0 && this.intervals[prevIdx][1] >= value) { return; } const mergeLeft = prevIdx >= 0 && this.intervals[prevIdx][1] + 1 === value; const mergeRight = insertIdx < this.intervals.length && this.intervals[insertIdx][0] - 1 === value; if (mergeLeft && mergeRight) { this.intervals[prevIdx][1] = this.intervals[insertIdx][1]; this.intervals.splice(insertIdx, 1); } else if (mergeLeft) { this.intervals[prevIdx][1] = value; } else if (mergeRight) { this.intervals[insertIdx][0] = value; } else { this.intervals.splice(insertIdx, 0, [value, value]); } } getIntervals() { return this.intervals; } }

Time Complexity

Space Complexity