class Solution {
public:
vector<vector<int>> ans;
vector<int> temp;
vector<vector<int>> pathSum(TreeNode* root, int target) {
if(root==nullptr)
return {};
pathsearch(target,root);
return ans;
}
void pathsearch(int sum,TreeNode* root){
if(root==nullptr)
return ;
temp.push_back(root->val);
sum=sum-root->val;
if((!root->left) && (!root->right) && (sum==0)){
ans.push_back(temp);
}
if(root->left)
pathsearch(sum,root->left);
if(root->right)
pathsearch(sum,root->right);
temp.pop_back();
}
};
05-05
1万+
06-06