【LEETCODE】129-Sum Root to Leaf Numbers [Python]
来源:互联网 发布:虚拟机的linux不能启动 编辑:程序博客网 时间:2024/06/15 12:23
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 number123.
Find the total sum of all root-to-leaf numbers.
For example,
1
/ \
2 3
The root-to-leaf path 1->2 represents the number12.
The root-to-leaf path 1->3 represents the number13.
Return the sum = 12 + 13 = 25.
题意:
给一个二叉树,只包括 0-9,每一个 root-to-leaf 路径可以代表一个数字
返回 所有 root-to-leaf 相应数字的和
上例有两条路径,分别代表数字 12,13,则总和为 12 + 13 = 25
思路:
遍历每个root-to-leaf 路径,记录每个路径所代表的数字,并加到sum
参考:
http://bookshadow.com/weblog/2016/01/07/leetcode-sum-root-to-leaf-numbers/
Python:
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def sumNumbers(self, root): """ :type root: TreeNode :rtype: int """ if root is None: return 0 return self.dfs(root,0) def dfs(self,root,val): val = val*10+root.val #上一层的值val传递过来乘以10,再加上当前节点的值 if (root.left or root.right) is None: return val sums=0 #记录总和 if root.left: sums+=self.dfs(root.left,val) if root.right: sums+=self.dfs(root.right,val) return sums
0 0
- [Leetcode][python]Sum Root to Leaf Numbers
- 【LEETCODE】129-Sum Root to Leaf Numbers [Python]
- LeetCode 129: Sum Root to Leaf Numbers
- LeetCode: Sum Root to Leaf Numbers [129]
- LeetCode 129 Sum Root to Leaf Numbers
- [leetcode 129] Sum Root to Leaf Numbers
- LeetCode 129 Sum Root to Leaf Numbers
- [LeetCode 129]Sum Root to Leaf Numbers
- leetcode-129 Sum Root to Leaf Numbers
- [leetcode] #129 Sum Root to Leaf Numbers
- leetcode || 129、Sum Root to Leaf Numbers
- Leetcode[129]-Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers - LeetCode 129
- LeetCode 129 Sum Root to Leaf Numbers
- LeetCode(129) Sum Root to Leaf Numbers
- Leetcode #129 Sum Root to Leaf Numbers
- LeetCode 129: Sum Root to Leaf Numbers
- leetcode 129:Sum Root to Leaf Numbers
- 堆和栈的区别
- Codeforces 392C Yet Another Number Sequence 题解&代码
- R制作词云
- 交货单可用性检查,库存+批次可用
- WinDBG常用命令
- 【LEETCODE】129-Sum Root to Leaf Numbers [Python]
- 二叉树的遍历
- web学习之路—H5(一)
- IOS根据经纬度算距离
- 第十章 函数和指针 p354 指针加法
- LibGDX教程——重建Flappy Bird——(2) 创建游戏框架
- Android: NullPointerException when using RelativeLayout with measure()
- Android开发实践:使用Service还是Thread
- AIX硬件定位