/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
class Solution {
public:
/**
*
* @param root TreeNode类
* @param sum int整型
* @return int整型vector<vector<>>
*/
vector<vector<int> > pathSum(TreeNode* root, int sum) {
vector<int> v;
vector<vector<int>> vv;
path(root,sum,v,vv);
return vv;
}
void path(TreeNode* root, int sum,vector<int> v,vector<vector<int>> &vv){
if(root==NULL) return;
v.push_back(root->val);
if(root->left==NULL&&root->right==NULL&&sum-root->val==0)
{vv.push_back(v);}
path(root->left,sum-root->val,v,vv);
path(root->right,sum-root->val,v,vv);
}
};
本文借鉴牛客网用户UESTCODER
版权声明：本文为weixin_47487155原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。