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

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:// 时间复杂度O(n)，空间复杂度O(logn)
    int sum=0;
    int sumNumbers(TreeNode* root) {
        if(root==NULL) return 0;
        DFS(root, root->val);//先序遍历，深搜
        return sum;
    }
    void DFS(TreeNode* root, int value)
    {//深度优先搜索
        if(!root->left && !root->right)
        {//到达叶子节点
            sum += value;
        }
        if(root->left) DFS(root->left, value*10 + root->left->val);
        if(root->right) DFS(root->right, value*10 + root->right->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:// 时间复杂度O(n)，空间复杂度O(logn)
    int sumNumbers(TreeNode* root) {
        return DFS(root, 0);
    }
    int DFS(TreeNode* root, int presum)
    {//深度优先搜索
        if(root==NULL) return 0;
        if(!root->left && !root->right)
        {//到达叶子节点
            return presum*10 + root->val;
        }
        return DFS(root->left, presum*10+root->val) + DFS(root->right, presum*10+root->val);
    }
};