剑指 Offer 34. 二叉树中和为某一值的路径

剑指 Offer 34. 二叉树中和为某一值的路径

给你二叉树的根节点 root 和一个整数目标和 targetSum ，找出所有 从根节点到叶子节点 路径总和等于给定目标和的路径。
叶子节点 是指没有子节点的节点。

示例 1：

输入：root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
输出：[[5,4,11,2],[5,8,4,5]]

示例 2：

输入：root = [1,2,3], targetSum = 5
输出：[]

示例 3：

输入：root = [1,2], targetSum = 0
输出：[]

提示：
树中节点总数在范围 [0, 5000] 内
-1000 <= Node.val <= 1000
-1000 <= targetSum <= 1000

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) {}
};
int n=-1;
TreeNode *create(vector<int> c){
    TreeNode* node;
    n++;
    if(n>=c.size()){return NULL;}
    else{
        if(c[n]==0) node=nullptr;
        else{
            node=new TreeNode(c[n]);
            node->left=create(c);
            node->right=create(c);
        }
    }
    return node;
}
//时间复杂度O(N) 空间复杂度O(N)
vector<vector<int> > v;//返回值
vector<int> path;//路径
void recur(TreeNode* root, int target){
    if (root==nullptr) return;
    path.push_back(root->val);
    target=target-root->val;
    //递归终止条件
    if(root->left==nullptr&&root->right==nullptr&&target==0) {v.emplace_back(path);}
    recur(root->left, target);
    recur(root->right, target);
    path.pop_back();
}
vector<vector<int>> pathSum(TreeNode* root, int target) {
    // if(root==nullptr) return v;
    recur(root, target);
    return v;
}
vector<int> DFS(TreeNode* &node){
    vector<int> v;
    if(node==nullptr) return v;
    queue<TreeNode*> q;
    q.push(node);
    while(!q.empty()){
        TreeNode* root = q.front();
        q.pop();
        v.push_back(root->val);
        if(root->left!=nullptr) q.push(root->left);
        if(root->right!=nullptr) q.push(root->right);
    }
    return v;
}
int main(){
    vector<int> tree;
    tree.push_back(5);
    tree.push_back(4);
    tree.push_back(11);
    tree.push_back(7);
    tree.push_back(0);
    tree.push_back(0);
    tree.push_back(2);
    tree.push_back(0);
    tree.push_back(0);
    tree.push_back(0);
    tree.push_back(8);
    tree.push_back(13);
    tree.push_back(0);
    tree.push_back(0);
    tree.push_back(4);
    tree.push_back(5);
    tree.push_back(0);
    tree.push_back(0);
    tree.push_back(1);
    tree.push_back(0);
    tree.push_back(0);
    TreeNode*node=create(tree);
    // vector<int> vx = DFS(node);
    // for(int i=0; i<vx.size(); i++){
    //     printf("%d ", vx[i]);
    // }
    v = pathSum(node, 22);
    for(int i=0;i<v.size(); i++){
        for(int j=0; j<v[i].size(); j++){
            printf("%d ", v[i][j]);
        }
        printf("\n");
    }
    return 0;
}