Commit194b3d5

committed

refactor 435

1 parent4d83108 commit194b3d5Copy full SHA for 194b3d5

File tree

-15

lines changed

src
- main/java/com/fishercoder/solutions
  - _435.java
- test/java/com/fishercoder
  - _435Test.java

-15

lines changed

Lines changed: 7 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,5 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`		`-importcom.fishercoder.common.classes.Interval;`
`4`		`-`
`5`	`3`	`importjava.util.Arrays;`
`6`	`4`	`importjava.util.Collections;`
`7`	`5`
`@@ -13,19 +11,19 @@ public static class Solution1 {`
`13`	`11`	`* and https://discuss.leetcode.com/topic/65594/java-least-is-most`
`14`	`12`	`* Sort the intervals by their end time, if equal, then sort by their start time.`
`15`	`13`	`*/`
`16`		`-publicinteraseOverlapIntervals(Interval[]intervals) {`
	`14`	`+publicinteraseOverlapIntervals(int[][]intervals) {`
`17`	`15`	`Collections.sort(Arrays.asList(intervals), (o1,o2) -> {`
`18`		`-if (o1.end !=o2.end) {`
`19`		`-returno1.end -o2.end;`
	`16`	`+if (o1[1] !=o2[1]) {`
	`17`	`+returno1[1] -o2[1];`
`20`	`18`	`}else {`
`21`		`-returno2.start -o1.start;`
	`19`	`+returno2[0] -o1[0];`
`22`	`20`	`}`
`23`	`21`	`});`
`24`	`22`	`intend =Integer.MIN_VALUE;`
`25`	`23`	`intcount =0;`
`26`		`-for (Intervalinterval :intervals) {`
`27`		`-if (interval.start >=end) {`
`28`		`-end =interval.end;`
	`24`	`+for (int[]interval :intervals) {`
	`25`	`+if (interval[0] >=end) {`
	`26`	`+end =interval[1];`
`29`	`27`	`}else {`
`30`	`28`	`count++;`
`31`	`29`	`}`

Lines changed: 1 addition & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,5 @@`
`1`	`1`	`packagecom.fishercoder;`
`2`	`2`
`3`		`-importcom.fishercoder.common.classes.Interval;`
`4`	`3`	`importcom.fishercoder.solutions._435;`
`5`	`4`	`importorg.junit.BeforeClass;`
`6`	`5`	`importorg.junit.Test;`
`@@ -17,11 +16,7 @@ public static void setup() {`
`17`	`16`
`18`	`17`	`@Test`
`19`	`18`	`publicvoidtest1() {`
`20`		`-Intervalinterval1 =newInterval(1,100);`
`21`		`-Intervalinterval2 =newInterval(11,22);`
`22`		`-Intervalinterval3 =newInterval(1,11);`
`23`		`-Intervalinterval4 =newInterval(2,12);`
`24`		`-Interval[]intervals =newInterval[]{interval1,interval2,interval3,interval4};`
	`19`	`+int[][]intervals =newint[][]{newint[]{1,100},newint[]{11,22},newint[]{1,11},newint[]{2,12}};`
`25`	`20`	`assertEquals(2,solution1.eraseOverlapIntervals(intervals));`
`26`	`21`	`}`
`27`	`22`

Comments

(0)