leetcode：Sum Root to Leaf Numbers

最新推荐文章于 2022-01-25 11:20:00 发布

SCAU啊源

最新推荐文章于 2022-01-25 11:20:00 发布

阅读量431

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/chanrenyuan/article/details/30972159

版权

leetcode 专栏收录该内容

168 篇文章 0 订阅

订阅专栏

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.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    static int ans= 0;
    public int sumNumbers(TreeNode root) {
        ans = 0;
        travel(root, 0);
        return ans;
    }
    
    public static boolean isLeaf(TreeNode node){
        return node.left == null && node.right == null;
    }
    public static void travel(TreeNode node, int currentNum){
        if(node != null){
            if(isLeaf(node)){
                ans += currentNum * 10 + node.val;
            }
            else{
                travel(node.left, currentNum * 10 + node.val);
                travel(node.right, currentNum * 10 + node.val);
            }
        }
    }
}