【LeetCode】129.Sum Root to Leaf Numbers（Medium）解题报告

最新推荐文章于 2020-10-29 09:30:55 发布

郝春雨

最新推荐文章于 2020-10-29 09:30:55 发布

阅读量182

点赞数

分类专栏： LeetCode Tree 文章标签： leetcode tree

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79859661

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Tree

47 篇文章 0 订阅

订阅专栏

【LeetCode】129.Sum Root to Leaf Numbers（Medium）解题报告

题目地址：https://leetcode.com/problems/sum-root-to-leaf-numbers/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.

For example,

    1
   / \
  2   3
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.

Return the sum = 12 + 13 = 25.

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 time : O(n)
 space : O(n)
 */
class Solution {
    public int sumNumbers(TreeNode root) {
        return helper(root,0);
    }
    public int helper(TreeNode root,int num){
        if(root == null) return 0;
        if(root.left == null && root.right == null){
            return num*10+root.val;
        }
        return helper(root.left,num*10+root.val)+
            helper(root.right,num*10+root.val);
    }
}