algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #642 from hailincai/master

Browse Source 
Java code is not working under IntellJ with JDK11
This commit is contained in:
程序员Carl
2021-08-24 09:20:21 +08:00
committed by GitHub
parent acf1a54f8d dc3f73e4b4
commit 60ec1efc41
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -186,27 +186,27 @@ Java：
class Solution { class Solution {
public int eraseOverlapIntervals(int[][] intervals) { public int eraseOverlapIntervals(int[][] intervals) {
if (intervals.length < 2) return 0; if (intervals.length < 2) return 0;
Arrays.sort(intervals, new Comparator<int[]>() { Arrays.sort(intervals, new Comparator<int[]>() {
@Override @Override
public int compare(int[] o1, int[] o2) { public int compare(int[] o1, int[] o2) {
if (o1[0] != o2[0]) { if (o1[1] != o2[1]) {
return Integer.compare(o1[1],o2[1]); return Integer.compare(o1[1],o2[1]);
} else { } else {
return Integer.compare(o2[0],o1[0]); return Integer.compare(o1[0],o2[0]);
} }
} }
}); });
int count = 0; int count = 1;
int edge = intervals[0][1]; int edge = intervals[0][1];
for (int i = 1; i < intervals.length; i++) { for (int i = 1; i < intervals.length; i++) {
if (intervals[i][0] < edge) { if (edge <= intervals[i][0]){
count++; count ++; //non overlap + 1
} else {
edge = intervals[i][1]; edge = intervals[i][1];
} }
} }
return count; return intervals.length - count;
} }
} }
``` ```