(二叉树相关)LeetCode#129. Sum Root to Leaf Numbers
来源:互联网 发布:python画图代码 编辑:程序博客网 时间:2024/06/05 21:14
- 题目:一棵二叉树,从根节点到任何一个叶子节点都都看做一个整数,求所有这样的整数和
- 难度:Medium
- 思路:层次遍历二叉树,当节点的左右孩子都为空时,返回sum的值
- 代码:
public class Solution { public int sumNumbers(TreeNode root) { if(root == null){ return 0; } if(root.left == null && root.right == null){ return root.val; } int right = 0; int left = 0; if(root.left != null){ left = sum(root.left, root.val); } if(root.right != null){ right = sum(root.right, root.val); } return left + right; } public int sum(TreeNode node, int sum){ if(node.left == null && node.right == null){ return sum*10 + node.val; } if(node.left == null && node.right != null){ return sum(node.right, sum*10 + node.val); } if(node.right == null && node.left != null){ return sum(node.left, sum*10 + node.val); } return sum(node.left, sum*10 + node.val) + sum(node.right, sum*10 + node.val); }}
阅读全文
0 0
- (二叉树相关)LeetCode#129. Sum Root to Leaf Numbers
- leetcode:Sum Root to Leaf Numbers (二叉树的DFS)
- [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
- 129. Sum Root to Leaf Numbers LeetCode
- [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
- [leetcode] 129. Sum Root to Leaf Numbers
- Java注解(Annotation)
- 移动端正方形高度自适应
- 软件工程(C编码实践篇)学习总结
- java中Timer的使用
- tensorflow实现机器学习模型的基本步骤
- (二叉树相关)LeetCode#129. Sum Root to Leaf Numbers
- Dubbbo spring配置方式解析
- day 4 两栈实现队列
- <a></a>标签传值,汉字出现乱码解决办法
- 计蒜客---三值排序
- [leetcode]153. Find Minimum in Rotated Sorted Array
- Andrew Ng机器学习week9(Anomaly Detection and Recommender Systems)编程习题
- B-1029
- 数据结构关于树的一些递归函数代码