Leetcode Sum Root to Leaf Numbers

题意：求从根结点到叶结点所组成的数字之和。

思路：DFS，分别求出每个数字，然后求和。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<string> re;
    int sumNumbers(TreeNode* root) {
        if(root == NULL) return 0;
        string s;
        dfs(s, root);
        int sum = 0;
        for(int i = 0; i < re.size(); i++) {
            sum += std::stoi(re[i]);
        }
        
        return sum;
    }
    void dfs(string s, TreeNode* root) {
        if(root == NULL) return;
        s += root->val + '0';
        if(root->left == NULL && root->right == NULL) {
            re.push_back(s);
        }
        if(root->left) dfs(s, root->left);
        if(root->right) dfs(s, root->right);
        
        return;
    }
};

或者另一种写法：

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