class Solution {
int result;
public int sumNumbers(TreeNode root) {
if(root == null)return 0;
sumNumber(root, 0);
return result;
}
public void sumNumber(TreeNode root , int sum)
{
int temp = sum*10 + root.val;
if(root == null)return;
if(root.left == null && root.right == null) //达到叶节点
{
result += temp;
return;
}
if(root.left != null)
{
sumNumber(root.left , temp);
}
if(root.right != null)
{
sumNumber(root.right , temp);
}
}
}
129. 求根到叶子节点数字之和
最新推荐文章于 2023-09-08 08:38:11 发布