add leetcode problem-cn part2

算法题（国内版）/problem (English)/部分排序(English) [sub-sort-lcci].html

@@ -0,0 +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>