优化代码展示

Author: diguage

docs/0094-binary-tree-inorder-traversal.adoc

@@ -25,18 +25,33 @@ Given a binary tree, return the _inorder_ traversal of its nodes' values.
 
 
 [[src-0094]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0094_BinaryTreeInorderTraversal.java[tag=answer]
 ----
+--
 
+二刷（递归）::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0094_BinaryTreeInorderTraversal_Recur.java[tag=answer]
 ----
+--
 
+二刷（栈）::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0094_BinaryTreeInorderTraversal_Stack.java[tag=answer]
 ----
+--
+====
 

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

@@ -50,16 +50,26 @@ Assume a BST is defined as follows:
 
 
 [[src-0098]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0098_ValidateBinarySearchTree.java[tag=answer]
 ----
+--
 
-
+二刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0098_ValidateBinarySearchTree_2.java[tag=answer]
 ----
+--
+====
 
 直接使用“树形DP套路”+剪枝技巧，速度直接击败 100%。
 

docs/0099-recover-binary-search-tree.adoc

@@ -83,10 +83,26 @@ image::images/0099-11.png[{image_attr}]
 
 
 [[src-0099]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0099_RecoverBinarySearchTree.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0098_ValidateBinarySearchTree_2.java[tag=answer]
+// ----
+// --
+====
 
 
 == 参考资料

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

@@ -32,6 +32,10 @@
  */
 public class _0094_BinaryTreeInorderTraversal_Recur {
   // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-14 11:30
+   */
   public List<Integer> inorderTraversal(TreeNode root) {
     List<Integer> result = new ArrayList<>();
     inorderTraversal(root, result);

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

@@ -31,6 +31,10 @@
  */
 public class _0094_BinaryTreeInorderTraversal_Stack {
   // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-14 11:30
+   */
   public List<Integer> inorderTraversal(TreeNode root) {
     List<Integer> result = new ArrayList<>();
     Deque<TreeNode> stack = new LinkedList<>();

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

@@ -55,6 +55,9 @@ public class _0098_ValidateBinarySearchTree {
      * Runtime: 1 ms, faster than 33.82% of Java online submissions for Validate Binary Search Tree.
      *
      * Memory Usage: 45.2 MB, less than 5.58% of Java online submissions for Validate Binary Search Tree.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-24 19:06
      */
     public boolean isValidBST(TreeNode root) {
         if (Objects.isNull(root)) {

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

@@ -12,6 +12,10 @@
  */
 public class _0098_ValidateBinarySearchTree_2 {
   // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-23 16:38:11
+   */
   public boolean isValidBST(TreeNode root) {
     return dfs(root).valid;
   }

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

@@ -10,6 +10,9 @@ public class _0099_RecoverBinarySearchTree {
   // tag::answer[]
   /**
    * 使用 Morris 遍历找出错误节点，然后交换其值
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-23 22:21:59
    */
   public void recoverTree(TreeNode root) {
     if (root == null) return;