当前位置 : 首页 » 文章分类 :  算法  »  LeetCode.1022.Sum of Root To Leaf Binary Numbers 从根到叶的二进制数之和

LeetCode.1022.Sum of Root To Leaf Binary Numbers 从根到叶的二进制数之和

题目描述

1022 Sum of Root To Leaf Binary Numbers
https://leetcode-cn.com/problems/sum-of-root-to-leaf-binary-numbers/

Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.

For all leaves in the tree, consider the numbers represented by the path from the root to that leaf.

Return the sum of these numbers.

Example 1:

Input: [1,0,1,0,1,0,1]

       1
      / \
     0   1
   / \  / \
  0   1 0  1

Output: 22
Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22

Note:

  1. The number of nodes in the tree is between 1 and 1000.
  2. node.val is 0 or 1.
  3. The answer will not exceed 2^31 - 1.

解题过程

一开始想把从根到每个结点的路径传给递归的子树,到达根时就计算并累加。
后来发现parent的二进制值是可累计计算的,不需要每次从根开始算一遍,只需要把计算好的二进制值传给子树即可。
最终写了个用 queue 的层次遍历,其实直接写递归 dfs 也可以。

时间复杂度 O(n),空间复杂度 O(n)

import javafx.util.Pair;
private static class SolutionV2020 {
    public int sumRootToLeaf(TreeNode root) {
        if (null == root) {
            return 0;
        }
        int sum = 0;
        // pair的右值是树结点的parent所表示的二进制数和
        Deque<Pair<TreeNode, Integer>> queue = new LinkedList<>();
        queue.offer(new Pair<>(root, 0));
        while (!queue.isEmpty()) {
            Pair<TreeNode, Integer> pair = queue.poll();
            TreeNode node = pair.getKey();
            // 当前节点node表示的二进制数和
            int thisSum = pair.getValue() * 2 + node.val;
            // node是叶子节点,累加和到sum
            if (null == node.left && null == node.right) {
                sum += thisSum;
            }
            if (null != node.left) {
                queue.offer(new Pair<>(node.left, thisSum));
            }
            if (null != node.right) {
                queue.offer(new Pair<>(node.right, thisSum));
            }
        }
        return sum;
    }
}

GitHub代码

algorithms/leetcode/leetcode/_1022_SumOfRootToLeafBinaryNumbers.java
https://github.com/masikkk/algorithms/blob/master/leetcode/leetcode/_1022_SumOfRootToLeafBinaryNumbers.java


上一篇 LeetCode.993.Cousins in Binary Tree 二叉树中的堂兄弟

下一篇 LeetCode.965.Univalued Binary Tree 单值二叉树

阅读
评论
423
阅读预计2分钟
创建日期 2020-02-02
修改日期 2020-02-02
类别

页面信息

location:
protocol:
host:
hostname:
origin:
pathname:
href:
document:
referrer:
navigator:
platform:
userAgent:

评论