leetcode/112. Path Sum.cpp at master · yunfengzhou-hub/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
/**
 * 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:
    bool mySum(TreeNode* root, int sum){
        if(root==NULL){
            return sum==0;
        }
        return mySum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val);
    }
    bool hasPathSum(TreeNode* root, int sum) {
        if(root==NULL){
            return false;
        }
        if(root->left!=NULL&root->right!=NULL){
            return hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val);
        }else if(root->left!=NULL&root->right==NULL){
            return hasPathSum(root->left,sum-root->val);
        }else if(root->left==NULL&root->right!=NULL){
            return hasPathSum(root->right,sum-root->val);
        }else{
            return sum==root->val;
        }

    }
};