三刷104

Author: diguage

docs/0104-maximum-depth-of-binary-tree.adoc

@@ -3,8 +3,6 @@
 
 {leetcode}/problems/maximum-depth-of-binary-tree/[LeetCode - Maximum Depth of Binary Tree^]
 
-思考题：尝试使用迭代方式来解决一下。
-
 Given a binary tree, find its maximum depth.
 
 The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
@@ -33,15 +31,37 @@ return its depth = 3.
 image::images/0104-01.png[{image_attr}]
 
 [[src-0104]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0104_MaximumDepthOfBinaryTree.java[tag=answer]
 ----
+--
 
+二刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0104_MaximumDepthOfBinaryTree_2.java[tag=answer]
 ----
+--
+
+三刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0104_MaximumDepthOfBinaryTree_3.java[tag=answer]
+----
+--
+====
+
+思考题：尝试使用迭代方式来解决一下。
 
 == 参考资料
 

logbook/202406.adoc

@@ -813,6 +813,11 @@
 |{doc_base_url}/0215-kth-largest-element-in-an-array.adoc[题解]
 |❌ 快速查找，知道思路，代码却无从下手。
 
+|{counter:codes}
+|{leetcode_base_url}/maximum-depth-of-binary-tree/[104. Maximum Depth of Binary Tree^]
+|{doc_base_url}/0104-maximum-depth-of-binary-tree.adoc[题解]
+|✅ 递归+回溯
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

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

@@ -42,6 +42,9 @@ public class _0104_MaximumDepthOfBinaryTree {
      * Runtime: 1 ms, faster than 14.28% of Java online submissions for Maximum Depth of Binary Tree.
      *
      * Memory Usage: 40.7 MB, less than 5.38% of Java online submissions for Maximum Depth of Binary Tree.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-24 22:17
      */
     public int maxDepth(TreeNode root) {
         if (Objects.isNull(root)) {

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

@@ -36,6 +36,9 @@ public class _0104_MaximumDepthOfBinaryTree_2 {
     /**
      * 后根遍历既可以访问父节点，又可以从返回值中获取想要的信息，
      * 比如深度，子节点等等。
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2024-06-30 22:09:09
      */
     public int maxDepth(TreeNode root) {
       if (root == null) {

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

@@ -0,0 +1,19 @@
+package com.diguage.algo.leetcode;
+
+import com.diguage.algo.util.TreeNode;
+
+public class _0104_MaximumDepthOfBinaryTree_3 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-20 23:45:16
+   */
+  public int maxDepth(TreeNode root) {
+    if (root == null) {
+      return 0;
+    }
+    return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
+  }
+  // end::answer[]
+}