剑指0ffer——面试题34. 二叉树中和为某一值的路径
代码:
/**
* 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 {
private:
vector<vector<int> > result;
vector<int> path;
public:
vector<vector<int>> pathSum(TreeNode* root, int target) {
dfs(root, target);
return result;
}
void dfs(TreeNode* root, int tar) {
//递归的出口
if (nullptr == root) return;
//满足一定条件的方案存储
path.push_back(root->val);
tar -= root->val;
if (0 == tar && nullptr == root->left && nullptr == root->right)
result.push_back(path);
//递归的拆解
dfs(root->left, tar);
dfs(root->right, tar);
path.pop_back();//恢复现场
}
};