【leetcode】129. Sum Root to Leaf Numbers

题目：

---

思路：
比较容易。用递归的方式对树的每一个叶子节点进行遍历并将每个“路径数字”（路径上所有节点值组成的数字）相加即可。

---

代码实现：

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

discuss:

// 先序遍历
class Solution {
public:
    int sumNumbers(TreeNode* root) {
        return sumH(root, 0);
    }
    
    int sumH(TreeNode *root, int curr){
        if (!root) return 0;
        
        int sumTillHere = curr * 10 + root->val;
        if (!root->left && !root->right) return sumTillHere;
        
        return sumH(root->left, sumTillHere) + sumH(root->right, sumTillHere);
    }
};