129. Sum Root to Leaf Numbers

最新推荐文章于 2020-01-27 05:04:47 发布

薛离子

最新推荐文章于 2020-01-27 05:04:47 发布

阅读量219

点赞数

分类专栏： LeetCode LeetCode 文章标签： LeetCode 路径求和二叉树深度优先

本文链接：https://blog.csdn.net/teffi/article/details/53930183

版权

LeetCode 同时被 2 个专栏收录

98 篇文章 1 订阅

订阅专栏

LeetCode

98 篇文章 1 订阅

订阅专栏

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,

    1
   / \
  2   3

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 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) {
        return dfs(root, 0);
    }

    int dfs(TreeNode *root, int sum) {
        if (root == NULL) return 0;

        if (!root->left && !root->right) 
            return sum * 10 + root->val;

        return dfs(root->left, sum * 10 + root->val)
            + dfs(root->right, sum * 10 + root->val);
    }
};

解法二：

/**
 * 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) {
        vector<string> result;
        if (root == NULL) return 0;
        sumNumbers(root, result, to_string(root->val));

        int sum = 0;
        for (int i = 0; i < result.size(); i++) {
            sum += atoi(result[i].c_str());
        }

        return sum;
    }

    void sumNumbers(TreeNode *root, vector<string> &result, string str) {
        if (root && !root->left && !root->right) {
            result.push_back(str);
            return;
        }

        if (root->left)
            sumNumbers(root->left, result, str + to_string(root->left->val));
        if (root->right)
            sumNumbers(root->right, result, str + to_string(root->right->val));
    }
};