forked from liuyubobobo/Play-Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
main2.cpp
55 lines (39 loc) · 1 KB
/
main2.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
49
50
51
52
53
54
55
/// Source : https://leetcode.com/problems/subtree-of-another-tree/description/
/// Author : liuyubobobo
/// Time : 2018-10-16
#include <iostream>
using namespace std;
/// Recursion
/// Time Complexity: O(m * n)
/// Space Complexity: O(logm)
/// 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 isSubtree(TreeNode* s, TreeNode* t) {
if(!s && !t)
return true;
if(equal(s, t))
return true;
if(s && isSubtree(s->left, t))
return true;
if(s && isSubtree(s->right, t))
return true;
return false;
}
private:
bool equal(TreeNode* a, TreeNode* b){
if(!a && !b) return true;
if(!a || !b) return false;
if(a->val != b->val) return false;
return equal(a->left, b->left) && equal(a->right, b->right);
}
};
int main() {
return 0;
}