Leetcode OJ 129 Sum Root to Leaf Numbers [Medium]
题目描述:
Given a binary tree containing digits from 0-9 only, eachroot-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 whichrepresents 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.
题目理解:
一个二叉树,节点数字只有0到9,每一条从根节点到叶子节点的路径上的所有节点代表一个数字,计算所有这些数字的和。
测试用例:
功能测试:完全二叉树;普通二叉树;只有左子树的二叉树;只有右子树的二叉树;
特殊输入:二叉树根节点是null
分析:
1. 当输入是null时,返回0;
2. 不需要将每一条路径的数字表示出来相加;
3. 巧妙的方法是,当前节点的数是个位数,其父节点是十位数字,以此类推;父节点之上的数*10+当前节点的数=根节点到当前节点的和
4. 用递归解决,代码如下
解答:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public int sumNumbers(TreeNode root) { return sum(root,0); } static public int sum(TreeNode root, int sum){ if(root == null) return 0; if(root.left == null && root.right == null){ return sum * 10 + root.val; } return sum(root.left,sum*10+root.val) + sum(root.right,sum*10+root.val); } }