mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
37 lines
1.3 KiB
HTML
37 lines
1.3 KiB
HTML
<p>You are given an integer array <code>arr</code> of length <code>n</code> that represents a permutation of the integers in the range <code>[0, n - 1]</code>.</p>
|
|
|
|
<p>We split <code>arr</code> into some number of <strong>chunks</strong> (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equal the sorted array.</p>
|
|
|
|
<p>Return <em>the largest number of chunks we can make to sort the array</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [4,3,2,1,0]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong>
|
|
Splitting into two or more chunks will not return the required result.
|
|
For example, splitting into [4, 3], [2, 1, 0] will result in [3, 4, 0, 1, 2], which isn't sorted.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [1,0,2,3,4]
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong>
|
|
We can split into two chunks, such as [1, 0], [2, 3, 4].
|
|
However, splitting into [1, 0], [2], [3], [4] is the highest number of chunks possible.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == arr.length</code></li>
|
|
<li><code>1 <= n <= 10</code></li>
|
|
<li><code>0 <= arr[i] < n</code></li>
|
|
<li>All the elements of <code>arr</code> are <strong>unique</strong>.</li>
|
|
</ul>
|