129. Sum Root to Leaf Numbers | 二叉树整数和

• Total Accepted: 105665
• Total Submissions: 295189
• Difficulty: Medium
• Contributor: LeetCode

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.

Subscribe to see which companies asked this question.

思路：深度优先遍历。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
  public int sumNumbers(TreeNode root) {
		int sumNumber = 0;
		int currNum = 0;
		return sumNumbersHelper(root, currNum);

	}

	public int sumNumbersHelper(TreeNode root, int currNum) {
		int sum  =0 ;
		if (root == null) {
			return sum;
		}
		if (root.left == null && root.right == null) {
			currNum = currNum * 10 + root.val;
			sum+=currNum;
			return sum;
		}
		int left =sumNumbersHelper(root.left, currNum * 10 + root.val);
		int right = sumNumbersHelper(root.right, currNum * 10 + root.val);
		return left+right;
	}
}