leetcode/112.path-sum.cpp at master · 9sheng/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
#include "testharness.h"
#include <map>
#include <string>
#include <string.h>
#include <vector>
#include <stack>

using namespace std;

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

class Solution {
    struct PathStatus {
        TreeNode* node;
        int sum;
    };

public:
    bool hasPathSum(TreeNode *root, int sum) {
        if (root == NULL) return false;

        stack<PathStatus> s;
        s.push({root, root->val});

        while (!s.empty()) {
            auto ps = s.top();
            s.pop();

            if (ps.node->left == NULL && ps.node->right == NULL && ps.sum == sum)
                return true;

            if (ps.node->left != NULL)
                s.push({ps.node->left, ps.sum + ps.node->left->val});

            if (ps.node->right != NULL)
                s.push({ps.node->right, ps.sum + ps.node->right->val});


        }

        return false;
    }
};

TEST(Solution, test) {
    ASSERT_EQ(2, 1+1);
}