标签：style color io java ar for div art sp
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 number123.
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 binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumNumbers(TreeNode root) {
if(root==null)
{
return 0;
}
LinkedList<TreeNode> listNode=new LinkedList<TreeNode>();
LinkedList<Integer> partialValue=new LinkedList<Integer>();
int result=0;
listNode.add(root);
partialValue.add(root.val);
while(listNode.size()>0)
{
TreeNode node=listNode.poll();
int value=partialValue.poll();
if(node.left==null&&node.right==null)
{
result+=value;
continue;
}
if(node.left!=null)
{
listNode.add(node.left);
partialValue.add(value*10+node.left.val);
}
if(node.right!=null)
{
listNode.add(node.right);
partialValue.add(value*10+node.right.val);
}
}
return result;
}
}标签：style color io java ar for div art sp
原文地址：http://blog.csdn.net/jiewuyou/article/details/39395337
