方法1: 最简单的方法肯定是recursion。这个方法全称应该是dfs preodrder traversal using recursion。时间复杂n,空间复杂logn。
/**
* 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;
* }
* }
*/
class Solution {
int ans = 0;
public int sumNumbers(TreeNode root) {
int sum = 0;
helper(root, sum);
return ans;
}
public void helper(TreeNode root, int sum){
if(root == null) return;
if(root.left == null && root.right == null){
sum = sum * 10 + root.val;
ans += sum;
}
helper(root.left, sum * 10 + root.val);
helper(root.right, sum * 10 + root.val);
}
}
方法2: iteration。全称dfs preorder tarversal using iteration 。时间复杂n,空间复杂logn。这个方法我没实现,因为看了下觉得不难,复盘的时候自己可以去实现一下。
总结:
- 无