class Solution {
vector<vector<int>> res;
void bacttrack(vector<int>& track,int sum,TreeNode* root){
if(!root)
return ;
track.push_back(root->val);
sum-=root->val;
if(sum==0 && root->left==NULL && root->right==NULL){
res.push_back(track);
}
bacttrack(track,sum,root->left);
bacttrack(track,sum,root->right);
track.pop_back();
}
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<int> track;
bacttrack(track,sum,root);
return res;
}
};
剑指 Offer 34. 二叉树中和为某一值的路径
最新推荐文章于 2021-04-01 11:28:01 发布