题目链接:https://leetcode.com/problems/maximum-depth-of-binary-tree/
代码
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def maxDepth(self, root: TreeNode) -> int:
if not root :
return 0
return 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))
思路详解
动态回归的方式,
dp[node] = 1+max(dp[left],dp[right])