題目

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

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

總結

以上是生活随笔為你收集整理的【LeetCode从零单排】No129 Sum Root to Leaf Numbers的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。