-
Notifications
You must be signed in to change notification settings - Fork 0
/
113-path-sum-ii.cpp
33 lines (31 loc) · 949 Bytes
/
113-path-sum-ii.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
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> res;
vector <int> v;
void solve(TreeNode* root, int targetSum, int currSum) {
if(!root)
return;
v.push_back(root->val);
currSum += root->val;
if(!root->left && !root->right && targetSum==currSum)
res.push_back(v);
solve(root->left, targetSum, currSum);
solve(root->right, targetSum, currSum);
v.pop_back();
}
vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
solve(root, targetSum, 0);
return res;
}
};