coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-12 05:40:58 +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

32
leetcode-cn/problem (English)/部分排序(English) [sub-sort-lcci].html
View File

@@ -1,16 +1,16 @@
<p>Given an array of integers, write a method to find indices m and n such that if you sorted&nbsp;elements m through n, the entire array would be sorted. Minimize <code>n - m</code> (that is, find the smallest such sequence).</p>
<p>Return <code>[m,n]</code>. If there are no such m and n (e.g. the array is already sorted), return [-1, -1].</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong> [1,2,4,7,10,11,7,12,6,7,16,18,19]
<strong>Output: </strong> [3,9]
</pre>
<p><strong>Note: </strong></p>
<ul>
<li><code>0 &lt;= len(array) &lt;= 1000000</code></li>
</ul>
<p>Given an array of integers, write a method to find indices m and n such that if you sorted&nbsp;elements m through n, the entire array would be sorted. Minimize <code>n - m</code> (that is, find the smallest such sequence).</p>
<p>Return <code>[m,n]</code>. If there are no such m and n (e.g. the array is already sorted), return [-1, -1].</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong> [1,2,4,7,10,11,7,12,6,7,16,18,19]