113. 路径总和 II

题目描述

点这里

思路分析

二叉树+DFS
如何记录方案的问题。个人喜欢开$ans$和$path$全局变量数组。

代码实现

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