首页 > 其他 > 详细

Sum Root to Leaf Numbers

时间:2014-03-05 03:51:21      阅读:427      评论:0      收藏: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.

很简单的题……

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int sum = 0;
    int sumNumbers(TreeNode *root) {
        if(root == NULL)return 0;
        bi(root,0);
        return sum;
    }
    void bi(TreeNode *root ,int num)
    {
        num*=10;
        num+=root->val;
        if(root->left  == NULL && root->right == NULL)
        {
            sum += num;
            return;
        }
        if(root->left  != NULL) bi(root->left,num);
 
        if(root->right  != NULL)bi(root->right,num);
         
    }
};

  

Sum Root to Leaf Numbers,布布扣,bubuko.com

Sum Root to Leaf Numbers

原文:http://www.cnblogs.com/pengyu2003/p/3580484.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!