algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0435.无重叠区间.md

Browse Source 
更新Java版本代码
This commit is contained in:
zhicheng lee
2022-01-23 22:59:59 +08:00
committed by GitHub
parent 3131e6ea18
commit b3078ef51c
1 changed files with 11 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
problems/0435.无重叠区间.md
View File

@ -183,28 +183,22 @@ public:
```java ```java
class Solution { class Solution {
public int eraseOverlapIntervals(int[][] intervals) { public int eraseOverlapIntervals(int[][] intervals) {
if (intervals.length < 2) return 0; Arrays.sort(intervals, (a, b) -> {
if (a[0] == a[0]) return a[1] - b[1];
Arrays.sort(intervals, new Comparator<int[]>() { return a[0] - b[0];
@Override
public int compare(int[] o1, int[] o2) {
if (o1[1] != o2[1]) {
return Integer.compare(o1[1],o2[1]);
} else {
return Integer.compare(o1[0],o2[0]);
}
}
}); });
int count = 1; int count = 0;
int edge = intervals[0][1]; int edge = Integer.MIN_VALUE;
for (int i = 1; i < intervals.length; i++) { for (int i = 0; i < intervals.length; i++) {
if (edge <= intervals[i][0]){ if (edge <= intervals[i][0]) {
count ++; //non overlap + 1
edge = intervals[i][1]; edge = intervals[i][1];
} else {
count++;
} }
} }
return intervals.length - count;
return count;
} }
} }
``` ```