LeetCode 1022. 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:
[图见leetcode]
Input: [1,0,1,0,1,0,1]
Output: 22
Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22

Note:

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

    //when traversing, record the previous binary number, the current number is the 
    previous * 2(current is 0) or previous * 2 + 1(current is 1).
    
    public int sumRootToLeaf(TreeNode root) {
        int[] result = new int[1];
        helper(root, 0, result);
        return result[0];
    }
    public void helper(TreeNode root, int pre, int[] result) {
        if (root.left == null && root.right == null) {
            int num = root.val == 0 ? pre * 2 : pre * 2 + 1;
            result[0] = result[0] + num;
            return;
        }
        if (root.left != null) {
            if (root.val == 0) {
                helper(root.left, pre * 2, result);
            } else {
                helper(root.left, pre * 2 + 1, result);
            }
        } 
        if (root.right != null) {
            if (root.val == 0) {
                helper(root.right, pre * 2, result);
            } else {
                helper(root.right, pre * 2 + 1, result);
            }
        } 
        return;
    }
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值