修改注释

Author: diguage

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

@@ -6,6 +6,9 @@ public class _0450_DeleteNodeInABST {
   // tag::answer[]
   /**
    * 参考 https://leetcode.cn/problems/delete-node-in-a-bst/solutions/1529700/shan-chu-er-cha-sou-suo-shu-zhong-de-jie-n6vo/[450. 删除二叉搜索树中的节点 - 官方题解^]
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-26 20:35
    */
   public TreeNode deleteNode(TreeNode root, int key) {
     if (root == null) {
@@ -34,6 +37,7 @@ public TreeNode deleteNode(TreeNode root, int key) {
         successor = successor.left;
       }
       root.right = deleteNode(root.right, successor.val);
+      // 注意“嫁接”左右子树
       successor.right = root.right;
       successor.left = root.left;
       return successor;

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

@@ -3,13 +3,16 @@
 import com.diguage.algo.util.TreeNode;
 
 /**
- * @author D瓜哥 · https://www.diguage.com
- * @since 2024-06-26 20:50:34
  */
 public class _0538_ConvertBSTToGreaterTree {
   // tag::answer[]
   int sum = 0;
-
+  /**
+   * 逆向中根遍历
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-26 20:50:34
+   */
   public TreeNode convertBST(TreeNode root) {
     if (null == root) {
       return null;

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

@@ -6,14 +6,15 @@
 import java.util.Arrays;
 
 /**
- * @author D瓜哥 · https://www.diguage.com
- * @since 2024-06-26 20:50:34
  */
 public class _0538_ConvertBSTToGreaterTree_1 {
   // tag::answer[]
 
   /**
    * 基于 Morris 的倒序中根遍历
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-26 20:50:34
    */
   public TreeNode convertBST(TreeNode root) {
     int sum = 0;