https://leetcode.com/problems/path-sum-ii/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<int> tmp;
vector<vector<int>> x;
if(root==nullptr) return x;
dfs(root, sum, tmp);
return result;
}
vector<vector<int>> result;
void dfs(TreeNode* root, int sum, vector<int>&tmp){
if(root==nullptr){//当前节点为空
if(sum==0){
result.push_back(tmp);
}
}
//当前节点不为空,左右子节点为空
else if(root->left == nullptr && root->right==nullptr){
if(root->val == sum){
tmp.push_back(root->val);
result.push_back(tmp);
}
}
//还有2个子节点
else if(root->left !=nullptr && root->right!=nullptr){
tmp.push_back(root->val);
vector<int> s=tmp;
dfs(root->left, sum- root->val, tmp);
dfs(root->right, sum- root->val, s);
}
//仅有左节点
else if(root->left !=nullptr && root->right==nullptr){
tmp.push_back(root->val);
dfs(root->left, sum- root->val, tmp);
}
//仅有右节点
else if(root->left ==nullptr && root->right!=nullptr){
tmp.push_back(root->val);
dfs(root->right, sum- root->val, tmp);
}
}
};