Leetcode 129. 求根到叶子节点数字之和 解题思路及C++实现

解题思路：

经典的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:
    int sumNumbers(TreeNode* root) {
        //dfs问题
        if(!root) return 0;
        int res = 0;
        int cur = 0;
        dfs(root, res, cur);
        return res;
    }
    void dfs(TreeNode* root, int& res, int& cur){
        if(root) cur = cur * 10 + root->val;
        if(root && !root->left && !root->right){
            res += cur;
        }
        if(root->left) dfs(root->left, res, cur);
        if(root->right) dfs(root->right, res, cur);
        cur = (cur - root->val) / 10;
        return;
    }
};