Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
javaCoderTeam
coding-interviews
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
coding-interviews
/
code
/
offer
/
src
/
Chap3
/
SubTree.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
57 lines (46 loc) · 1.63 KB
master
Breadcrumbs
coding-interviews
/
code
/
offer
/
src
/
Chap3
/
SubTree.java
Copy path
Top
File metadata and controls
Code
Blame
57 lines (46 loc) · 1.63 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package
Chap3
;
/**
* 输入两棵二叉树A,B,判断B是不是A的子结构。
* ps:我们约定空树不是任意一个树的子结构
*/
public
class
SubTree
{
private
class
TreeNode
{
int
val
=
0
;
TreeNode
left
=
null
;
TreeNode
right
=
null
;
public
TreeNode
(
int
val
) {
this
.
val
=
val
;
}
}
public
boolean
hasSubTree
(
TreeNode
root1
,
TreeNode
root2
) {
boolean
result
=
false
;
if
(
root1
!=
null
&&
root2
!=
null
) {
// 根结点相同,紧接着判断子树结构一样不
if
(
root1
.
val
==
root2
.
val
) {
result
=
doesTree1HaveTree2
(
root1
,
root2
);
}
// 当前根结点不同,或者即使根结点相同子树结构不同,还需继续遍历,递归判断左右子树
if
(!
result
) {
result
=
hasSubTree
(
root1
.
left
,
root2
);
}
if
(!
result
) {
result
=
hasSubTree
(
root1
.
right
,
root2
);
}
}
return
result
;
}
private
boolean
doesTree1HaveTree2
(
TreeNode
node1
,
TreeNode
node2
) {
// node2到达叶子结点的左右子结点了都还相等,说明是树1的子结构
if
(
node2
==
null
) {
return
true
;
}
// 如果node2没有到叶子结点的左右子结点,而node1先到了说明树2比树1还大,返回false
if
(
node1
==
null
) {
return
false
;
}
if
(
node1
.
val
!=
node2
.
val
) {
return
false
;
}
return
doesTree1HaveTree2
(
node1
.
left
,
node2
.
left
) &&
doesTree1HaveTree2
(
node1
.
right
,
node2
.
right
);
}
}
You can’t perform that action at this time.