Merge branch 'master' of github.com:youngyangyang04/leetcode-master

problems/0435.无重叠区间.md

@@ -184,13 +184,14 @@ public:
 class Solution {
     public int eraseOverlapIntervals(int[][] intervals) {
         Arrays.sort(intervals, (a, b) -> {
-            if (a[0] == a[0]) return a[1] - b[1];
-            return a[0] - b[0];
+            // 按照区间右边界升序排序
+            return a[1] - b[1];
         });
 
         int count = 0;
         int edge = Integer.MIN_VALUE;
         for (int i = 0; i < intervals.length; i++) {
+            // 若上一个区间的右边界小于当前区间的左边界，说明无交集
             if (edge <= intervals[i][0]) {
                 edge = intervals[i][1];
             } else {
@@ -263,7 +264,7 @@ func min(a,b int)int{
     }
     return a
 }
-``` 
+```
 
 ### Javascript:
 - 按右边界排序
@@ -306,6 +307,55 @@ var eraseOverlapIntervals = function(intervals) {
 }
 ```
 
+### TypeScript
+
+> 按右边界排序，从左往右遍历
+
+```typescript
+function eraseOverlapIntervals(intervals: number[][]): number {
+    const length = intervals.length;
+    if (length === 0) return 0;
+    intervals.sort((a, b) => a[1] - b[1]);
+    let right: number = intervals[0][1];
+    let count: number = 1;
+    for (let i = 1; i < length; i++) {
+        if (intervals[i][0] >= right) {
+            count++;
+            right = intervals[i][1];
+        }
+    }
+    return length - count;
+};
+```
+
+> 按左边界排序，从左往右遍历
+
+```typescript
+function eraseOverlapIntervals(intervals: number[][]): number {
+    if (intervals.length === 0) return 0;
+    intervals.sort((a, b) => a[0] - b[0]);
+    let right: number = intervals[0][1];
+    let tempInterval: number[];
+    let resCount: number = 0;
+    for (let i = 1, length = intervals.length; i < length; i++) {
+        tempInterval = intervals[i];
+        if (tempInterval[0] >= right) {
+            // 未重叠
+            right = tempInterval[1];
+        } else {
+            // 有重叠，移除当前interval和前一个interval中右边界更大的那个
+            right = Math.min(right, tempInterval[1]);
+            resCount++;
+        }
+    }
+    return resCount;
+};
+```
+
+
+
+
+
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>