Leetcode NO.129 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.

本题难度算是比较低的，思路中规中矩，算是medium里简单的。。

第一步是用dfs把所有的path全遍历一遍，用string类型存储到一个vector里面

第二步是将vector里面所有的元素转化成int，然后求和，详细代码如下：

/**
 * 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) {
        // step 1: get all root-to-leaf numbers
        if (root == nullptr) {
            return 0;
        }
        dfs(root, to_string(root->val));
        // step 2: sum up all the numbers
        int sum = 0;
        for (int i = 0; i < rootToLeaf.size(); ++i) {
                sum += stoi(rootToLeaf[i]);
        }
        return sum;
    }
private:
    vector<string> rootToLeaf;
    void dfs(TreeNode* root, string tmp) {
        if (root->left == nullptr and root->right == nullptr) {
            rootToLeaf.push_back(tmp);
            return;
        }
        if (root->left != nullptr) {
            dfs(root->left, tmp + to_string(root->left->val));
        }
        if (root->right != nullptr) {
            dfs(root->right, tmp + to_string(root->right->val));
        }
    }
};