LeetCode----sum-root-to-leaf-numbers

题目描述

Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.

An example is the root-to-leaf path1->2->3which represents the number123.

Find the total sum of all root-to-leaf numbers.

For example,

    1
   / \
  2   3

The root-to-leaf path1->2represents the number12.
The root-to-leaf path1->3represents the number13.

Return the sum = 12 + 13 =25.

---------------------------------------------------------------------------------------

思路：递归调用先序遍历。

C/C++ (clang++ 3.3)

1

/**

2

 * Definition for binary tree

3

 * struct TreeNode {

4

 *     int val;

5

 *     TreeNode *left;

6

 *     TreeNode *right;

7

 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}

8

 * };

9

 */

10

class Solution {

11

public:

12

    int sumNumbers(TreeNode *root) {

13

        int sum = 0;

14

        return preorderNumbers(root, sum);

15

    }

16

    int preorderNumbers(TreeNode *root, int sum){

17

        if (!root)

18

            return 0;

19

        sum = 10*sum + root->val;

20

        if (!root->left && !root->right)

21

            return sum;//递归出口

22

        return preorderNumbers(root->left, sum)+preorderNumbers(root->right, sum);

23

    }

24

};

您的代码已保存