leetCode练习（129）

题目：Sum Root to Leaf Numbers

难度：medium

问题描述：

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.

解题思路：

使用BFS，使得树变为（1，12，13），将没有子节点的节点的val相加即得总和。

代码如下：

/**
 * Definition for a binary tree node.
 * 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;
        Queue<TreeNode> queue=new ArrayDeque<>();
        int sum=0;
        queue.add(root);
        while(!queue.isEmpty()){
        	TreeNode temp=queue.poll();
        	if(temp.left!=null){
        		temp.left.val+=temp.val*10;
        		queue.add(temp.left);
        		if(temp.right!=null){
            		temp.right.val+=temp.val*10;
            		queue.add(temp.right);
            	}
        	}else{
        		if(temp.right!=null){
            		temp.right.val+=temp.val*10;
            		queue.add(temp.right);
            	}else{
            		sum+=temp.val;
            	}
        	}
        }
        return sum;
    }
}