129. Sum Root to Leaf Numbers（求根到叶子节点数字之和）

最新推荐文章于 2023-03-14 18:45:00 发布

God_Mood

最新推荐文章于 2023-03-14 18:45:00 发布

阅读量114

点赞数

分类专栏： Leetcode 文章标签： Sum Root to Leaf Numbers 求根到叶子节点数字之和

本文链接：https://blog.csdn.net/God_Mood/article/details/89281051

版权

Leetcode 专栏收录该内容

227 篇文章 1 订阅

订阅专栏

题目链接：https://leetcode.com/problems/sum-root-to-leaf-numbers/

Input: [1,2,3]
    1
   / \
  2   3
Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.

思路，递归：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int ans=0;
    public int sumNumbers(TreeNode root) {
        if(root==null)
            return ans;
        helper(root,0);
        return ans;
    }
    public void helper(TreeNode root,int sum){
        sum=sum*10+root.val;
        if(root.left==null&&root.right==null){
            ans=ans+sum;
            return;
        }
        if(root.left!=null)
            helper(root.left,sum);
        if(root.right!=null)
            helper(root.right,sum);
    }
}