Package g0701_0800.s0768_max_chunks_to_make_sorted_ii

Class Solution

java.lang.Object

g0701_0800.s0768_max_chunks_to_make_sorted_ii.Solution

public class Solution
extends Object

768 - Max Chunks To Make Sorted II.<p>Hard</p> <p>You are given an integer array <code>arr</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><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr = [5,4,3,2,1]</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong></p> <pre><code> Splitting into two or more chunks will not return the required result. For example, splitting into [5, 4], [3, 2, 1] will result in [4, 5, 1, 2, 3], which isn't sorted. </code></pre> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> arr = [2,1,3,4,4]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong></p> <pre><code> We can split into two chunks, such as [2, 1], [3, 4, 4]. However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks possible. </code></pre> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= arr.length <= 2000</code></li> <li><code>0 <= arr[i] <= 10⁸</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxChunksToSorted(int[] arr)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maxChunksToSorted

public int maxChunksToSorted(int[] arr)