Class Solution
java.lang.Object
g0101_0200.s0129_sum_root_to_leaf_numbers.Solution
129 - Sum Root to Leaf Numbers.<p>Medium</p>
<p>You are given the <code>root</code> of a binary tree containing digits from <code>0</code> to <code>9</code> only.</p>
<p>Each root-to-leaf path in the tree represents a number.</p>
<ul>
<li>For example, the root-to-leaf path <code>1 -> 2 -> 3</code> represents the number <code>123</code>.</li>
</ul>
<p>Return <em>the total sum of all root-to-leaf numbers</em>. Test cases are generated so that the answer will fit in a <strong>32-bit</strong> integer.</p>
<p>A <strong>leaf</strong> node is a node with no children.</p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2021/02/19/num1tree.jpg" alt="" /></p>
<p><strong>Input:</strong> root = [1,2,3]</p>
<p><strong>Output:</strong> 25</p>
<p><strong>Explanation:</strong> The root-to-leaf path <code>1->2</code> represents the number <code>12</code>. The root-to-leaf path <code>1->3</code> represents the number <code>13</code>. Therefore, sum = 12 + 13 = <code>25</code>.</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2021/02/19/num2tree.jpg" alt="" /></p>
<p><strong>Input:</strong> root = [4,9,0,5,1]</p>
<p><strong>Output:</strong> 1026</p>
<p><strong>Explanation:</strong> The root-to-leaf path <code>4->9->5</code> represents the number 495. The root-to-leaf path <code>4->9->1</code> represents the number 491. The root-to-leaf path <code>4->0</code> represents the number 40. Therefore, sum = 495 + 491 + 40 = <code>1026</code>.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li>The number of nodes in the tree is in the range <code>[1, 1000]</code>.</li>
<li><code>0 <= Node.val <= 9</code></li>
<li>The depth of the tree will not exceed <code>10</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
sumNumbers
-