-
Notifications
You must be signed in to change notification settings - Fork 35
Expand file tree
/
Copy pathpath-sum-ii.cpp
More file actions
43 lines (32 loc) · 1.13 KB
/
path-sum-ii.cpp
File metadata and controls
43 lines (32 loc) · 1.13 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
/**
* 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:
void f(vector<vector<int>>&ans,vector<int>vec,int targetSum,TreeNode*root){
if(root==NULL)return;
vec.push_back(root->val);
targetSum-=root->val;
if(root->left==NULL&&root->right==NULL&&targetSum==0){
ans.push_back(vec);
return ;
}
f(ans,vec,targetSum,root->left);
f(ans,vec,targetSum,root->right);
vec.pop_back();
}
vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
vector<vector<int>>ans;
vector<int>vec;
f(ans,vec,targetSum,root);return ans;
}
};
// https://leetcode.com/submissions/detail/807215142/