# 【leetcode】【91.6】【M】Sum Root to Leaf Numbers

256人阅读 评论(0)
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the total sum of all root-to-leaf numbers.
For example,
1
/ \
2 3

The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Return the sum = 12 + 13 = 25.

# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None

class Solution(object):
def __init__(self):
self.res = 0
def dfs(self,root,summ):
if root == None:
return
summ = root.val + summ*10

if root.left:
self.dfs(root.left,summ)
if root.right:
self.dfs(root.right,summ)
if root.left == None and root.right == None:
self.res += summ
#print root.val,summ

def sumNumbers(self, root):

self.dfs(root,0)
#print self.res
return self.res
"""
:type root: TreeNode
:rtype: int
"""



0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：71997次
• 积分：2509
• 等级：
• 排名：第15153名
• 原创：187篇
• 转载：4篇
• 译文：0篇
• 评论：9条
阅读排行
最新评论