leetcode/112.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

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


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

class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
		if(root==NULL)
			return false;	//¿Õ½ÚµãÕÒ²»µ½µÄ
		if(root->left==NULL&&root->right==NULL)
			return root->val==sum;
		if(hasPathSum(root->left,sum-root->val))
			return true;
		if(hasPathSum(root->right,sum-root->val))
			return true;
		return false;

    }
};