Path Sum II

题目大意：跟这题一样Path Sum， 只不过要求保存路径

/**
 * Definition for binary tree
 * 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> > result;
        vector<int> path;
        pathSumAssist(root, sum, result, path);
        return result;
    }
private:
    void pathSumAssist(TreeNode *root, int sum, vector<vector<int> > &result, vector<int> &path) {
        if(root == NULL) {
            return;
        }
        path.push_back(root->val);
        if(root->val == sum && root->left == NULL && root->right == NULL) {
            result.push_back(path);
        }
        pathSumAssist(root->left, sum - root->val, result, path);
        pathSumAssist(root->right, sum - root->val, result, path);
        path.pop_back();
    }
};