refactor 56

fishercoder1534 · fishercoder1534 · commit d0b87b79da85 · 2020-05-03T07:27:02.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_56.java b/src/main/java/com/fishercoder/solutions/_56.java
@@ -1,42 +1,34 @@
 package com.fishercoder.solutions;
 
 import com.fishercoder.common.classes.Interval;
+
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.List;
 
-/**
- * 56. Merge Intervals
- *
- * Given a collection of intervals, merge all overlapping intervals.
-
- For example,
- Given [1,3],[2,6],[8,10],[15,18],
- return [1,6],[8,10],[15,18].
- */
 public class _56 {
 
-  public static class Solution1 {
-    public List<Interval> merge(List<Interval> intervals) {
-        if (intervals.size() <= 1) {
-            return intervals;
-        }
+    public static class Solution1 {
+        public List<Interval> merge(List<Interval> intervals) {
+            if (intervals.size() <= 1) {
+                return intervals;
+            }
 
-        Collections.sort(intervals, (o1, o2) -> o1.start - o2.start);
+            Collections.sort(intervals, (o1, o2) -> o1.start - o2.start);
 
-        List<Interval> result = new ArrayList();
-        for (int i = 0; i < intervals.size(); i++) {
-            int start = intervals.get(i).start;
-            int end = intervals.get(i).end;
-            while (i < intervals.size() && end >= intervals.get(i).start) {
-                end = Math.max(end, intervals.get(i).end);
-                i++;
+            List<Interval> result = new ArrayList();
+            for (int i = 0; i < intervals.size(); i++) {
+                int start = intervals.get(i).start;
+                int end = intervals.get(i).end;
+                while (i < intervals.size() && end >= intervals.get(i).start) {
+                    end = Math.max(end, intervals.get(i).end);
+                    i++;
+                }
+                result.add(new Interval(start, end));
+                i--;
             }
-            result.add(new Interval(start, end));
-            i--;
+            return result;
         }
-        return result;
     }
-  }
 
 }
