feat: add typescript solution to lc problem: No.0056.Merge Intervals (doocs#572)

Author: zhaocchen

solution/0000-0099/0056.Merge Intervals/README.md

@@ -113,6 +113,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function merge(intervals: number[][]): number[][] {
+    intervals.sort((a, b) => a[0] - b[0]);
+    let ans: number[][] = [];
+    let index: number = -1;
+    for (let interval of intervals) {
+        if (index == -1 || ans[index][1] < interval[0]) {
+            // 保留
+            ans.push(interval);
+            index++;
+        } else {
+            // 求交集
+            ans[index][1] = Math.max(ans[index][1], interval[1]);
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0000-0099/0056.Merge Intervals/README_EN.md

@@ -84,6 +84,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function merge(intervals: number[][]): number[][] {
+    intervals.sort((a, b) => a[0] - b[0]);
+    let ans: number[][] = [];
+    let index: number = -1;
+    for (let interval of intervals) {
+        if (index == -1 || ans[index][1] < interval[0]) {
+            // 保留
+            ans.push(interval);
+            index++;
+        } else {
+            // 求交集
+            ans[index][1] = Math.max(ans[index][1], interval[1]);
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0000-0099/0056.Merge Intervals/Solution.ts

@@ -0,0 +1,16 @@
+function merge(intervals: number[][]): number[][] {
+    intervals.sort((a, b) => a[0] - b[0]);
+    let ans: number[][] = [];
+    let index: number = -1;
+    for (let interval of intervals) {
+        if (index == -1 || ans[index][1] < interval[0]) {
+            // 保留
+            ans.push(interval);
+            index++;
+        } else {
+            // 求交集
+            ans[index][1] = Math.max(ans[index][1], interval[1]);
+        }
+    }
+    return ans;
+};