coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
leetcode-cn/problem (English)/检查子树(English) [check-subtree-lcci].html
View File

@@ -1,25 +1,25 @@
<p>T1&nbsp;and T2 are two very large binary trees. Create an algorithm to determine if T2 is a subtree of T1.</p>
<p>A tree T2 is a subtree of T1&nbsp;if there exists a node n in T1&nbsp;such that the subtree of n is identical to T2. That is, if you cut off the tree at node n, the two trees would be identical.</p>
<p><strong>Note:</strong> This problem is slightly different from the original problem.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: t1 = [1, 2, 3], t2 = [2]
<strong> Output</strong>: true
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: t1 = [1, null, 2, 4], t2 = [3, 2]
<strong> Output</strong>: false
</pre>
<p><strong>Note: </strong></p>
<ol>
<li>The node numbers of both tree are in [0, 20000].</li>
</ol>
<p>T1&nbsp;and T2 are two very large binary trees. Create an algorithm to determine if T2 is a subtree of T1.</p>
<p>A tree T2 is a subtree of T1&nbsp;if there exists a node n in T1&nbsp;such that the subtree of n is identical to T2. That is, if you cut off the tree at node n, the two trees would be identical.</p>
<p><strong>Note:</strong> This problem is slightly different from the original problem.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: t1 = [1, 2, 3], t2 = [2]
<strong> Output</strong>: true
</pre>