129. Sum Root to Leaf Numbers
題目:
https://leetcode.com/problems/sum-root-to-leaf-numbers/
難度:
Medium
其實(shí)遞歸不難想到辫封，不過我自己做錯(cuò)在細(xì)節(jié)方面
如果只有單支狱窘，每朝下走一層具帮，代表的數(shù)字都增加10艇纺， 10* 原本的 + 新節(jié)點(diǎn)的數(shù)字缰泡，最終也是用這個(gè)來(lái)解
class Solution(object):
def sumNumbers(self, root):
"""
:type root: TreeNode
:rtype: int
"""
return self.calSum(root,0)
def calSum(self,root,curSum):
if root == None:
return 0
else:
curSum = curSum * 10 + root.val
if root.left == None and root.right == None:
return curSum
else:
return self.calSum(root.left, curSum) + self.calSum(root.right, curSum)
