首页 > 代码库 > 【LeetCode】Sum Root to Leaf Numbers 解题报告
【LeetCode】Sum Root to Leaf Numbers 解题报告
【题目】
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
.
【思路】
二叉树的穷尽搜索,递归法即可。
【Java代码】
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { int sum = 0; public int sumNumbers(TreeNode root) { if (root == null) return 0; run(root, 0); return sum; } public void run(TreeNode root, int num) { num = 10 * num + root.val; if (root.left == null && root.right == null) { sum += num; } if (root.left != null) { run(root.left, num); } if (root.right != null) { run(root.right, num); } } }
【LeetCode】Sum Root to Leaf Numbers 解题报告
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。