Leetcode 113. 路径总和 II

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> ans;
    vector<int> temp;
    void dfs(TreeNode* root, int sum){
        if(!root->left && !root->right){
            if(sum==root->val) ans.push_back(temp);
            return;
        }
        if(root->left) temp.push_back(root->left->val),dfs(root->left,sum-root->val),temp.pop_back();
        if(root->right) temp.push_back(root->right->val),dfs(root->right,sum-root->val),temp.pop_back();
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        if(!root) return ans;
        temp.push_back(root->val),dfs(root,sum),temp.pop_back();
        return ans;
    }
};