Leetcode 104. 二叉树的最大深度（DAY 2)

---

原题题目

---

---

---

---

代码实现（首刷自解）

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */


int maxDepth(struct TreeNode* root){
    if(!root)
        return 0;
    if(!root->left && !root->right)
        return 1;
    return fmax(maxDepth(root->left),maxDepth(root->right)) + 1;
}

---

代码实现（DAY 83 二刷自解）

---

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(!root)   return 0;
        return max(maxDepth(root->left),maxDepth(root->right)) + 1;
    }
};

---

代码实现（三刷自解 DAY 205 C++ 迭代）

---

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        vector<TreeNode*> now,next;
        int height = 0;
        if(root)    now.emplace_back(root);

        while(!now.empty())
        {
            next.clear();
            ++height;
            for(const auto& node:now)
            {
                if(node->left)   next.emplace_back(node->left);
                if(node->right)  next.emplace_back(node->right);                
            }
            now = next;
        }
        return height;
    }
};

---

代码实现（四刷自解 DAY 283 C++）

---

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
      if (!root) return 0;
      return max(maxDepth(root->left), maxDepth(root->right)) + 1;
    }
};

---

代码实现（五刷自解 DAY 7 Golang）

---

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func max(x, y int) int {
  if x >= y {
    return x
  } else {
    return y
  }
}

func maxDepth(root *TreeNode) int {
  if root == nil {
    return 0
  }

  left, right := maxDepth(root.Left), maxDepth(root.Right)
  return max(left, right) + 1
}