/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumNumbers(TreeNode root) {
return sumSubTree(0, root);
}
private int sumSubTree(int decade, TreeNode subTreeRoot) {
int sum = 0;
if (subTreeRoot == null) {
return 0;
} else {
if (subTreeRoot.left == null && subTreeRoot.right == null) {
// leaf node
sum = decade * 10 + subTreeRoot.val;
} else {
// has child node
if (subTreeRoot.left != null) {
sum += sumSubTree(decade*10+subTreeRoot.val, subTreeRoot.left);
}
if (subTreeRoot.right != null) {
sum += sumSubTree(decade*10+subTreeRoot.val, subTreeRoot.right);
}
}
}
return sum;
}
}
LeetCode 129 Sum Root to Leaf Numbers
最新推荐文章于 2019-05-05 19:12:00 发布