113. Path Sum II

class Solution {
public:
    vector<int> s;
    vector<vector<int>> ans;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        go(root, 0, sum);
        return ans;
    }

    void go(TreeNode *p, int cur,int sum){
        if(!p) return;
        s.push_back(p->val);
        cur += p->val;
        if(!p->left && !p->right && cur == sum)
            ans.push_back(s);

        if(p->left) go(p->left, cur, sum);
        if(p->right) go(p->right, cur, sum);

        s.pop_back();
    }
};