标签：style class blog code http tar
Given a binary tree and a sum, find all root-to-leaf paths where each path‘s sum equals the given sum.
For example: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>> result;
vector<int> path;
pathSumHelper(result, path, root, sum);
return result;
}
private:
void pathSumHelper(vector<vector<int>> &result, vector<int> &path, TreeNode *node, int sum)
{
if(node == NULL) return;
if(node->left == NULL && node->right == NULL && node->val == sum)
{
path.push_back(node->val);
result.push_back(path);
path.pop_back();
return;
}
path.push_back(node->val);
pathSumHelper(result, path, node->left, sum - node->val);
pathSumHelper(result, path, node->right, sum - node->val);
path.pop_back();
}
};【Leetcode】Path Sum II,布布扣,bubuko.com
标签：style class blog code http tar
原文地址：http://blog.csdn.net/lipantechblog/article/details/32161873
