coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-13 01:15:14 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
leetcode-cn/problem (Chinese)/最短超串 [shortest-supersequence-lcci].html
View File

@@ -2,19 +2,21 @@
<p>返回最短子数组的左端点和右端点，如有多个满足条件的子数组，返回左端点最小的一个。若不存在，返回空数组。</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入:</strong>
<pre>
<strong>输入：</strong>
big = <code>[7,5,9,0,2,1,3,<strong>5,7,9,1</strong>,1,5,8,8,9,7]
small = [1,5,9]</code>
<strong>输出: </strong>[7,10]</pre>
<strong>输出：</strong>[7,10]</pre>
<p><strong>示例 2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre><strong>输入:</strong>
<pre>
<strong>输入：</strong>
big = <code>[1,2,3]
small = [4]</code>
<strong>输出: </strong>[]</pre>
<strong>输出：</strong>[]</pre>
<p><strong>提示：</strong></p>