LeetCode第 113 题：路径总和 II (C++)

113. 路径总和 II - 力扣（LeetCode）

找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

注意路径末尾得是叶子节点！

dfs回溯：

class Solution {
public:
    vector<vector<int>> res;
    vector<int> tmp;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        if(!root) return res;
        dfs(root, sum);
        return res;
    }

    void dfs(TreeNode* root, int sum){
        //cout << root->val << " " << sum <<  " " << tmp.size() << endl;
        if(sum == root->val && !root->left && !root->right){
            tmp.push_back(root->val);
            res.push_back(tmp);
            tmp.pop_back();
            return;
        }
        tmp.push_back(root->val);//做出选择
        if(root->left)
            dfs(root->left, sum-root->val);
        if(root->right)
            dfs(root->right, sum-root->val);
        tmp.pop_back();//撤销选择
    }
};

优化一下写法：

class Solution {
public:
    vector<vector<int>> res;
    vector<int> tmp;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        dfs(root, sum);
        return res;
    }

    void dfs(TreeNode* root, int sum){
        if(!root) return;
        tmp.push_back(root->val);
        if(sum == root->val && !root->left && !root->right)
            res.push_back(tmp);
        dfs(root->left, sum-root->val);
        dfs(root->right, sum-root->val);
        tmp.pop_back();//撤销选择
    }
};