Commit 75e5c30

authored

Merge pull request youngyangyang04#1241 from TingFeng-Git/master

更新 0435 无重叠区间 java版本右边界解法中排序的判断逻辑

2 parents adac0c7 + f9146a3 commit 75e5c30Copy full SHA for 75e5c30

File tree

-2

lines changed

-2

lines changed

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -184,13 +184,14 @@ public:`
`184`	`184`	`class Solution {`
`185`	`185`	`public int eraseOverlapIntervals(int[][] intervals) {`
`186`	`186`	`Arrays.sort(intervals, (a, b) -> {`
`187`		`- if (a[0] == a[0]) return a[1] - b[1];`
`188`		`- return a[0] - b[0];`
	`187`	`+ // 按照区间右边界升序排序`
	`188`	`+ return a[1] - b[1];`
`189`	`189`	`});`
`190`	`190`
`191`	`191`	`int count = 0;`
`192`	`192`	`int edge = Integer.MIN_VALUE;`
`193`	`193`	`for (int i = 0; i < intervals.length; i++) {`
	`194`	`+ // 若上一个区间的右边界小于当前区间的左边界,说明无交集`
`194`	`195`	`if (edge <= intervals[i][0]) {`
`195`	`196`	`edge = intervals[i][1];`
`196`	`197`	`} else {`

Comments

(0)