LeetCode-Sum Root to Leaf Numbers

最新推荐文章于 2014-08-18 12:01:34 发布

所难

最新推荐文章于 2014-08-18 12:01:34 发布

阅读量249

点赞数

分类专栏： Cracking LeetCode Tree Recursion Trick 文章标签： leetcode Sum Root to Leaf Num

本文链接：https://blog.csdn.net/HolyDominat/article/details/38315391

版权

Cracking LeetCode 同时被 3 个专栏收录

152 篇文章 0 订阅

订阅专栏

Tree

26 篇文章 0 订阅

订阅专栏

Recursion

24 篇文章 0 订阅

订阅专栏

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.

Solution:

Code:

<span style="font-size:14px;">/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void helper(int &sum, TreeNode *root, int tempSum) {
        if (!root->left && !root->right) {
            sum += tempSum*10+root->val;
            return;
        }
        if (root->left) helper(sum, root->left, tempSum*10+root->val);
        if (root->right) helper(sum, root->right, tempSum*10+root->val);
    }
    
    int sumNumbers(TreeNode *root) {
        if (root == NULL) return 0;
        int sum = 0;
        helper(sum, root, 0);
        return sum;
    }
};</span>