-
Notifications
You must be signed in to change notification settings - Fork 3
/
1367.cpp
48 lines (48 loc) · 1.4 KB
/
1367.cpp
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
/**
* Definition for a binary tree node.
* 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 Solution {
public:
vector<TreeNode*> targets;
void find(TreeNode* node, int val) {
if (node) {
if (node->val == val) {
targets.push_back(node);
}
find(node->left, val);
find(node->right, val);
}
}
bool check(ListNode* cur, TreeNode* node) {
if (cur == nullptr) return true;
if (node == nullptr) return false;
if (node->val != cur->val) return false;
if (check(cur->next, node->left) || check(cur->next, node->right)) return true;
return false;
}
bool isSubPath(ListNode* head, TreeNode* root) {
find(root, head->val);
for (auto& target : targets) {
if (check(head, target)) return true;
}
return false;
}
};