LeetCode/112.cpp at master · nitin-maharana/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
46
47
48
49
50
51
52
53
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

/**
 * 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 {
    int sumCopy;
    bool result;
public:
    void hasPathSumUtil(TreeNode* root, int currSum)
    {
        if(!root->left && !root->right)
        {
            if(sumCopy == currSum)
            {
                result = true;
                return;
            }
        }

        if(root->left)
            hasPathSumUtil(root->left, currSum + root->left->val);

        if(result)
            return;

        if(root->right)
            hasPathSumUtil(root->right, currSum + root->right->val);

    }

    bool hasPathSum(TreeNode* root, int sum) {
        result = false;

        if(!root)
            return false;

        sumCopy = sum;

        hasPathSumUtil(root, root->val);

        return result;
    }
};