Commitf21b148

committed

refactor 646

1 parent811b58d commitf21b148Copy full SHA for f21b148

File tree

+34

-32

lines changed

src
- main/java/com/fishercoder/solutions
  - _646.java
- test/java/com/fishercoder
  - _646Test.java

+34

-32

lines changed

Lines changed: 18 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -21,24 +21,26 @@ Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c`
`21`	`21`	`*/`
`22`	`22`	`publicclass_646 {`
`23`	`23`
`24`		`-/**`
`25`		`- * credit: https://discuss.leetcode.com/topic/96804/java-o-nlog-n-time-o-1-space`
`26`		`- */`
`27`		`-publicintfindLongestChain(int[][]pairs) {`
`28`		`-Arrays.sort(pairs, (o1,o2) ->o1[1] -o2[1]);`
`29`		`-intresult =0;`
`30`		`-intn =pairs.length;`
`31`		`-inti = -1;`
`32`		`-while (++i <n) {`
`33`		`-result++;`
`34`		`-intcurEnd =pairs[i][1];`
`35`		`-while (i +1 <n &&pairs[i +1][0] <=curEnd) {`
`36`		`-/**This means, we'll keep incrementing i until pairs[i+1][0] is`
`37`		`- * exactly greater than curEnd.*/`
`38`		`-i++;`
	`24`	`+publicstaticclassSolution1 {`
	`25`	`+/**`
	`26`	`+ * credit: https://discuss.leetcode.com/topic/96804/java-o-nlog-n-time-o-1-space`
	`27`	`+ */`
	`28`	`+publicintfindLongestChain(int[][]pairs) {`
	`29`	`+Arrays.sort(pairs, (o1,o2) ->o1[1] -o2[1]);`
	`30`	`+intresult =0;`
	`31`	`+intn =pairs.length;`
	`32`	`+inti = -1;`
	`33`	`+while (++i <n) {`
	`34`	`+result++;`
	`35`	`+intcurEnd =pairs[i][1];`
	`36`	`+while (i +1 <n &&pairs[i +1][0] <=curEnd) {`
	`37`	`+/**This means, we'll keep incrementing i until pairs[i+1][0] is`
	`38`	`+ * exactly greater than curEnd.*/`
	`39`	`+i++;`
	`40`	`+ }`
`39`	`41`	`}`
	`42`	`+returnresult;`
`40`	`43`	`}`
`41`		`-returnresult;`
`42`	`44`	`}`
`43`	`45`
`44`	`46`	`}`

Lines changed: 16 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,38 +8,38 @@`
`8`	`8`
`9`	`9`	`publicclass_646Test {`
`10`	`10`
`11`		`-privatestatic_646test;`
	`11`	`+privatestatic_646.Solution1solution1;`
`12`	`12`	`privatestaticint[][]pairs;`
`13`	`13`
`14`	`14`	`@BeforeClass`
`15`	`15`	`publicstaticvoidsetup() {`
`16`		`-test =new_646();`
	`16`	`+solution1 =new_646.Solution1();`
`17`	`17`	`}`
`18`	`18`
`19`	`19`	`@Test`
`20`	`20`	`publicvoidtest1() {`
`21`	`21`	`pairs =newint[][]{`
`22`		`- {1,2},`
`23`		`- {2,3},`
`24`		`- {5,6},`
`25`		`- {3,4}`
	`22`	`+ {1,2},`
	`23`	`+ {2,3},`
	`24`	`+ {5,6},`
	`25`	`+ {3,4}`
`26`	`26`	`};`
`27`		`-assertEquals(3,test.findLongestChain(pairs));`
	`27`	`+assertEquals(3,solution1.findLongestChain(pairs));`
`28`	`28`	`}`
`29`	`29`
`30`	`30`	`@Test`
`31`	`31`	`publicvoidtest2() {`
`32`	`32`	`pairs =newint[][]{`
`33`		`- {9,10},`
`34`		`- {-9,9},`
`35`		`- {-6,1},`
`36`		`- {-4,1},`
`37`		`- {8,10},`
`38`		`- {7,10},`
`39`		`- {9,10},`
`40`		`- {2,10}`
	`33`	`+ {9,10},`
	`34`	`+ {-9,9},`
	`35`	`+ {-6,1},`
	`36`	`+ {-4,1},`
	`37`	`+ {8,10},`
	`38`	`+ {7,10},`
	`39`	`+ {9,10},`
	`40`	`+ {2,10}`
`41`	`41`	`};`
`42`		`-assertEquals(2,test.findLongestChain(pairs));`
	`42`	`+assertEquals(2,solution1.findLongestChain(pairs));`
`43`	`43`	`}`
`44`	`44`
`45`	`45`	`}`

Comments

(0)