-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPathSumII.cpp
More file actions
57 lines (54 loc) · 1.25 KB
/
PathSumII.cpp
File metadata and controls
57 lines (54 loc) · 1.25 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
/**
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:
void dfs(vector<vector<int> >& ret, vector<int> path, TreeNode* root, int sum, int currSum){
//note that these two statements have to be before the return block check
path.push_back(root->val);
currSum += root->val;
if (currSum == sum && !root->left && !root->right) {
ret.push_back(path);
return;
}
if (root->left) {
dfs(ret, path, root->left, sum, currSum);
}
if (root->right) {
dfs(ret, path, root->right, sum, currSum);
}
path.pop_back();
currSum -= root->val;
}
vector<vector<int> > pathSum(TreeNode *root, int sum) {
vector<vector<int> > ret;
if (!root) return ret;
vector<int> path;
dfs(ret, path, root, sum, 0);
return ret;
}
};