sltin的博客

1. 二叉树的最大深度/** * Definition for a binary tree node. * class TreeNode { * public $val = null; * public $left = null; * public $right = null; * function __construct($val = 0, $left = null, $right = null) { * $this->val = $

1. 二叉树的最大深度/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ //最大深度func maxDepth(root *TreeNode) int { // 递归终止条件 if root == nil { return 0 }