-
Notifications
You must be signed in to change notification settings - Fork 0
/
113-PathSumII.cpp
41 lines (39 loc) · 1.06 KB
/
113-PathSumII.cpp
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 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>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> res;
if(!root) return res;
vector<int> inst;
dfs(root, res, inst, sum);
return res;
}
void dfs(TreeNode* root, vector<vector<int>>& res, vector<int>& inst,
int diff){
if(!root) return;
if(!root->left && !root->right && root->val == diff){
inst.push_back(root->val);
res.push_back(inst);
inst.pop_back();
return;
}
if(root->left){
inst.push_back(root->val);
dfs(root->left, res, inst, diff - root->val);
inst.pop_back();
}
if(root->right){
inst.push_back(root->val);
dfs(root->right, res, inst, diff - root->val);
inst.pop_back();
}
}
};