LeetCode - 113. Path Sum II

题目

LeetCode - 113. Path Sum II

题目链接

https://leetcode.com/problems/path-sum-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<int> tmppath;
    
    vector<vector<int>> ans;
    void dfs(TreeNode* root, int sum){
        if(root){
            tmppath.push_back(root->val);
            if(root->left == nullptr && root->right == nullptr){
                if(sum == root->val) {
                    ans.push_back(tmppath);
                }
            }else{
                dfs(root->left, sum - root->val);
                dfs(root->right, sum - root->val);
            }
            tmppath.pop_back();
        }
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        dfs(root, sum);
        return ans;
    }
};