Add solution #352

Author: JoshCrozier

README.md

@@ -235,6 +235,7 @@
 347|[Top K Frequent Elements](./0347-top-k-frequent-elements.js)|Medium|
 349|[Intersection of Two Arrays](./0349-intersection-of-two-arrays.js)|Easy|
 350|[Intersection of Two Arrays II](./0350-intersection-of-two-arrays-ii.js)|Easy|
+352|[Data Stream as Disjoint Intervals](./0352-data-stream-as-disjoint-intervals.js)|Hard|
 367|[Valid Perfect Square](./0367-valid-perfect-square.js)|Easy|
 371|[Sum of Two Integers](./0371-sum-of-two-integers.js)|Medium|
 372|[Super Pow](./0372-super-pow.js)|Medium|

solutions/0352-data-stream-as-disjoint-intervals.js

@@ -0,0 +1,46 @@
+/**
+ * 352. Data Stream as Disjoint Intervals
+ * https://leetcode.com/problems/data-stream-as-disjoint-intervals/
+ * Difficulty: Hard
+ *
+ * Given a data stream input of non-negative integers a1, a2, ..., an, summarize the
+ * numbers seen so far as a list of disjoint intervals.
+ *
+ * Implement the SummaryRanges class:
+ * - SummaryRanges() Initializes the object with an empty stream.
+ * - void addNum(int value) Adds the integer value to the stream.
+ * - int[][] getIntervals() Returns a summary of the integers in the stream currently as
+ *   a list of disjoint intervals [starti, endi]. The answer should be sorted by starti.
+ */
+
+var SummaryRanges = function() {
+  this.list = [];
+};
+
+/**
+ * @param {number} value
+ * @return {void}
+ */
+SummaryRanges.prototype.addNum = function(value) {
+  this.list[value] = true;
+};
+
+/**
+ * @return {number[][]}
+ */
+SummaryRanges.prototype.getIntervals = function() {
+  const result = [];
+
+  for (let i = 0; i < this.list.length; i++) {
+    if (this.list[i]) {
+      let j = i;
+      while (this.list[j]) {
+        j++;
+      }
+      result.push([i, j - 1]);
+      i = j;
+    }
+  }
+
+  return result;
+};