mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
35 lines
1.3 KiB
HTML
35 lines
1.3 KiB
HTML
|
<p>给出二叉树的根节点 <code>root</code>，树上每个节点都有一个不同的值。</p>
|
|||
|
|
|
|||
|
|
<p>如果节点值在 <code>to_delete</code> 中出现，我们就把该节点从树上删去，最后得到一个森林（一些不相交的树构成的集合）。</p>
|
|||
|
|
|
|||
|
|
<p>返回森林中的每棵树。你可以按任意顺序组织答案。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/07/05/screen-shot-2019-07-01-at-53836-pm.png" style="height: 150px; width: 237px;" /></strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [1,2,3,4,5,6,7], to_delete = [3,5]
|
|||
|
|
<strong>输出：</strong>[[1,2,null,4],[6],[7]]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [1,2,4,null,3], to_delete = [3]
|
|||
|
|
<strong>输出：</strong>[[1,2,4]]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>树中的节点数最大为 <code>1000</code>。</li>
|
|||
|
|
<li>每个节点都有一个介于 <code>1</code> 到 <code>1000</code> 之间的值，且各不相同。</li>
|
|||
|
|
<li><code>to_delete.length <= 1000</code></li>
|
|||
|
|
<li><code>to_delete</code> 包含一些从 <code>1</code> 到 <code>1000</code>、各不相同的值。</li>
|
|||
|
|
</ul>
|