mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-12 17:05:15 +08:00
27 lines
848 B
HTML
27 lines
848 B
HTML
<p>假设你有两个数组，一个长一个短，短的元素均不相同。找到长数组中包含短数组所有的元素的最短子数组，其出现顺序无关紧要。</p>
|
||
|
||
<p>返回最短子数组的左端点和右端点，如有多个满足条件的子数组，返回左端点最小的一个。若不存在，返回空数组。</p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<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>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>
|
||
big = <code>[1,2,3]
|
||
small = [4]</code>
|
||
<strong>输出：</strong>[]</pre>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>big.length <= 100000</code></li>
|
||
<li><code>1 <= small.length <= 100000</code></li>
|
||
</ul>
|