Leetcode 113. 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.

For 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]
]
Subscribe to see which companies asked this question.

这道题是在判断有没有路径的基础上，添加了记录路径值的方法，所以需要在进行深度优先搜索的时候，记录下经过的节点的值，代码如下：

/**
 * 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) {
        if(!root)
            return vector<vector<int>>();
        vector<vector<int>> path;
        vector<int> tmp; 
        getpath(root, sum, path, tmp);
        return path;
    }

    void getpath(TreeNode* root, int sum, vector<vector<int>> &path, vector<int> tmp)
    {
        if(!root)
            return;
        tmp.push_back(root->val);

        if(!root->left && !root->right && sum == root->val)
            path.push_back(tmp);
        if(root->left)
            getpath(root->left, sum-root->val, path, tmp);
        if(root->right)
            getpath(root->right, sum-root->val, path, tmp);
    }
};