LeetCode 113. Path Sum II

LeetCode 113. Path Sum II

Solution1：我的答案
依旧是递归，不明白咋这么慢呢

/**
 * 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> temp;
        my_pathSum(root, sum, res, temp);
        return res;
    }
     void my_pathSum(TreeNode* root, int sum, vector<vector<int>> &res, vector<int> temp) {//temp进行值传递
         if (!root)
             return;
         else if (!root->left && !root->right) {
             if (sum == root->val) {
                 temp.push_back(sum);
                 res.push_back(temp);
                 return;
             }
             else 
                 return;
         }
         else {
             temp.push_back(root->val);
             my_pathSum(root->left, sum - root->val, res, temp);
             my_pathSum(root->right, sum - root->val, res, temp);
         }
     }
};

Solution2：
上段代码中的temp进行引用传递

class Solution {
public:
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        vector<vector<int>> res;
        vector<int> out;
        helper(root, sum, out, res);
        return res;
    }
    void helper(TreeNode* node, int sum, vector<int>& out, vector<vector<int>>& res) {//out进行引用传递
        if (!node) return;
        out.push_back(node->val);
        if (sum == node->val && !node->left && !node->right) {
            res.push_back(out);
        }
        helper(node->left, sum - node->val, out, res);
        helper(node->right, sum - node->val, out, res);
        out.pop_back();//out进行引用传递，则需要这一步
    }
};