class Solution {
public:
vector<vector<int>> res;//存储答案
vector<int> path;//存储当前路径
vector<vector<int>> pathSum(TreeNode* root, int sum) {//主函数
helper(root ,sum);//调用递归函数
return res;
}
private:
void helper(TreeNode* root , int sum){
if(root == nullptr) return;
path.push_back(root -> val);
sum -= root -> val;
if(sum == 0 && root -> left == nullptr && root -> right == nullptr){
res.push_back(path);
}
helper(root -> left ,sum);
helper(root -> right ,sum);
path.pop_back();
}
};