关闭

129. Sum Root to Leaf Numbers

149人阅读 评论(0) 收藏 举报
分类:

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

 struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
	int sumNumbers(TreeNode* root) {
		if (root == NULL) return 0;
		sum = 0;
		dfs(root, 0);
		return sum;
	}
private:
	void dfs(TreeNode* root, int tmp){
		tmp = tmp * 10 + root->val;
		if (root->left == NULL&&root->right == NULL){
			sum += tmp;
		}
		if (root->left)
			dfs(root->left, tmp);
		if (root->right)
			dfs(root->right, tmp);
	}
	int sum;
};



0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:396729次
    • 积分:8054
    • 等级:
    • 排名:第2632名
    • 原创:390篇
    • 转载:276篇
    • 译文:0篇
    • 评论:27条
    联系方式
    E-mail:gwh_mail@qq.com QQ:1440156051
    最新评论