leetcode113. 路径总和 II

题目

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

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

示例:
给定如下二叉树，以及目标和 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:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int>> res;
        vector<int> temp;
        if (root == NULL) {
            return res;
        }
        temp.push_back(root->val);
        func(root, sum, res, temp, root->val);
        return res;
    }
    void func(TreeNode* root, int sum, vector<vector<int>>& res, vector<int>& temp, int x) {
        if (root->left == NULL && root->right == NULL) {
            if (x == sum) {
                res.push_back(temp);
            }
            return;
        }
        if (root->left != NULL) {
            temp.push_back(root->left->val);
            x += root->left->val;
            func(root->left, sum, res, temp, x);
            temp.pop_back();
            x -= root->left->val;
        }
        if (root->right != NULL) {
            x += root->right->val;
            temp.push_back(root->right->val);
            func(root->right, sum, res, temp, x);
            temp.pop_back();
            x -= root->right->val;
        }
    }
};