update: 57

Author: hijiangtao

.vscode/launch.json

@@ -0,0 +1,14 @@
+{
+  // 使用 IntelliSense 了解相关属性。 
+  // 悬停以查看现有属性的描述。
+  // 欲了解更多信息，请访问: https://go.microsoft.com/fwlink/?linkid=830387
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "type": "node",
+      "request": "launch",
+      "name": "启动程序",
+      "program": "${workspaceFolder}/src/insert-interval/res.js"
+    }
+  ]
+}

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|
+|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|
 |71|[Simplify Path](https://leetcode.com/problems/simplify-path/) | [JavaScript](./src/simplify-path/res.js)|Medium|

src/insert-interval/res.js

@@ -0,0 +1,39 @@
+/**
+ * @param {number[][]} intervals
+ * @param {number[]} newInterval
+ * @return {number[][]}
+ */
+var insert = function(intervals, newInterval) {
+  const len = intervals.length;
+  if (!len) return [newInterval];
+  const [start, end] = newInterval;
+  const new_itervals = [];
+  
+  let i = 0;
+  while (i < len && start > intervals[i][0]) {
+    new_itervals.push(intervals[i]);
+    i++;
+  }
+
+  new_itervals.push(newInterval);
+  while (i < len) {
+    new_itervals.push(intervals[i]);
+    i++;
+  }
+
+  console.log(new_itervals);
+  res = [];
+  i = 0;
+  while (i < len+1) {
+    let [left, right] = new_itervals[i];
+    while (i < len && new_itervals[i+1][0] <= right) {
+      i += 1;
+      right = Math.max(new_itervals[i][1], right);
+    }
+    res.push([left, right]);
+    i += 1;
+  }
+
+  return res;
+
+};