LeetCode113路径总和2递归 二叉树

问题描述

代码

/**
 * 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 <vector <int> > res;
        vector <int> t;
        if(root==NULL) return res;
        if(root->left==NULL&&root->right==NULL) {
            if(root->val==sum) {
                t.push_back(sum);
                res.push_back(t);
            }
            return res;
        }
        vector <vector <int> > left=pathSum(root->left,sum-root->val);
        for(int i=0;i<(int)left.size();i++) {
            left[i].insert(left[i].begin(),root->val);
            res.push_back(left[i]);
        }//把根节点的val放入数组
        vector <vector <int> > right=pathSum(root->right,sum-root->val);
        for(int i=0;i<(int)right.size();i++) {
            right[i].insert(right[i].begin(),root->val);
            res.push_back(right[i]);
        }
        return res;
    }
};