LeetCode 129. 求根节点到叶节点数字之和
给你一个二叉树的根节点 root ,树中每个节点都存放有一个 0 到 9 之间的数字。
每条从根节点到叶节点的路径都代表一个数字:
例如,从根节点到叶节点的路径 1 -> 2 -> 3 表示数字 123 。
计算从根节点到叶节点生成的 所有数字之和 。
叶节点 是指没有子节点的节点。
例如:
题解:
方法一:广度优先搜索。在广搜的过程中,将子节点的值设为当前节点的值*10+子节点的值。遇到叶子节点,就让ans加上叶子节点的修改后的值。
/**
* 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) {
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.offer(root);
int ans = 0;
while(!queue.isEmpty()){
TreeNode top = queue.poll();
if(top.left == null && top.right == null)
ans += top.val;
if(top.left != null){
top.left.val = top.val * 10 + top.left.val;
queue.offer(top.left);
}
if(top.right != null){
top.right.val = top.val * 10 + top.right.val;
queue.offer(top.right);
}
}
return ans;
}
}
方法二:深度优先搜索。
/**
* 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 dfs(TreeNode root, int presum){
if(root == null)return 0;
int sum = presum * 10 + root.val;
if(root.left == null && root.right == null){
return sum;
}
else{
return dfs(root.left, sum) + dfs(root.right, sum);
}
}
public int sumNumbers(TreeNode root) {
return dfs(root,0);
}
}
题目来源:https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/
题解参考:https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/solution/qiu-gen-dao-xie-zi-jie-dian-shu-zi-zhi-he-by-leetc/