113. Path Sum II

最新推荐文章于 2020-03-20 17:18:08 发布

万里归来少年心

最新推荐文章于 2020-03-20 17:18:08 发布

阅读量222

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： binary tree root-to-leaf paths 113. Path Sum II

本文链接：https://blog.csdn.net/liyazhen2011/article/details/86512199

LeetCode 专栏收录该内容

85 篇文章

订阅专栏

本文介绍了两种查找二叉树中所有从根节点到叶子节点的路径，使得路径上节点值之和等于给定目标值的方法。一种是迭代法，通过使用栈来实现树的遍历；另一种是递归法，利用递归特性简化代码。两种方法均能有效地解决问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

      5
     / \
    4   8
   /   / \
  11  13  4
 /  \    / \
7    2  5   1

Return:

[
   [5,4,11,2],
   [5,8,4,5]
]

方法一：迭代


/**
 * 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:
    	vector<vector<int>> pathSum(TreeNode* root, int sum) {
		vector<vector<int>> result;
		vector<int> res;

		if (root == NULL)
			return result;
		stack<TreeNode*> stackNode;
		TreeNode* pre = NULL;
		int count = 0;
		while (root != NULL || !stackNode.empty())
		{
			while (root)
			{
				stackNode.push(root);
				res.push_back(root->val);
				count += root->val;
				root = root->left;
			}
			TreeNode* temp = stackNode.top();
			if (temp->right != NULL && temp->right != pre)
			{
				root = temp->right;
				continue;
			}

			if (temp->left == NULL && temp->right == NULL && count == sum)
			{				
				result.push_back(res);
			}
			stackNode.pop();
			res.pop_back();
			pre = temp;
			count -= temp->val;	
			root = NULL;
		}
		return result;
	}
};

方法二：递归

/**
* 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:
	vector<vector<int>> pathSum(TreeNode* root, int sum) {
		vector<int> res;
		if (root == NULL)
			return result;
		helper(root, res, 0, sum);
		return result;
	}

private:
	vector<vector<int>> result;
	void helper(TreeNode* root, vector<int> temp, int cur, int sum)
	{
		if (root == NULL)
			return;
		temp.push_back(root->val);
		if (root->left == NULL && root->right == NULL && cur + root->val == sum)
		{
			result.push_back(temp);
			return;
		}

		helper(root->left, temp, root->val + cur, sum);
		helper(root->right, temp, root->val + cur, sum);
	}
};