129-Sum Root to Leaf Numbers-CSDN博客

本文链接：https://blog.csdn.net/LaputaFallen/article/details/80447437

本文介绍了一种算法问题——二叉树路径之和的解决方法。该问题要求计算二叉树中所有从根节点到叶子节点路径所代表数字的总和。文中提供了两种解决方案：一种使用队列迭代，另一种采用递归方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

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.

Note: A leaf is a node with no children.

Example:

Input: [1,2,3]
    1
   / \
  2   3
Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.

Example 2:

Input: [4,9,0,5,1]
    4
   / \
  9   0
 / \
5   1
Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.

问题描述

给定二叉树，其节点的值仅为0-9间的数字，每个从根节点到叶子节点的路径可以代表一个数字。

例如根节点到叶子节点的路径为1->2->3, 代表123.

返回所有根节点到叶子节点组成的数之和

问题分析

从根节点到叶子节点的递归过程中注意将之前求得的和进位即可

解法1

public class Solution {
    public int sumNumbers(TreeNode root) {
        if(root == null) return 0;

        int total = 0;
        Queue<TreeNode> q = new LinkedList<>();
        Queue<Integer> sumq = new LinkedList<>();    
        q.offer(root);
        sumq.offer(root.val);

        while(!q.isEmpty()){
            TreeNode current = q.poll();
            int partialSum = sumq.poll();
            if(current.left == null && current.right == null){
                total += partialSum;
            }else{
                if(current.left != null){
                    q.offer(current.left);
                    sumq.offer(partialSum * 10 + current.left.val);
                }
                if(current.right !=null){
                    q.offer(current.right);
                    sumq.offer(partialSum * 10 + current.right.val);
                }
            }

        }

        return total;
    }
}

解法2

class Solution {
    public int sumNumbers(TreeNode root) {
        return sum(root, 0);
    }

    public int sum(TreeNode node, int sum) {
        if(node == null) return 0;
        if(node.left == null && node.right == null) return sum * 10 + node.val;
        return sum(node.left, sum *10 + node.val) + sum(node.right, sum * 10 + node.val);
    }
}