Add solution #56

Author: JoshCrozier

0056-merge-intervals.js

@@ -0,0 +1,29 @@
+/**
+ * 56. Merge Intervals
+ * https://leetcode.com/problems/merge-intervals/
+ * Difficulty: Medium
+ *
+ * Given an array of intervals where intervals[i] = [starti, endi], merge all
+ * overlapping intervals, and return an array of the non-overlapping intervals
+ * that cover all the intervals in the input.
+ */
+
+/**
+ * @param {number[][]} intervals
+ * @return {number[][]}
+ */
+var merge = function(intervals) {
+  intervals.sort(([a], [b]) => a - b);
+
+  const result = [intervals.shift()];
+  intervals.forEach(([first, second]) => {
+    const [, last] = result[result.length - 1];
+    if (first <= last) {
+      result[result.length - 1][1] = Math.max(second, last);
+    } else {
+      result.push([first, second]);
+    }
+  });
+
+  return result;
+};

README.md

@@ -61,6 +61,7 @@
 53|[Maximum Subarray](./0053-maximum-subarray.js)|Easy|
 54|[Spiral Matrix](./0054-spiral-matrix.js)|Medium|
 55|[Jump Game](./0055-jump-game.js)|Medium|
+56|[Merge Intervals](./0056-merge-intervals.js)|Medium|
 57|[Insert Interval](./0057-insert-interval.js)|Medium|
 58|[Length of Last Word](./0058-length-of-last-word.js)|Easy|
 59|[Spiral Matrix II](./0059-spiral-matrix-ii.js)|Medium|