一刷57

Author: diguage

README.adoc

@@ -425,12 +425,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 |Medium
 |
 
-//|{counter:codes}
-//|{leetcode_base_url}/insert-interval/[57. Insert Interval^]
-//|{source_base_url}/_0057_InsertInterval.java[Java]
-//|{doc_base_url}/0057-insert-interval.adoc[题解]
-//|Hard
-//|
+|{counter:codes}
+|{leetcode_base_url}/insert-interval/[57. Insert Interval^]
+|{source_base_url}/_0057_InsertInterval.java[Java]
+|{doc_base_url}/0057-insert-interval.adoc[题解]
+|Hard
+|
 
 |{counter:codes}
 |{leetcode_base_url}/length-of-last-word/[58. Length of Last Word^]

docs/0057-insert-interval.adoc

@@ -27,10 +27,33 @@ You may assume that the intervals were initially sorted according to their start
 
 *NOTE:* input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.
 
+== 解题分析
+
+image::images/0057-01.png[{image_attr}]
 
 [[src-0057]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0057_InsertInterval.java[tag=answer]
 ----
-
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0057_InsertInterval_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/insert-interval/solutions/472151/cha-ru-qu-jian-by-leetcode-solution/[57. 插入区间 - 官方题解^]
+.

docs/images/0057-01.png

@@ -188,7 +188,7 @@ include::0055-jump-game.adoc[leveloffset=+1]
 
 include::0056-merge-intervals.adoc[leveloffset=+1]
 
-// include::0057-insert-interval.adoc[leveloffset=+1]
+include::0057-insert-interval.adoc[leveloffset=+1]
 
 include::0058-length-of-last-word.adoc[leveloffset=+1]
 

docs/index.adoc

@@ -409,6 +409,11 @@
 |{doc_base_url}/0744-find-smallest-letter-greater-than-target.adoc[题解]
 |二分查找取左右端点是一个怎样的套路？
 
+|{counter:codes}
+|{leetcode_base_url}/insert-interval/[57. Insert Interval^]
+|{doc_base_url}/0057-insert-interval.adoc[题解]
+|合并区间，思路周全再写代码！
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

logbook/202406.adoc

@@ -36,6 +36,11 @@
  */
 public class _0056_MergeIntervals {
   // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2019-10-23 12:27
+   */
     public int[][] merge(int[][] intervals) {
         if (Objects.isNull(intervals) || intervals.length <= 1) {
             return intervals;

src/main/java/com/diguage/algo/leetcode/_0056_MergeIntervals.java

@@ -0,0 +1,50 @@
+package com.diguage.algo.leetcode;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class _0057_InsertInterval {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2019-10-23 12:27
+   */
+  public int[][] insert(int[][] intervals, int[] newInterval) {
+    int left = newInterval[0];
+    int right = newInterval[1];
+    boolean flag = false;
+    List<int[]> result = new ArrayList<>();
+    for (int[] ints : intervals) {
+      if (right < ints[0]) {
+        // 在插入区间的右侧且无交集
+        if (!flag) {
+          // 注意：这里是 left, right，不能直接放 newInterval
+          result.add(new int[]{left, right});
+          flag = true;
+        }
+        result.add(ints);
+      } else if (ints[1] < left) {
+        // 在插入区间的左侧且无交集
+        result.add(ints);
+      } else {
+        left = Math.min(left, ints[0]);
+        right = Math.max(right, ints[1]);
+      }
+    }
+    if (!flag) {
+      result.add(new int[]{left, right});
+    }
+    return result.toArray(new int[result.size()][2]);
+  }
+
+  // end::answer[]
+  public static void main(String[] args) {
+    int[][] result = new _0057_InsertInterval().insert(
+      new int[][]{new int[]{1, 2}, new int[]{3, 5},
+        new int[]{6, 7}, new int[]{8, 10}, new int[]{12, 16}},
+      new int[]{4, 8});
+    System.out.println(Arrays.toString(result));
+  }
+}