题目描述
输入一棵二叉树和一个整数,打印出二叉树中节点值的和为输入整数的所有路径。从树的根节点开始往下一直到叶节点所经过的节点形成一条路径。
示例:
给定如下二叉树,以及目标和 sum = 22
,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]
提示:
节点总数 <= 10000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof
代码实现
/**
* 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;
if(!root) return result;
vector<vector<int>> candidate = collectPath(root);
for(auto cit = candidate.begin(); cit != candidate.end(); cit++){
int sumtmp = 0;
for(auto ccit = (*cit).begin(); ccit != (*cit).end(); ccit++){
sumtmp += (*ccit);
}
if(sum == sumtmp)
result.push_back((*cit));
}
return result;
}
vector<vector<int>> collectPath(TreeNode* root) {
vector<vector<int>> result;
if((!root->left) && (!root->right)){
vector<int> nodevec;
nodevec.push_back(root->val);
result.push_back(nodevec);
}
if(root->left){
vector<vector<int>> leftPathes = collectPath(root->left);
for(auto pait = leftPathes.begin(); pait != leftPathes.end(); pait++){
(*pait).insert((*pait).begin(), root->val);
result.push_back((*pait));
}
}
if(root->right){
vector<vector<int>> rightPathes = collectPath(root->right);
for(auto pait = rightPathes.begin(); pait != rightPathes.end(); pait++){
(*pait).insert((*pait).begin(), root->val);
result.push_back((*pait));
}
}
return result;
}
};