LeetCode/112.cpp at main · rkibel/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
#include <vector>
using namespace std;

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 Problem112 {
    private:
        vector<int>sums;
    public:
        bool hasPathSum(TreeNode* root, int targetSum) {
            setSums(root, 0);
            return find(sums.begin(), sums.end(), targetSum) != sums.end();
        }

        void setSums(TreeNode* node, int sum){
            if (!node)
                return;
            int v = node->val;
            if (!node->left && !node->right)
                sums.push_back(sum + v);
            if (node->left)
                setSums(node->left, sum + v);
            if (node->right)
                setSums(node->right, sum + v);
        }
};