给定仅包含来自0-9
的数字的二叉树,每个根到叶路径可以表示数字。举个例子:root-to-leaf路径1-> 2-> 3
,它代表数字123
,找到所有根到叶的数的总和
样例
样例1
输入: {1,2,3}
输出: 25
解释:
1
/ \
2 3
路径 1->2 表示数字 12.
路径 1->3 表示数字 13.
因此, sum = 12 + 13 = 25.
样例2
输入: {4,9,0,5,1}
输出: 1026
解释:
4
/ \
9 0
/ \
5 1
路径 4->9->5 表示数字 495.
路径 4->9->1 表示数字 491.
路径 4->0 表示数字 40.
因此, sum = 495 + 491 + 40 = 1026.
注意事项
叶节点是没有子节点的节点
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root: the root of the tree
* @return: the total sum of all root-to-leaf numbers
*/
int sumNumbers(TreeNode * root) {
// write your code here
if(root == NULL)
{
return 0;
}
TreeNode* p = root;
TreeNode* r;
int sum = 0;
bool flag;
stack<TreeNode*> s1;
stack<TreeNode*> s2;
do
{
while(p != NULL)
{
s1.push(p);
s2.push(p);
p = p->left;
} //找到最左下角的节点,这个节点没有左子树
r = NULL;
flag = true;
//cout<<"s1.size() = "<<s1.size()<<endl;
//cout<<"s2.size() = "<<s2.size()<<endl;
while(!s1.empty() && flag)
{
p = s1.top();
if(p->right == r)
{
if(p->left == NULL && p->right == NULL) //叶子节点
{
//string tmp;
int numtmp = 0;
for(int i = 0; i<s1.size(); i++)
{
//tmp = tmp + s2.pop->val;
TreeNode* tmp = s2.top();
numtmp = numtmp + (tmp->val)*pow(10,i);
//cout<<"numtmp = "<<numtmp<<endl;
s2.pop();
}
sum = sum + numtmp;
//cout<<"sum = "<<sum<<endl;
}
s2 =s1;
p = s1.top();
r = p;
s1.pop();
s2.pop();
}
else
{
p = p->right;
flag = false;
}
}
// return 1;
}while(!s1.empty());
return sum;
}
};