Commit 5e960b4

authored

Update 0435.无重叠区间.md

First java code not working, I test in the IntellJ with jdk 11, the Arrays.sort is not right ( doesn't make the left edge sort from small to big ), so the non overlapping area count fail. I fix it. Sort by end first, if end is same, sort by start

1 parent 6afccb6 commit 5e960b4Copy full SHA for 5e960b4

File tree

1 file changed

-7

lines changed

problems
- 0435.无重叠区间.md

1 file changed

-7

lines changed

`‎problems/0435.无重叠区间.md`

Lines changed: 7 additions & 7 deletions

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

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 5e960b4

File tree

1 file changed

1 file changed

`‎problems/0435.无重叠区间.md`

0 commit comments