lc113.路径总和II【***递归，DFS】-＞lc78

 

/**
 * 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>> re;
    vector<int> path;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        if(!root) return re;
        dfs(root, sum);
        return re;
    }
    void dfs(TreeNode* node, int sum){
        if(!node->left&&!node->right){  //叶子结点，计算pathsum（很朴实）
            path.push_back(node->val);
            int i,pathsum=0;
            for(i=0;i<path.size();++i