update: 56

Author: hijiangtao

README.md

@@ -37,6 +37,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |49|[Group Anagrams](https://leetcode.com/problems/anagrams/) | [JavaScript](./src/anagrams/res.js)|Medium|
 |54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [JavaScript](./src/spiral-matrix/res.js)|Medium|
 |55|[Jump Game](https://leetcode.com/problems/jump-game/) <sup>*</sup> | [JavaScript](./src/jump-game/res.js)|Medium|
+|56|[Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [JavaScript](./src/merge-intervals/res.js)|Medium|
 |57|[Insert Interval](https://leetcode.com/problems/insert-interval/) | [JavaScript](./src/insert-interval/res.js)|Hard|
 |66|[Plus One](https://leetcode.com/problems/plus-one/) | [JavaScript](./src/plus-one/res.js)|Easy|
 |69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/) | [JavaScript](./src/sqrtx/res.js)|Easy|

src/merge-intervals/res.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[][]} intervals
+ * @return {number[][]}
+ */
+var merge = function(intervals) {
+  intervals.sort((a, b) => a[0]-b[0]);
+  const len = intervals.length;
+  
+  res = [];
+  i = 0;
+  while (i < len) {
+    let [left, right] = intervals[i];
+    while (i < len-1 && intervals[i+1][0] <= right) {
+      i += 1;
+      right = Math.max(intervals[i][1], right);
+    }
+    res.push([left, right]);
+    i += 1;
+  }
+
+  return res;
+
+};