feat: add typescript solution to lc problem: No.0435.Non-overlapping Intervals (doocs#576)

Author: zhaocchen

solution/0400-0499/0435.Non-overlapping Intervals/README.md

@@ -103,6 +103,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function eraseOverlapIntervals(intervals: number[][]): number {
+    let n = intervals.length;
+    if (n == 0) return 0;
+    intervals.sort((a, b) => a[1] - b[1]);
+    let end = intervals[0][1], ans = 0;
+    for (let i = 1; i < n; ++i) {
+        let cur = intervals[i];
+        if (end > cur[0]) {
+            ans++;
+        } else {
+            end = cur[1];
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0400-0499/0435.Non-overlapping Intervals/README_EN.md

@@ -86,6 +86,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function eraseOverlapIntervals(intervals: number[][]): number {
+    let n = intervals.length;
+    if (n == 0) return 0;
+    intervals.sort((a, b) => a[1] - b[1]);
+    let end = intervals[0][1], ans = 0;
+    for (let i = 1; i < n; ++i) {
+        let cur = intervals[i];
+        if (end > cur[0]) {
+            ans++;
+        } else {
+            end = cur[1];
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0400-0499/0435.Non-overlapping Intervals/Solution.ts

@@ -0,0 +1,15 @@
+function eraseOverlapIntervals(intervals: number[][]): number {
+    let n = intervals.length;
+    if (n == 0) return 0;
+    intervals.sort((a, b) => a[1] - b[1]);
+    let end = intervals[0][1], ans = 0;
+    for (let i = 1; i < n; ++i) {
+        let cur = intervals[i];
+        if (end > cur[0]) {
+            ans++;
+        } else {
+            end = cur[1];
+        }
+    }
+    return ans;
+};