LeetCode Path Sum II

最新推荐文章于 2021-11-23 19:25:16 发布

kassical

最新推荐文章于 2021-11-23 19:25:16 发布

阅读量386

点赞数

分类专栏： LeetCode 文章标签： leetcode 二叉树前序遍历

本文链接：https://blog.csdn.net/kassical/article/details/38518117

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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

For 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 binary tree
 * 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> > ivec;
		vector<int> ivecpath;
		if (root == NULL)
			return ivec;

		int cursum = 0;
		findpath(root, ivec, ivecpath, cursum, sum);
		return ivec;
	}

	void findpath(TreeNode *root, vector<vector<int> > &ivec, vector<int> &ivecpath,
		int &cursum, int sum) {
		cursum += root->val;
		ivecpath.push_back(root->val);

		if (root->left == NULL && root->right == NULL && cursum == sum) {
			ivec.push_back(ivecpath);
		}
		
		if (root->left != NULL)
			findpath(root->left, ivec, ivecpath, cursum, sum);
		if (root->right != NULL)
			findpath(root->right, ivec, ivecpath, cursum, sum);

		ivecpath.pop_back();
		cursum -= root->val;
	}
};