refactor 435

fishercoder1534 · fishercoder1534 · commit 194b3d5efb49 · 2020-08-15T06:44:24.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_435.java b/src/main/java/com/fishercoder/solutions/_435.java
@@ -1,7 +1,5 @@
 package com.fishercoder.solutions;
 
-import com.fishercoder.common.classes.Interval;
-
 import java.util.Arrays;
 import java.util.Collections;
 
@@ -13,19 +11,19 @@ public static class Solution1 {
          * and https://discuss.leetcode.com/topic/65594/java-least-is-most
          * Sort the intervals by their end time, if equal, then sort by their start time.
          */
-        public int eraseOverlapIntervals(Interval[] intervals) {
+        public int eraseOverlapIntervals(int[][] intervals) {
             Collections.sort(Arrays.asList(intervals), (o1, o2) -> {
-                if (o1.end != o2.end) {
-                    return o1.end - o2.end;
+                if (o1[1] != o2[1]) {
+                    return o1[1] - o2[1];
                 } else {
-                    return o2.start - o1.start;
+                    return o2[0] - o1[0];
                 }
             });
             int end = Integer.MIN_VALUE;
             int count = 0;
-            for (Interval interval : intervals) {
-                if (interval.start >= end) {
-                    end = interval.end;
+            for (int[] interval : intervals) {
+                if (interval[0] >= end) {
+                    end = interval[1];
                 } else {
                     count++;
                 }
diff --git a/src/test/java/com/fishercoder/_435Test.java b/src/test/java/com/fishercoder/_435Test.java
@@ -1,6 +1,5 @@
 package com.fishercoder;
 
-import com.fishercoder.common.classes.Interval;
 import com.fishercoder.solutions._435;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -17,11 +16,7 @@ public static void setup() {
 
     @Test
     public void test1() {
-        Interval interval1 = new Interval(1, 100);
-        Interval interval2 = new Interval(11, 22);
-        Interval interval3 = new Interval(1, 11);
-        Interval interval4 = new Interval(2, 12);
-        Interval[] intervals = new Interval[]{interval1, interval2, interval3, interval4};
+        int[][] intervals = new int[][]{new int[]{1, 100}, new int[]{11, 22}, new int[]{1, 11}, new int[]{2, 12}};
         assertEquals(2, solution1.eraseOverlapIntervals(intervals));
     }
 
