coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,26 +1,26 @@
<p>You are given two arrays, one shorter (with all distinct elements) and one longer. Find the shortest subarray in the longer array that contains all the elements in the shorter array. The items can appear in any order.</p>
<p>Return the indexes of the leftmost and the rightmost elements of the array. If there are more than one answer, return the one that has the smallest left index. If there is no answer, return an empty array.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</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>Output: </strong>[7,10]</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong>
big = <code>[1,2,3]
small = [4]</code>
<strong>Output: </strong>[]</pre>
<p><strong>Note: </strong></p>
<ul>
<li><code>big.length&nbsp;&lt;= 100000</code></li>
<li><code>1 &lt;= small.length&nbsp;&lt;= 100000</code></li>
</ul>
<p>You are given two arrays, one shorter (with all distinct elements) and one longer. Find the shortest subarray in the longer array that contains all the elements in the shorter array. The items can appear in any order.</p>
<p>Return the indexes of the leftmost and the rightmost elements of the array. If there are more than one answer, return the one that has the smallest left index. If there is no answer, return an empty array.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</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>Output: </strong>[7,10]</pre>
<p><strong>Example 2:</strong></p>