Leetcode 129. Sum Root to Leaf Numbers
题目链接: Sum Root to Leaf Numbers
难度:Medium
题目大意:
详见题目。
思路:
递归。可以根据二叉搜索树的特点来简化查找过程。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int sumNumbers(TreeNode root) {
int sum=0;
Queue<TreeNode> queue=new LinkedList<>();
Queue<Integer> value=new LinkedList<>();
//value为根节点到当前节点所表示的值
queue.offer(root);
value.offer(root.val);
while(!queue.isEmpty()){
int size=queue.size();
while(size-->0){
TreeNode node=queue.poll();
int curValue=value.poll();
if(node.left==null&&node.right==null){//叶子节点
sum+=curValue;
}
if(node.left!=null){
queue.offer(node.left);
value.offer(curValue*10+node.left.val);
}
if(node.right!=null){
queue.offer(node.right);
value.offer(curValue*10+node.right.val);
}
}
}
return sum;
}
}