113. Path Sum II 路径和 ||

题目链接
tag:

• Medium；

question：
  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,

Return:
[
[5,4,11,2],
[5,8,4,5]
]

思路：
  用深度优先搜索DFS，每当DFS搜索到新节点时，都要保存该节点。而且每当找出一条路径之后，都将这个保存为一维vector的路径保存到最终结果二位vector中。并且，每当DFS搜索到子节点，发现不是路径和时，返回上一个结点时，需要把该节点从一维vector中移除。代码如下：

/**
 * 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 > pathSum(TreeNode *root, int sum) {
        vector> res;
        vector out;
        helper(root, sum, out, res);
        return res;
    }
    void helper(TreeNode* node, int sum, vector& out, vector>& res) {
        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();
    }
};

类似题目：

• 112. Path Sum 二叉树的路径和
• 437. Path Sum III 二叉树的路径和三