路径总和2
代码
/**
* 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>> result;
vector<vector<int>> pathSum(TreeNode* root, int sum) {
//这里使用的技术也是跟组合数差不多的方法
vector<int> temp;
huisu(root,sum,temp);
return result;
}
void huisu(TreeNode* root,int sum,vector<int>& temp)
{
if(root==NULL)
return;
temp.push_back(root->val);
if(root->left==NULL&&root->right==NULL&&sum==root->val)
result.push_back(temp);
huisu(root->left,sum-root->val,temp);
huisu(root->right,sum-root->val,temp);
temp.pop_back();
}
};