LeetCode113 Path Sum II 二叉树沿途路径和II

最新推荐文章于 2018-09-14 15:54:33 发布

tigerhuli

最新推荐文章于 2018-09-14 15:54:33 发布

阅读量139

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/m0_37518259/article/details/81195211

版权

LeetCode 专栏收录该内容

503 篇文章 3 订阅

订阅专栏

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]
]

题源：here；完整实现：here

思路：

同上一题一样，但是在过程中需要记录每个遍历的数。

void helper(TreeNode *root, int sum, vector<int>& solution, vector<vector<int>>& vvInt){
	if (!root) return;
	sum -= root->val;
	solution.push_back(root->val);
	if (!root->left && !root->right && !sum){
		vvInt.push_back(solution);
		solution.pop_back();
		return;
	}
	if (root->left){
		helper(root->left, sum, solution, vvInt);
	}
	if (root->right){
		helper(root->right, sum, solution, vvInt);
	}
	solution.pop_back();
}

vector<vector<int>> pathSum(TreeNode* root, int sum) {
	vector<vector<int>> vvInt;
	vector<int> solution;
	helper(root, sum, solution, vvInt);
	return vvInt;
}