refactor 352

fishercoder1534 · fishercoder1534 · commit 75c74996f0a4 · 2020-06-10T11:51:07.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_352.java b/src/main/java/com/fishercoder/solutions/_352.java
@@ -6,22 +6,6 @@
 import java.util.List;
 import java.util.TreeMap;
 
-/**
- * 352. Data Stream as Disjoint Intervals
- *
- * Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of disjoint intervals.
-
- For example, suppose the integers from the data stream are 1, 3, 7, 2, 6, ..., then the summary will be:
-
- [1, 1]
- [1, 1], [3, 3]
- [1, 1], [3, 3], [7, 7]
- [1, 3], [7, 7]
- [1, 3], [6, 7]
-
- Follow up:
- What if there are lots of merges and the number of disjoint intervals are small compared to the data stream's size?
- */
 public class _352 {
 
     public static class Solution1 {
@@ -46,9 +30,9 @@ public void addNum(int val) {
                 Integer lower = treeMap.lowerKey(val);
                 Integer higher = treeMap.higherKey(val);
                 if (lower != null
-                    && higher != null
-                    && treeMap.get(lower).end + 1 == val
-                    && higher == val + 1) {
+                        && higher != null
+                        && treeMap.get(lower).end + 1 == val
+                        && higher == val + 1) {
                     treeMap.get(lower).end = treeMap.get(higher).end;
                     treeMap.remove(higher);
                 } else if (lower != null && treeMap.get(lower).end + 1 >= val) {
