113. Path Sum II 解题记录-CSDN博客

题目描述：

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

解题思路：

利用递归遍历搜索，把节点的数存在数组中，路径上的数都加在一起，每一次分支都创建一个新数组，到最后一个节点的时候进行判断，路径数的和若和sum相同就把数组加在二维数组。

代码：

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     void select(vector<vector<int>> &ret, int sum, TreeNode* root, vector<int> path, int now){
13         if(!root->left && !root->right){
14         //到最后一个节点
15             if(sum == now+root->val){
16             //路径上的数与sum相同
17                 path.push_back(root->val);
18                 ret.push_back(path);
19             }
20         }
21         else{
22         //不是最后一个节点
23             path.push_back(root->val);
24             if(root->left)
25                 select(ret, sum, root->left, path, now+root->val);
26             if(root->right)
27                 select(ret, sum, root->right, path, now+root->val);
28         }
29     }
30     vector<vector<int>> pathSum(TreeNode* root, int sum) {
31         vector<vector<int>> ret;
32         if(!root)
33             return ret;
34         select(ret, sum, root, vector<int>(), 0);
35         return ret;
36     }
37 };