优化文档

Author: diguage

docs/0000-25-prefix-sum.adoc

@@ -7,6 +7,7 @@
 
 . xref:0303-range-sum-query-immutable.adoc[303. Range Sum Query - Immutable]
 . xref:0304-range-sum-query-2d-immutable.adoc[304. Range Sum Query 2D - Immutable]
+. xref:0437-path-sum-iii.adoc[437. Path Sum III]
 
 == 参考资料
 

docs/0098-validate-binary-search-tree.adoc

@@ -3,12 +3,6 @@
 
 {leetcode}/problems/validate-binary-search-tree/[LeetCode - Validate Binary Search Tree^]
 
-image::images/0098-1.png[{image_attr}]
-
-image::images/0098-2.png[{image_attr}]
-
-思路很简单，利用搜索二叉树的定义，界定好树的上下界，然后递归比较就好。
-
 Given a binary tree, determine if it is a valid binary search tree (BST).
 
 Assume a BST is defined as follows:
@@ -48,6 +42,13 @@ Assume a BST is defined as follows:
 *Explanation:* The root node's value is 5 but its right child's value is 4.
 ----
 
+== 思路分析
+
+image::images/0098-1.png[{image_attr}]
+
+image::images/0098-2.png[{image_attr}]
+
+思路很简单，利用搜索二叉树的定义，界定好树的上下界，然后递归比较就好。
 
 [[src-0098]]
 [tabs]

docs/0496-next-greater-element-i.adoc

@@ -71,10 +71,26 @@ image::images/0496-13.png[{image_attr}]
 
 
 [[src-0496]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0496_NextGreaterElementI.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0496_NextGreaterElementI_2.java[tag=answer]
+// ----
+// --
+====
 
 == 参考资料
 

docs/0530-minimum-absolute-difference-in-bst.adoc

@@ -3,7 +3,7 @@
 
 {leetcode}/problems/minimum-absolute-difference-in-bst/[LeetCode - Minimum Absolute Difference in BST^]
 
-Given a binary search tree with non-negative values, find the minimum <a href="https://en.wikipedia.org/wiki/Absolute_difference">absolute difference</a> between values of any two nodes.
+Given a binary search tree with non-negative values, find the minimum https://en.wikipedia.org/wiki/Absolute_difference[absolute difference] between values of any two nodes.
 
 *Example:*
 

docs/0783-minimum-distance-between-bst-nodes.adoc

@@ -36,6 +36,6 @@ while the minimum difference in this tree is 1, it occurs between node 1 and nod
 [[src-0783]]
 [{java_src_attr}]
 ----
-include::{sourcedir}/_0783_MinimumDistanceBetweenBSTNodes.java[tag=answer]
+include::{sourcedir}/_0530_MinimumAbsoluteDifferenceInBST.java[tag=answer]
 ----
 

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

@@ -13,6 +13,9 @@ public class _0496_NextGreaterElementI {
   // tag::answer[]
   /**
    * 单调栈，参考模板，自己书写
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-07-05 22:40:25
    */
   public int[] nextGreaterElement(int[] nums1, int[] nums2) {
     Deque<Integer> stack = new LinkedList<>();