refactor 757

fishercoder1534 · fishercoder1534 · commit 5c8465f11ca4 · 2020-11-04T06:50:04.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_757.java b/src/main/java/com/fishercoder/solutions/_757.java
@@ -2,12 +2,6 @@
 
 import java.util.Arrays;
 
-/**
- * Problem 757: Set Intersection Size At Least Two
- * An integer interval [a, b] (for integers a < b) is a set of all consecutive integers from a to b, including a and b.
- * Find the minimum size of a set S such that for every integer interval A in intervals, the intersection of S with A has size at least 2.
- */
-
 /**
  * Approach: Sort the intervals in the ascending order of end range.
  * In case if the end range of any 2 intervals match,
@@ -17,21 +11,21 @@
  * The reason for sorting based on descending order of start range is to get minimum possible size of S that intersect with A of atleast size 2
  */
 public class _757 {
-    public static class Solution{
+    public static class Solution {
         public int intersectionSizeTwo(int[][] intervals) {
-            Arrays.sort(intervals, (a, b) -> a[1] == b[1] ? b[0] - a[0]: a[1] - b[1]);
+            Arrays.sort(intervals, (a, b) -> a[1] == b[1] ? b[0] - a[0] : a[1] - b[1]);
             int count = 0;
-            int startTime = Integer.MIN_VALUE, endTime = Integer.MIN_VALUE;
+            int startTime = Integer.MIN_VALUE;
+            int endTime = Integer.MIN_VALUE;
 
-            for(int interval[] : intervals){
-                if(startTime >= interval[0])
+            for (int interval[] : intervals) {
+                if (startTime >= interval[0]) {
                     continue;
-                else if(endTime >= interval[0]){
+                } else if (endTime >= interval[0]) {
                     startTime = endTime;
                     endTime = interval[1];
                     count += 1;
-                }
-                else{
+                } else {
                     startTime = interval[1] - 1;
                     endTime = interval[1];
                     count += 2;
diff --git a/src/test/java/com/fishercoder/_757Test.java b/src/test/java/com/fishercoder/_757Test.java
@@ -11,17 +11,19 @@ public class _757Test {
     int intervals[][];
 
     @BeforeClass
-    public static void setup(){
+    public static void setup() {
         solution = new _757.Solution();
     }
+
     @Test
     public void test1() {
-        intervals = new int [][]{{1,3},{1, 4}, {2,5},{3,5}};
+        intervals = new int[][]{{1, 3}, {1, 4}, {2, 5}, {3, 5}};
         assertEquals(3, solution.intersectionSizeTwo(intervals));
     }
+
     @Test
     public void test2() {
-        intervals = new int [][]{{16,18},{11, 18}, {15,23},{1,16}, {10,16},{6,19}, {18,20}, {7,19}};
+        intervals = new int[][]{{16, 18}, {11, 18}, {15, 23}, {1, 16}, {10, 16}, {6, 19}, {18, 20}, {7, 19}};
         assertEquals(4, solution.intersectionSizeTwo(intervals));
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -11,17 +11,19 @@ public class _757Test {`
`11`	`11`	`int intervals[][];`
`12`	`12`
`13`	`13`	`@BeforeClass`
`14`		`- public static void setup(){`
	`14`	`+ public static void setup() {`
`15`	`15`	`solution = new _757.Solution();`
`16`	`16`	`}`
	`17`	`+`
`17`	`18`	`@Test`
`18`	`19`	`public void test1() {`
`19`		`- intervals = new int [][]{{1,3},{1, 4}, {2,5},{3,5}};`
	`20`	`+ intervals = new int[][]{{1, 3}, {1, 4}, {2, 5}, {3, 5}};`
`20`	`21`	`assertEquals(3, solution.intersectionSizeTwo(intervals));`
`21`	`22`	`}`
	`23`	`+`
`22`	`24`	`@Test`
`23`	`25`	`public void test2() {`
`24`		`- intervals = new int [][]{{16,18},{11, 18}, {15,23},{1,16}, {10,16},{6,19}, {18,20}, {7,19}};`
	`26`	`+ intervals = new int[][]{{16, 18}, {11, 18}, {15, 23}, {1, 16}, {10, 16}, {6, 19}, {18, 20}, {7, 19}};`
`25`	`27`	`assertEquals(4, solution.intersectionSizeTwo(intervals));`
`26`	`28`	`}`
`27`	`29`	`}`