113. 路径总和 II(leetcode C++)

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

说明: 叶子节点是指没有子节点的节点。

示例:

给定如下二叉树，以及目标和 sum = 22，

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

返回:

[
   [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 find(TreeNode *node, vector<vector<int> > &result, vector<int> &path, int sum)
    {
        path.push_back(node->val);
        if (node->left == NULL && node->right == NULL && sum == node->val)
        {
            result.push_back(path);
            return;
        }
        if (node->left != NULL)
        {
            find(node->left, result, path, sum - node->val);
            path.pop_back();
        }
        
        if (node->right != NULL)
        {
            find(node->right, result, path, sum - node->val);
            path.pop_back();
        }
        
    }
    
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        
        vector<vector<int> > result;
        vector<int> path;
        if (root == NULL)
        {
            return result;
        }
        find(root, result, path, sum);
        return result;
        
    }
};