【LeetCode从零单排】No129 Sum Root to Leaf Numbers

来源：互联网发布：php开发微信商城pdf 编辑：程序博客网时间：2024/05/16 05:11

题目

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 {     public int sumNumbers(TreeNode root) {    return sum(root, 0);}public int sum(TreeNode n, int s){    if (n == null) return 0;    if (n.right == null && n.left == null) return s*10 + n.val;    return sum(n.left, s*10 + n.val) + sum(n.right, s*10 + n.val);}}

代码下载：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文来自博客 “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/

0 0