一刷768

Author: diguage

README.adoc

@@ -5401,14 +5401,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0767-reorganize-string.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/max-chunks-to-make-sorted-ii/[768. Max Chunks To Make Sorted II^]
-//|{source_base_url}/_0768_MaxChunksToMakeSortedII.java[Java]
-//|{doc_base_url}/0768-max-chunks-to-make-sorted-ii.adoc[题解]
-//|Hard
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/max-chunks-to-make-sorted-ii/[768. Max Chunks To Make Sorted II^]
+|{source_base_url}/_0768_MaxChunksToMakeSortedII.java[Java]
+|{doc_base_url}/0768-max-chunks-to-make-sorted-ii.adoc[题解]
+|Hard
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/max-chunks-to-make-sorted/[769. Max Chunks To Make Sorted^]
 //|{source_base_url}/_0769_MaxChunksToMakeSorted.java[Java]

docs/0000-09-monotonic-stack.adoc

@@ -63,6 +63,7 @@ for (int i = 1; i < nums.length; i++) {
 . xref:0654-maximum-binary-tree.adoc[654. Maximum Binary Tree]
 . xref:0739-daily-temperatures.adoc[739. Daily Temperatures]
 . xref:0901-online-stock-span.adoc[901. Online Stock Span]
+. xref:0768-max-chunks-to-make-sorted-ii.adoc[768. Max Chunks To Make Sorted II]
 
 
 == 参考资料

docs/0000-25-greedy.adoc

@@ -23,6 +23,8 @@ image::images/greedy-01.png[{image_attr}]
 . xref:0053-maximum-subarray.adoc[53. Maximum Subarray]
 . xref:0134-gas-station.adoc[134. Gas Station]
 . xref:0968-binary-tree-cameras.adoc[968. Binary Tree Cameras]
+. xref:0768-max-chunks-to-make-sorted-ii.adoc[768. Max Chunks To Make Sorted II]
+
 
 image::images/greedy-02.png[{image_attr}]
 

docs/0768-max-chunks-to-make-sorted-ii.adoc

@@ -40,13 +40,68 @@ However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks po
 * `arr[i]` will be an integer in range `[0, 10**8]`.
 
 
- 
+== 思路分析
 
+对于已经分好块的数组，那么右边的块的所有数字均大于或等于左边的块的所有数字。
 
+对于已经分好块的数组，若在其末尾添加一个数字，如何求得新数组的分块方式？
+
+那么，如果新数字大于块中所有数字，则可以自己独立成块；否则，就需要跟前面合并：从新增数字向左，直到排序块的最大值小于新增数字为止，这个区间合并为一个新快。
+
+image::images/0768-01.png[{image_attr}]
+
+image::images/0768-02.png[{image_attr}]
+
+image::images/0768-03.png[{image_attr}]
+
+image::images/0768-04.png[{image_attr}]
+
+image::images/0768-05.png[{image_attr}]
+
+image::images/0768-06.png[{image_attr}]
+
+image::images/0768-07.png[{image_attr}]
+
+image::images/0768-08.png[{image_attr}]
+
+image::images/0768-09.png[{image_attr}]
+
+image::images/0768-10.png[{image_attr}]
+
+image::images/0768-11.png[{image_attr}]
+
+image::images/0768-12.png[{image_attr}]
+
+image::images/0768-13.png[{image_attr}]
+
+image::images/0768-14.png[{image_attr}]
+
+image::images/0768-15.png[{image_attr}]
 
 [[src-0768]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0768_MaxChunksToMakeSortedII.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0768_MaxChunksToMakeSortedII_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/max-chunks-to-make-sorted-ii/solutions/1741851/zui-duo-neng-wan-cheng-pai-xu-de-kuai-ii-w5c6/?envType=study-plan-v2&envId=selected-coding-interview[768. 最多能完成排序的块 II - 官方题解^]
+. https://leetcode.cn/problems/max-chunks-to-make-sorted-ii/solutions/22785/zui-duo-neng-wan-cheng-pai-xu-de-kuai-ii-deng-jie-/?envType=study-plan-v2&envId=selected-coding-interview[768. 最多能完成排序的块 II - 辅助栈法，清晰图解^] -- 图解很好！但是，解题思路还是得参考官方题解。
 

docs/images/0768-01.png

@@ -1610,7 +1610,7 @@ include::0752-open-the-lock.adoc[leveloffset=+1]
 
 // include::0767-reorganize-string.adoc[leveloffset=+1]
 
-// include::0768-max-chunks-to-make-sorted-ii.adoc[leveloffset=+1]
+include::0768-max-chunks-to-make-sorted-ii.adoc[leveloffset=+1]
 
 // include::0769-max-chunks-to-make-sorted.adoc[leveloffset=+1]
 

docs/images/0768-02.png

@@ -823,6 +823,11 @@
 |{doc_base_url}/0509-fibonacci-number.adoc[题解]
 |✅ 动态规划
 
+|{counter:codes}
+|{leetcode_base_url}/max-chunks-to-make-sorted-ii/[768. Max Chunks To Make Sorted II^]
+|{doc_base_url}/0768-max-chunks-to-make-sorted-ii.adoc[题解]
+|❌ 贪心+单调栈。单调栈的解法思路很精巧！
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

docs/images/0768-03.png

@@ -0,0 +1,29 @@
+package com.diguage.algo.leetcode;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+
+public class _0768_MaxChunksToMakeSortedII {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-21 17:48:21
+   */
+  public int maxChunksToSorted(int[] arr) {
+    Deque<Integer> stack = new ArrayDeque<>();
+    for (int num : arr) {
+      if (!stack.isEmpty() && num < stack.peek()) {
+        int head = stack.pop();
+        while (!stack.isEmpty() && num < stack.peek()) {
+          stack.pop();
+        }
+        stack.push(head);
+      } else {
+        stack.push(num);
+      }
+    }
+    return stack.size();
+  }
+  // end::answer[]
+}

docs/images/0768-04.png

@@ -0,0 +1,9 @@
+a = [];
+document.querySelectorAll('div.w-full > div.break-words > div > div > div > div > img').forEach(e => a.push(e.src));
+console.log("count=0\nfor f in '" + a.join("'  '") + "'\ndo\n  ((count = count + 1))\n  cnt=$(printf \"%02d\" count)\n  wget $f -O \"-$cnt.png\"\ndone");
+
+// 从 LeetCode 下载图片
+// https://stackoverflow.com/a/14306442/951836 -- wget 重命名
+// https://stackoverflow.com/a/59817835/951836 -- 自增数字
+// https://stackoverflow.com/a/18460742/951836 -- 格式化
+