剑指Offer-34.二叉树中和为某一值的路径

考点：回溯

class Solution {
public:
    vector<vector<int>>ret;
    vector<int>path;
    void dfs(TreeNode* root,int target){
        if(root==nullptr){
            return;
        }
        path.emplace_back(root->val);
        target-=root->val;
        if(root->left==nullptr&&root->right==nullptr&&target==0){
            ret.emplace_back(path);
        }
        dfs(root->left,target);
        dfs(root->right,target);
        path.pop_back();
    }
    vector<vector<int>> pathSum(TreeNode* root, int target) {
        dfs(root,target);
        return ret;
    }
};