Java | Leetcode Java题解之第129题求根节点到叶节点数字之和

m0_57195758

于 2024-06-04 05:35:32 发布

阅读量403

点赞数 6

分类专栏：分享文章标签： Java Leetcode 题解

本文链接：https://blog.csdn.net/m0_57195758/article/details/139428380

版权

分享专栏收录该内容

475 篇文章 1 订阅

订阅专栏

题目：

题解：

class Solution {
    public int sumNumbers(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int sum = 0;
        Queue<TreeNode> nodeQueue = new LinkedList<TreeNode>();
        Queue<Integer> numQueue = new LinkedList<Integer>();
        nodeQueue.offer(root);
        numQueue.offer(root.val);
        while (!nodeQueue.isEmpty()) {
            TreeNode node = nodeQueue.poll();
            int num = numQueue.poll();
            TreeNode left = node.left, right = node.right;
            if (left == null && right == null) {
                sum += num;
            } else {
                if (left != null) {
                    nodeQueue.offer(left);
                    numQueue.offer(num * 10 + left.val);
                }
                if (right != null) {
                    nodeQueue.offer(right);
                    numQueue.offer(num * 10 + right.val);
                }
            }
        }
        return sum;
    }
}