coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 19:01:47 +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

55
leetcode-cn/problem (Chinese)/二叉树的右视图 [binary-tree-right-side-view].html
View File

@@ -1,35 +1,52 @@
<p>给定一个二叉树的 <strong>根节点</strong> <code>root</code>，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。</p>
<p> </p>
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>
<p><strong class="example">示例 1：</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2021/02/14/tree.jpg" style="width: 270px; " /></p>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>root = [1,2,3,null,5,null,4]</span></p>
<pre>
<strong>输入:</strong> [1,2,3,null,5,null,4]
<strong>输出:</strong> [1,3,4]
</pre>
<p><strong>输出：</strong><span class="example-io">[1,3,4]</span></p>
<p><strong>示例 2:</strong></p>
<p><strong>解释：</strong></p>
<pre>
<strong>输入:</strong> [1,null,3]
<strong>输出:</strong> [1,3]
</pre>
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" /></p>
</div>
<p><strong>示例 3:</strong></p>
<p><strong class="example">示例 2：</strong></p>
<pre>
<strong>输入:</strong> []
<strong>输出:</strong> []
</pre>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>root = [1,2,3,4,null,null,null,5]</span></p>
<p> </p>
<p><span class="example-io"><b>输出：</b>[1,3,4,5]</span></p>
<p><strong>解释：</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" /></p>
</div>
<p><strong class="example">示例 3：</strong></p>
<div class="example-block">
<p><strong>输入：</strong><span class="example-io">root = [1,null,3]</span></p>
<p><strong>输出：</strong><span class="example-io">[1,3]</span></p>
</div>
<p><strong class="example">示例 4：</strong></p>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>root = []</span></p>
<p><strong>输出：</strong><span class="example-io">[]</span></p>
<p>&nbsp;</p>
</div>
<p><strong>提示:</strong></p>
<ul>
<li>二叉树的节点个数的范围是 <code>[0,100]</code></li>
<li><meta charset="UTF-8" /><code>-100 <= Node.val <= 100</code> </li>
<li><meta charset="UTF-8" /><code>-100&nbsp;&lt;= Node.val &lt;= 100</code>&nbsp;</li>
</ul>