forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpathSum.II.cpp
More file actions
72 lines (64 loc) · 1.7 KB
/
pathSum.II.cpp
File metadata and controls
72 lines (64 loc) · 1.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// Source : https://oj.leetcode.com/problems/path-sum-ii/
// Author : Hao Chen
// Date : 2014-07-01
/**********************************************************************************
*
* 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 binary tree
* 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;
vector<int> v;
generatePathSum(root, sum, v, result);
return result;
}
void generatePathSum(TreeNode *root, int sum, vector<int> v, vector<vector<int> >& result) {
if (root==NULL) {
return;
}
if (root->left==NULL && root->right==NULL) {
if (root->val == sum){
v.push_back(root->val);
result.push_back(v);
}
return;
}
v.push_back(root->val);
if (root->left) {
generatePathSum(root->left, sum - root->val, v, result);
}
if (root->right) {
generatePathSum(root->right, sum - root->val, v, result);
}
}
};