LeetCode 113. 路径总和 II--二叉树

AC代码

/**
 * 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<int>q;
    vector<vector<int>>pu;
    void dfs(TreeNode* root,int sum,int ans)
    {
        if(root->left==NULL&&root->right==NULL)
        {
            if(ans==sum)
            pu.push_back(q);
            return;
        }
        if(root->left!=NULL)
        {
            q.push_back(root->left->val);
            dfs(root->left,sum,ans+root->left->val);
            q.pop_back();
        }
        if(root->right!=NULL)
        {
            q.push_back(root->right->val);
            dfs(root->right,sum,ans+root->right->val);
            q.pop_back();
        }
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        if(root==NULL)return pu;
        q.push_back(root->val);
        dfs(root,sum,root->val);
        return pu;
    }
};