Commit 7897a56

committed

cover max

1 parent 7e0ecc8 commit 7897a56Copy full SHA for 7897a56

File tree

-5

lines changed

-5

lines changed

Lines changed: 6 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -23,24 +23,25 @@ public static void main(String[] args) {`
`23`	`23`	`}`
`24`	`24`
`25`	`25`	`// 暴力解`
	`26`	`+ // 也可以通过牛客测试`
`26`	`27`	`// lines[i][0]: 第i条线的起始点`
`27`	`28`	`// lines[i][0]: 第i条线的终点`
`28`	`29`	`// 时间复杂度O(n*(max - min))`
`29`	`30`	`public static int maxCover(int[][] lines) {`
`30`		`- if(null == lines \|\| lines.length == 0) {`
	`31`	`+ if(null == lines \|\| lines.length < 1) {`
`31`	`32`	`return 0;`
`32`	`33`	`}`
`33`	`34`	`int min = lines[0][0];`
`34`	`35`	`int max = lines[0][1];`
`35`	`36`	`for (int i = 1; i < lines.length; i++) {`
`36`		`- min = Math.min(min, lines[i][0]);`
`37`		`- max = Math.max(max, lines[i][1]);`
	`37`	`+ min = Math.min(lines[i][0],min);`
	`38`	`+ max = Math.max(lines[i][1],max);`
`38`	`39`	`}`
`39`	`40`	`int maxCover = 0;`
`40`		`- for (int i = min; i <= max; i++) {`
	`41`	`+ for (int i = min; i <= max; i++) {`
`41`	`42`	`int cover = 0;`
`42`	`43`	`for (int[] line : lines) {`
`43`		`- if (i >= line[0] && i <= line[1]){`
	`44`	`+ if (line[0] <= i&& i <= line[1]){`
`44`	`45`	`cover++;`
`45`	`46`	`}`
`46`	`47`	`}`

Comments

(0)