leetcode 113. 路径总和 II

思路

题目已经给的很明显了。这个很明显就是DFS的套路，走过就push_back，回退就pop_back。

代码

Talk is cheap, show me the code.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
        dfs(root, targetSum);
        return res;
    }

    void dfs(TreeNode* root, int targetSum){
        if(!root){
            return;
        }
        path.push_back(root->val); // 添加节点
        
        if(targetSum - root->val == 0 && !root->left && !root->right){
            res.push_back(path); // 如果路径上的节点和正好在叶子处是targetSum，那么就添加这条路径
        }
        
        // cout << "targetSum = " <<targetSum <<endl;
        // for(int i = 0; i < path.size(); i++){
        //     cout << path[i] << " ";
        // }
        // cout << endl;
        
        if(root->left){
            dfs(root->left, targetSum-root->val);
            path.pop_back(); // 回退，这条路不对。
            // targetSum+=root->val;
        }

        if(root->right){
            dfs(root->right, targetSum-root->val);
            path.pop_back(); // 回退，这条路不对。
            // targetSum+=root->val;
        }
        
    }
};