769. Max Chunks To Make Sorted

Given an array `arr` that is a permutation of `[0, 1, ..., arr.length - 1]`, we split the array into some number of “chunks” (partitions), and individually sort each chunk.  After concatenating them, the result equals the sorted array.

What is the most number of chunks we could have made?

Example 1:

``````Input: arr = [4,3,2,1,0]
Output: 1
Explanation:
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.
``````

Example 2:

``````Input: arr = [1,0,2,3,4]
Output: 4
Explanation:
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.
``````

Note:

• `arr` will have length in range `[1, 10]`.
• `arr[i]` will be a permutation of `[0, 1, ..., arr.length - 1]`.

[2 0 1 4 3]

``````class Solution {
public:
int maxChunksToSorted(vector<int>& arr) {
int res = 0, n = arr.size();
for (int i = 0; i < n; ++i) {
int cur = arr[i], j = i + 1;
for (; j <= cur; ++j) {
cur = max(cur, arr[j]);
if (cur >= arr.back()) return res + 1;
}
i = j - 1;
++res;
}
return res;
}
};
``````

``````class Solution {
public:
int maxChunksToSorted(vector<int>& arr) {
int res = 0, n = arr.size(), mx = 0;
for (int i = 0; i < n; ++i) {
mx = max(mx, arr[i]);
if (mx == i) ++res;
}
return res;
}
};
``````

Max Chunks To Make Sorted II

Jump Game II

https://leetcode.com/problems/max-chunks-to-make-sorted/solution/

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation