[LeetCode]113. Path Sum II

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

---

// 递归+回溯
/**
 * 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>> result;
        if(root == NULL)
            return result;
        vector<int> trace;
        find(root, sum, trace, result);
        return result;
    }

    void find(TreeNode* root, int expectNumber, vector<int>& trace, vector<vector<int>>& result){
        // root节点是不会为空的，调用find前都保证了的
        trace.push_back(root->val);
        // 如果是叶节点，且值符合条件，则记录下这条路径
        if(root->left == NULL && root->right == NULL && root->val == expectNumber)
                result.push_back(trace);
        // 左子树找找看
        if(root->left)
            find(root->left, expectNumber - root->val, trace, result);
        // 右子树找找看
        if(root->right)
            find(root->right, expectNumber - root->val, trace, result);

        // 都遍历完了，得回溯
        trace.pop_back();
    }
};