Commit 7e0ecc8

committed

line cover max

1 parent 6b4010d commit 7e0ecc8Copy full SHA for 7e0ecc8

File tree

-4

lines changed

-4

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package grey.algorithm;`
	`1`	`+package grey.algorithm.code11_heap;`
`2`	`2`
`3`	`3`	`import java.util.*;`
`4`	`4`
`@@ -9,7 +9,7 @@`
`9`	`9`	`// 堆`
`10`	`10`	`// 笔记:https://www.cnblogs.com/greyzeng/p/15058662.html`
`11`	`11`	`// 线段树解法 TODO`
`12`		`-public class Code_0034_NowCoder_LineCoverMax {`
	`12`	`+public class Code_0005_NowCoder_LineCoverMax {`
`13`	`13`	`public static void main(String[] args) {`
`14`	`14`	`try (Scanner in = new Scanner(System.in)) {`
`15`	`15`	`int lens = in.nextInt();`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package grey.algorithm;`
	`1`	`+package grey.algorithm.code11_heap;`
`2`	`2`
`3`	`3`	`import java.io.*;`
`4`	`4`	`import java.util.Arrays;`
`@@ -12,7 +12,7 @@`
`12`	`12`	`// 暴力解法`
`13`	`13`	`// 堆解法`
`14`	`14`	`// 线段树解法 TODO`
`15`		`-public class Code_0032_NowCoder_LineCoverMax2 {`
	`15`	`+public class Code_0006_NowCoder_LineCoverMax2 {`
`16`	`16`	`private static int MAXN = 10001;`
`17`	`17`	`private static int[][] lines = new int[MAXN][2];`
`18`	`18`	`private static int n;`

Comments

(0)