Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit89b07fa

Browse files
authored
Merge pull requestneetcode-gh#1095 from ChrisKheng/scala
Add Scala solution for 572: Subtree of Another Tree
2 parents514e3c6 +1b81473 commit89b07fa

File tree

2 files changed

+34
-1
lines changed

2 files changed

+34
-1
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -74,7 +74,7 @@ If you would like to have collaborator permissions on the repo to merge your own
7474
<sub>[543 - Diameter of a Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)</sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
7575
<sub>[110 - Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)</sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
7676
<sub>[100 - Same Tree](https://leetcode.com/problems/same-tree/)</sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
77-
<sub>[572 - Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)</sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
77+
<sub>[572 - Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)</sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
7878
<sub>[235 - Lowest Common Ancestor of a BST](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)</sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
7979
<sub>[102 - Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
8080
<sub>[199 - Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)</sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>✔️</div></sub> | <sub><divalign='center'>✔️</div></sub>
Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {
4+
* var value: Int = _value
5+
* var left: TreeNode = _left
6+
* var right: TreeNode = _right
7+
* }
8+
*/
9+
objectSolution {
10+
defisSubtree(root:TreeNode,subRoot:TreeNode):Boolean= {
11+
if (root==null&& subRoot==null) {
12+
returntrue
13+
}elseif (root!=null&& subRoot==null) {
14+
returntrue
15+
}elseif (root==null&& subRoot!=null) {
16+
returnfalse
17+
}else {
18+
return isSameTree(root, subRoot)|| (isSubtree(root.left, subRoot)|| isSubtree(root.right, subRoot))
19+
}
20+
}
21+
22+
defisSameTree(p:TreeNode,q:TreeNode):Boolean= {
23+
if (p==null&& q==null) {
24+
returntrue
25+
}elseif (p==null|| q==null) {
26+
returnfalse
27+
}elseif (p.value!= q.value) {
28+
returnfalse
29+
}else {
30+
return isSameTree(p.left, q.left)&& isSameTree(p.right, q.right)
31+
}
32+
}
33+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp