Given a Binary Tree Containing digits from0-9
Only,
Each root-to-leaf path cocould represent a number.
An example is the root-to-leaf path1->2->3
Which
Represents the number123
.
Find the total sum of all root-to-leaf numbers.
For example,
1 / \ 2 3
The root-to-leaf path1->2
Represents
The number12
.
The root-to-leaf path1->3
Represents
The number13
.
Return the sum = 12 + 13 =25
.
/** * 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;vector<int> tempNum;int toInt(vector<int>& num){ if(num.size() == 0) return 0;int ret = 0;for(int i = 0; i < num.size(); i ++)ret = ret * 10 + num[i];return ret;}void dfs(TreeNode* root){if(root == NULL){ return;} tempNum.push_back(root->val); if(root->left == NULL && root->right == NULL) { sum += toInt(tempNum); }dfs(root->left);dfs(root->right);tempNum.pop_back();}int sumNumbers(TreeNode *root) {// Start typing your C/C++ solution below// DO NOT write int main() functionsum = 0; tempNum.clear();dfs(root);return sum;}};
Only leaf nodes can be added. Determine whether the node is a leaf node.