Leetcode 129. Sum Root to Leaf Numbers (Medium) (cpp)

最新推荐文章于 2026-06-25 15:00:00 发布

原创最新推荐文章于 2026-06-25 15:00:00 发布 · 457 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #cpp

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Tree

48 篇文章

订阅专栏

本文介绍了解决LeetCode上编号为129的题目“Sum Root to Leaf Numbers”的方法。该题要求给定一棵只包含0到9数字的二叉树，求所有从根节点到叶子节点的路径所表示数字的总和。文章提供了使用深度优先搜索算法的C++实现代码。

Leetcode 129. Sum Root to Leaf Numbers (Medium) (cpp)

Tag: Tree, Depth-first Search

Difficulty: Medium

/*

129. Sum Root to Leaf Numbers (Medium)

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.

*/
/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
	int sumNumbers(TreeNode* root) {
		vector<int> nums;
		int num = 0;
		sumNumber(root, nums, num);
		num = 0;
		for (int i : nums) {
			num += i;
		}
		return num;
	}
private:
	void sumNumber(TreeNode* root, vector<int>& nums, int& num) {
		if (root == NULL) {
			nums.push_back(0);
			return;
		}
		num = 10 * num + root->val;
		if (root->left == NULL && root->right == NULL) {
			nums.push_back(num);
			num /= 10;
			return;
		}
		if (root->left != NULL) {
			sumNumber(root->left, nums, num);
		}
		if (root->right != NULL) {
			sumNumber(root->right, nums, num);
		}
		num /= 10;
	}
};