forked from hongtaocai/code_interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPathSumII.cpp
More file actions
41 lines (40 loc) · 1.12 KB
/
PathSumII.cpp
File metadata and controls
41 lines (40 loc) · 1.12 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
/**
* 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> > solutions;
vector<int> s;
helper(root, sum, solutions, s);
return solutions;
}
void helper(TreeNode *root, int sum, vector<vector<int> >& solutions, vector<int>& s) {
if(root==NULL) {
return;
}
s.push_back(root->val);
if(root->left == NULL && root->right== NULL) {
if(sum==root->val) {
solutions.push_back(s);
}
}
else if(root->left == NULL) {
helper(root->right, sum-root->val, solutions, s);
}
else if(root->right == NULL) {
helper(root->left, sum-root->val, solutions, s);
}
else {
helper(root->left, sum-root->val, solutions, s);
helper(root->right, sum-root->val, solutions, s);
}
s.pop_back();
}
};