g0101_0200.s0129_sum_root_to_leaf_numbers.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0101_0200.s0129_sum_root_to_leaf_numbers;
// #Medium #Depth_First_Search #Tree #Binary_Tree
// #2022_06_23_Time_0_ms_(100.00%)_Space_41.8_MB_(46.81%)
import com_github_leetcode.TreeNode;
/*
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class Solution {
private int sum = 0;
public int sumNumbers(TreeNode root) {
recurseSum(root, 0);
return sum;
}
private void recurseSum(TreeNode node, int curNum) {
if (node.left == null && node.right == null) {
sum += 10 * curNum + node.val;
} else {
if (node.left != null) {
recurseSum(node.left, 10 * curNum + node.val);
}
if (node.right != null) {
recurseSum(node.right, 10 * curNum + node.val);
}
}
}
}