LeetCode 113. 路径总和 II

https://leetcode-cn.com/problems/path-sum-ii/description/

LeetCode 113. 路径总和 II

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

说明: 叶子节点是指没有子节点的节点。

示例:
给定如下二叉树，以及目标和 sum = 22，

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1

返回:

[
   [5,4,11,2],
   [5,8,4,5]
]

---

/**
 * 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>>ans;
    vector<int>tmp;
    void DFS(TreeNode* root,int sum){
        if(root==NULL){
            return;
        }
        
        tmp.push_back(root->val);
        if(root->left==NULL&&root->right==NULL){
            if(sum==root->val){
                ans.push_back(tmp);
            }
        }
        DFS(root->left,sum-root->val);
        DFS(root->right,sum-root->val);
        tmp.pop_back();
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        DFS(root,sum);
        return ans;
    }
};

 

 

Path Sum路径总和系列总结 leetcode:

https://blog.youkuaiyun.com/qq_26410101/article/details/80471526

https://blog.youkuaiyun.com/weixin_38368941/article/details/80296641