Commit b3078ef

authored

Update 0435.无重叠区间.md

更新Java版本代码

1 parent 3131e6e commit b3078efCopy full SHA for b3078ef

File tree

+11

-17

lines changed

+11

-17

lines changed

Lines changed: 11 additions & 17 deletions

Original file line number	Diff line number	Diff line change
`@@ -183,28 +183,22 @@ public:`
`183`	`183`	```java
`184`	`184`	`class Solution {`
`185`	`185`	`public int eraseOverlapIntervals(int[][] intervals) {`
`186`		`- if (intervals.length < 2) return 0;`
`187`		`-`
`188`		`- Arrays.sort(intervals, new Comparator<int[]>() {`
`189`		`- @Override`
`190`		`- public int compare(int[] o1, int[] o2) {`
`191`		`- if (o1[1] != o2[1]) {`
`192`		`- return Integer.compare(o1[1],o2[1]);`
`193`		`- } else {`
`194`		`- return Integer.compare(o1[0],o2[0]);`
`195`		`- }`
`196`		`- }`
	`186`	`+ Arrays.sort(intervals, (a, b) -> {`
	`187`	`+ if (a[0] == a[0]) return a[1] - b[1];`
	`188`	`+ return a[0] - b[0];`
`197`	`189`	`});`
`198`	`190`
`199`		`- int count = 1;`
`200`		`- int edge = intervals[0][1];`
`201`		`- for (int i = 1; i < intervals.length; i++) {`
`202`		`- if (edge <= intervals[i][0]){`
`203`		`- count ++; //non overlap + 1`
	`191`	`+ int count = 0;`
	`192`	`+ int edge = Integer.MIN_VALUE;`
	`193`	`+ for (int i = 0; i < intervals.length; i++) {`
	`194`	`+ if (edge <= intervals[i][0]) {`
`204`	`195`	`edge = intervals[i][1];`
	`196`	`+ } else {`
	`197`	`+ count++;`
`205`	`198`	`}`
`206`	`199`	`}`
`207`		`- return intervals.length - count;`
	`200`	`+`
	`201`	`+ return count;`
`208`	`202`	`}`
`209`	`203`	`}`
`210`	`204`	```

Comments

(0)