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] ]
思路
树的遍历递归,注意vector中节点的顺序。这里我想令写一个函数,换成返回值是一个vector<deque<int> >应该会更好,这样就不用把顺序反过来了,直接push_front就好了。
/**
* 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) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
vector<vector<int> > res;
if(root == NULL) return res;
if(root->left == NULL && root->right == NULL)
{
if(sum == root->val)
{
vector<int> tmp;
tmp.push_back(root->val);
res.push_back(tmp);
}
}
else
{
if(root->left !=NULL)
{
vector<vector<int> > resl=pathSum(root->left, sum - root->val);
//if(resl.size() == 0) return res;//root->left == NULL or has NO path
for(int i = 0; i < resl.size(); i ++)
{
if(resl[i].size() != 0)
{
vector<int> tmp;
tmp.push_back(root->val);
for(int j = 0; j < resl[i].size(); j++)
{
tmp.push_back(resl[i][j]);
}
res.push_back(tmp);
}
}
}
if(root->right !=NULL)
{
vector<vector<int> > resr=pathSum(root->right, sum - root->val);
//if(resl.size() == 0) return res;//root->left == NULL or has NO path
for(int i = 0; i < resr.size(); i ++)
{
if(resr[i].size() != 0)
{
vector<int> tmp;
tmp.push_back(root->val);
for(int j = 0; j < resr[i].size(); j++)
{
tmp.push_back(resr[i][j]);
}
res.push_back(tmp);
}
}
}
}
return res;
}
};