129. 求根节点到叶节点数字之和
题目描述
解题思路
1、前序遍历
3、和113路径总和II类似
代码实现
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
def sumNumbers(self, root: TreeNode) -> int:
# 前序遍历
def dfs(root: TreeNode, preVal: int) -> int:
if not root:
return 0
preVal = preVal * 10 + root.val
if not root.left and not root.right:
return preVal
else:
return dfs(root.left, preVal) + dfs(root.right, preVal)
return dfs(root, 0)
参考文献
1、官方题解 深度优先代码更简洁