题解 | #二叉树中和为某一值的路径(二)#

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/

class Solution {
private:
    int cur_sum = 0;
    vector<vector<int>> res;
    vector<int> cur_path;
public:
    vector<vector<int>> FindPath(TreeNode* root,int expectNumber) {
        dfs(root, expectNumber);
        return res;
    }
    
    void dfs(TreeNode* root, int expectNumber){
        if(root == nullptr){
            return;
        }
        
        cur_sum += root->val;
        cur_path.push_back(root->val);
        if(cur_sum == expectNumber && root->left == nullptr && root->right == nullptr){
            res.push_back(cur_path);
        }
        
        dfs(root->left, expectNumber);
        dfs(root->right, expectNumber);
        cur_sum -= root->val;
        cur_path.pop_back();
        
    }
    
};