[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]
]

思路：

在Leetcode 112的基础上稍作扩展即可：由于需要返回所有符合条件的结果，所以我们自然而然可以想到回溯。思路也很直观，请见下面的代码片段。

代码：

/**
 * 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>> ret;
        vector<int> line;
        pathSum(root, sum, ret, line);
        return ret;
    }
private:
    void pathSum(TreeNode* root, int sum, vector<vector<int>> &ret, vector<int> &line) {
        if (root == NULL) {
            return;
        }
        if (!root->left && !root->right) {
            if (root->val == sum) {
                line.push_back(root->val);
                ret.push_back(line);
                line.pop_back();
            }
            return;
        }
        int new_sum = sum - root->val;
        line.push_back(root->val);
        if (root->left) {
            pathSum(root->left, new_sum, ret, line);
        }
        if (root->right) {
            pathSum(root->right, new_sum, ret, line);
        }
        line.pop_back();
    }
};