目录
💎一、题目
🏆1.题目描述
🏆2.原题链接
💎二、解题报告
🏆1.思路分析
🔑思路:
判断某一路径上的值相加是否符合条件,不符合则回溯,结束条件是,值相加符合并且走到叶子节点
🏆2.代码详解
/**
* 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>> pathSum(TreeNode* root, int target) {
vector<vector<int>> vv;
if(!root) return vv;
vector<int> v;
dfs(root, target, vv, v);
return vv;
}
void dfs(TreeNode* root, int target, vector<vector<int>>& vv, vector<int>& v)
{
target -= root->val;
v.push_back(root->val);
if(!target && !root->left && !root->right) //1
vv.push_back(v);
if(root->left)dfs(root->left, target, vv, v);
if(root->right)dfs(root->right, target, vv, v);
v.pop_back(); //2
}
};
1.只有刚好这条路径走完并且值符合target能够记录路径
2.回溯的时候,如果该路径不满足条件则将该路径删除