coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
leetcode-cn/problem (Chinese)/二叉搜索树序列 [bst-sequences-lcci].html
View File

@@ -4,12 +4,12 @@
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入: </strong>root = [2,1,3]
<strong>输出: </strong>[[2,1,3],[2,3,1]]
解释: 数组 [2,1,3]、[2,3,1] 均可以通过从左向右遍历元素插入树中形成以下二叉搜索树
<strong>输入：</strong>root = [2,1,3]
<strong>输出：</strong>[[2,1,3],[2,3,1]]
<strong>解释：</strong>数组 [2,1,3]、[2,3,1] 均可以通过从左向右遍历元素插入树中形成以下二叉搜索树
&nbsp; 2
&nbsp; / \
&nbsp; 1 3
@@ -17,11 +17,11 @@
<p><meta charset="UTF-8" /></p>
<p><strong>示例</strong><strong>&nbsp;2:</strong></p>
<p><strong>示例&nbsp;</strong><strong>2：</strong></p>
<pre>
<strong>输入: </strong>root = [4,1,null,null,3,2]
<strong>输出: </strong>[[4,1,3,2]]
<strong>输入：</strong>root = [4,1,null,null,3,2]
<strong>输出：</strong>[[4,1,3,2]]
</pre>
<p>&nbsp;</p>
@@ -30,7 +30,7 @@
<ul>
<li>二叉搜索树中的节点数在<meta charset="UTF-8" />&nbsp;<code>[0, 1000]</code>&nbsp;的范围内</li>
<li><code>1 &lt;= 节点值&nbsp;&lt;= 10^6</code></li>
<li><code>1 &lt;= 节点值&nbsp;&lt;= 10<sup>6</sup></code></li>
<li>
<p>用例保证符合要求的数组数量不超过 <code>5000</code></p>
</li>