LeetCode学习篇二十四——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]
]

通过率：30.9% 难度：medium
这道题是在上一篇的博客的题目Path Sum的基础上以二维数组的形式返回所有可能的路径，具体实现方法跟上一题是一样的，也是通过深搜即可，在这道题定义了一个二维向量用于存储当结果符合时的路径向量，代码实现如下：

/**
 * 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> > res;
    void search(TreeNode *root, int sum, vector<int> v, int t) {
        if(root == NULL ) return;
        if(root->left == NULL && root->right == NULL ){
            v.push_back(root->val);
            t += root->val;
            if(sum == t) res.push_back(v);
        }
        v.push_back(root->val);
        t += root->val;
        search(root->left, sum, v, t);
        search(root->right, sum, v, t);

    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<int> v;
        search(root, sum, v, 0);
        return res;
    }
};