LeetCode Week 16

129. 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.

Note: A leaf is a node with no children.

Example:

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.
Example 2:

Input: [4,9,0,5,1]
4
/
9 0
/
5 1
Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.

solutions:

本题意是每个根到叶的路径都可以表示一个数字，需要找出所有根到叶的路径，最后输出路径代表的数字的和。

采用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) {
       if (!root) return 0;
        if (!root->left && !root->right) return root->val;
        int ans = 0;
        if (root->left) ans += dfs(root->left, root->val);
        if (root->right) ans += dfs(root->right, root->val);
        return ans;
    }
    
    
    int dfs(TreeNode* root, int v) {
        if (!root) return v;
        int cur_v =  v*10 + root->val;
        if (!root->left && !root->right) {
            return cur_v;
        }
        int ret = 0;
        if (root->left) ret += dfs(root->left, cur_v);
        if (root->right) ret += dfs(root->right, cur_v);
        return ret;
    }
};