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

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

上一篇:Best Practices for Assembly Loading


下一篇:Linux下安装pip报错:media changed:please insert the disc labeled...