Path Sum II

题目：

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22

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

Return:

[
   [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:
    void pathSumHelp(TreeNode* root, int sum, vector<vector<int> > &res, vector<int> &temp)
    {
        if(root == nullptr)
            return;
        temp.push_back(root->val);
        if(root->left == nullptr && root->right == nullptr && sum == root->val)
        {          
            res.push_back(temp);
        }
        else
        {
            if(root->left != nullptr)
                pathSumHelp(root->left, sum-root->val, res, temp);
            if(root->right != nullptr)
                pathSumHelp(root->right, sum-root->val, res, temp);
        }
        temp.pop_back();          
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int> > res;
        if(root == nullptr)
            return res;
        vector<int> temp;
        pathSumHelp(root, sum, res, temp);
        return res;
    }
};

下面解答不正确：

class Solution {
public:
    void pathSumHelp(TreeNode* root, int sum, vector<vector<int> > &res, vector<int> &temp)
    {
        if(root == nullptr)
            return;
        temp.push_back(root->val);
        if(root->left == nullptr && root->right == nullptr && sum == root->val)
        {          
            res.push_back(temp);
                                //如果加上temp.pop_back()，此代码正确
            return;
        }
        if(root->left != nullptr)
            pathSumHelp(root->left, sum-root->val, res, temp);
        if(root->right != nullptr)
            pathSumHelp(root->right, sum-root->val, res, temp);
        temp.pop_back();          
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int> > res;
        if(root == nullptr)
            return res;
        vector<int> temp;
        pathSumHelp(root, sum, res, temp);
        return res;
    }
};

因为当找到最后一个节点正好满足第二个if语句时，temp已经加入root->val了，而没有运行到temp.pop_back()就返回了，这时最后一个root->val从temp中没有退出，一直会留在里面，所以不对。