/**
* 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) {
int[] sum = new int[1];
sum(root, 0, sum);
return sum[0];
}
public void sum(TreeNode root, int num, int[] sum){
if (root == null) return;
num = num*10+root.val;
if (root.left==null && root.right==null){
sum[0] += num;
return;
}
sum(root.left, num, sum);
sum(root.right, num, sum);
}
}
Sum Root to Leaf Numbers
最新推荐文章于 2022-04-08 10:01:02 发布