【leetcode】Sum Root to Leaf Numbers

最新推荐文章于 2024-10-15 00:03:51 发布

jimmybao0730

最新推荐文章于 2024-10-15 00:03:51 发布

阅读量342

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/linglun3/article/details/44983155

版权

leetcode 专栏收录该内容

101 篇文章 0 订阅

订阅专栏

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,
这里写图片描述
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.

这题很明显用递归的方法，从上往下。注意递归的写法。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int answer=0;

    void sum(TreeNode *root, int num)
    {
        if(root->left==0 && root->right==0) answer=answer+num;
        if(root->left) sum(root->left,num*10+root->left->val);
        if(root->right) sum(root->right,num*10+root->right->val);
    }

    int sumNumbers(TreeNode *root) {
        if(root==NULL) return 0;
        sum(root, root->val);
        return answer;
    }
};