首页 > 其他 > 详细

leetcode Sum Root to Leaf Numbers 难度系数2 2.26

时间:2014-01-29 00:08:14      阅读:531      评论:0      收藏:0      [点我收藏+]

Question:

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.


leetcode Sum Root to Leaf Numbers 难度系数2 2.26

原文:http://blog.csdn.net/yiding_he/article/details/18840433

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!