public class Solution {
public int sumNumbers(TreeNode root) {
return helper(root, 0);
}
public static int helper(TreeNode r, int tmp) {
if (r == null) return 0;
// current node is a leaf
if (r.left == null && r.right == null) {
return tmp + r.val;
}
// current node is not a leaf
return helper(r.left, (tmp+r.val)*10) + helper(r.right, (tmp+r.val)*10);
}
}
Leetcode 129. Sum Root to Leaf Numbers
最新推荐文章于 2024-02-28 12:48:11 发布