leetcode/113.cpp at master · shuest/leetcode · GitHub

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

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cctype>
using namespace std;

 struct TreeNode {
      int val;
    TreeNode *left;
     TreeNode *right;
     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 };

class Solution {
public:
	 vector<vector<int>> res;
	vector<int> path;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
       dfs(root,sum);
	   return res;
    }
	void dfs(TreeNode *root,int sum)
	{
		if(root==NULL) return ;
		if(root->val==sum&&root->left==NULL&&root->right==NULL)
		{
			path.push_back(root->val);
			res.push_back(path);
			path.pop_back();
			return ;
		}
		path.push_back(root->val);
		dfs(root->left,sum-root->val);
		dfs(root->right,sum-root->val);
		path.pop_back();
	}
};