Commit9ca9c85

committed

refactor 435

1 parent38589ac commit9ca9c85Copy full SHA for 9ca9c85

File tree

+12

-16

lines changed

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

+12

-16

lines changed

Lines changed: 9 additions & 14 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,25 +10,20 @@ public static class Solution1 {`
`10`	`10`	`* credit:: https://discuss.leetcode.com/topic/65828/java-solution-with-clear-explain`
`11`	`11`	`* and https://discuss.leetcode.com/topic/65594/java-least-is-most`
`12`	`12`	`* Sort the intervals by their end time, if equal, then sort by their start time.`
	`13`	`+ * Then merge based on ending time.`
`13`	`14`	`*/`
`14`	`15`	`publicinteraseOverlapIntervals(int[][]intervals) {`
`15`		`-Collections.sort(Arrays.asList(intervals), (o1,o2) -> {`
`16`		`-if (o1[1] !=o2[1]) {`
`17`		`-returno1[1] -o2[1];`
	`16`	`+Arrays.sort(intervals, (a,b) ->a[1] !=b[1] ?a[1] -b[1] :a[0] -b[0]);`
	`17`	`+interasures =0;`
	`18`	`+intend =intervals[0][1];`
	`19`	`+for (inti =1;i <intervals.length;i++) {`
	`20`	`+if (intervals[i][0] <end) {`
	`21`	`+erasures++;`
`18`	`22`	`}else {`
`19`		`-returno2[0] -o1[0];`
`20`		`- }`
`21`		`- });`
`22`		`-intend =Integer.MIN_VALUE;`
`23`		`-intcount =0;`
`24`		`-for (int[]interval :intervals) {`
`25`		`-if (interval[0] >=end) {`
`26`		`-end =interval[1];`
`27`		`- }else {`
`28`		`-count++;`
	`23`	`+end =intervals[i][1];`
`29`	`24`	`}`
`30`	`25`	`}`
`31`		`-returncount;`
	`26`	`+returnerasures;`
`32`	`27`	`}`
`33`	`28`	`}`
`34`	`29`

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`packagecom.fishercoder;`
`2`	`2`
	`3`	`+importcom.fishercoder.common.utils.CommonUtils;`
`3`	`4`	`importcom.fishercoder.solutions._435;`
`4`	`5`	`importorg.junit.BeforeClass;`
`5`	`6`	`importorg.junit.Test;`
`@@ -16,8 +17,8 @@ public static void setup() {`
`16`	`17`
`17`	`18`	`@Test`
`18`	`19`	`publicvoidtest1() {`
`19`		`-int[][]intervals =newint[][]{newint[]{1,100},newint[]{11,22},newint[]{1,11},newint[]{2,12}};`
`20`		`-assertEquals(2,solution1.eraseOverlapIntervals(intervals));`
	`20`	`+int[][]intervals =CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[2,3],[3,4],[1,3]");`
	`21`	`+assertEquals(1,solution1.eraseOverlapIntervals(intervals));`
`21`	`22`	`}`
`22`	`23`
`23`	`24`	`}`

Comments

(0)