refactor 56

fishercoder1534 · fishercoder1534 · commit 570a498430fc · 2021-10-12T11:36:26.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_56.java b/src/main/java/com/fishercoder/solutions/_56.java
@@ -7,30 +7,26 @@
 public class _56 {
 
     public static class Solution1 {
+        /**
+         * My completely original solution on 10/12/2021.
+         */
         public int[][] merge(int[][] intervals) {
-            if (intervals.length <= 1) {
-                return intervals;
-            }
-
-            Arrays.sort(intervals, (o1, o2) -> o1[0] - o2[0]);
-
-            List<int[]> result = new ArrayList();
+            List<int[]> list = new ArrayList<>();
+            Arrays.sort(intervals, (a, b) -> a[0] != b[0] ? a[0] - b[0] : a[1] - b[1]);
             for (int i = 0; i < intervals.length; i++) {
                 int start = intervals[i][0];
                 int end = intervals[i][1];
-                while (i < intervals.length && end >= intervals[i][0]) {
-                    end = Math.max(end, intervals[i][1]);
+                while (i + 1 < intervals.length && intervals[i + 1][0] <= end) {
+                    end = Math.max(intervals[i + 1][1], end);
                     i++;
                 }
-                result.add(new int[]{start, end});
-                i--;
+                list.add(new int[]{start, end});
             }
-            int[][] finalResult = new int[result.size()][2];
-            for (int i = 0; i < result.size(); i++) {
-                finalResult[i][0] = result.get(i)[0];
-                finalResult[i][1] = result.get(i)[1];
+            int[][] ans = new int[list.size()][2];
+            for (int i = 0; i < list.size(); i++) {
+                ans[i] = list.get(i);
             }
-            return finalResult;
+            return ans;
         }
     }
 
