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
56
57
| // @Title: 另一棵树的子树 (Subtree of Another Tree)
// @Author: 15816537946@163.com
// @Date: 2019-11-24 19:59:53
// @Runtime: 20 ms
// @Memory: 6.1 MB
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
/*
func isSubtree(s *TreeNode, t *TreeNode) bool {
if s == nil {
return false
}
return isSame(s,t)|| isSubtree(s.Left, t) || isSubtree(s.Right,t)
}
func isSame(s *TreeNode, t *TreeNode) bool {
if s == nil {
return t== nil
}
if t == nil {
return false
}
if t.Val != s.Val {
return false
}
return isSame(s.Left,t.Left) && isSame(s.Right,t.Right)
}
*/
func isSubtree(s *TreeNode, t *TreeNode) bool {
if s == nil {
return false
}
return isSame(s, t) || isSubtree(s.Left, t) || isSubtree(s.Right, t)
}
func isSame(s *TreeNode, t *TreeNode) bool {
if s == nil {
return t == nil
}
if t == nil {
return false
}
if s.Val != t.Val {
return false
}
return isSame(s.Left, t.Left) && isSame(s.Right, t.Right)
}
|