LeetCode in Kotlin
768. Max Chunks To Make Sorted II
Hard
You are given an integer array arr.
We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equal the sorted array.
Return the largest number of chunks we can make to sort the array.
Example 1:
Input: arr = [5,4,3,2,1]
Output: 1
Explanation: 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.
Example 2:
Input: arr = [2,1,3,4,4]
Output: 4
Explanation: 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.
Constraints:
1 <= arr.length <= 20000 <= arr[i] <= 108
Solution
class Solution {
fun maxChunksToSorted(arr: IntArray): Int {
val n = arr.size
val lmax = IntArray(n)
val rMin = IntArray(n + 1)
lmax[0] = arr[0]
for (i in 1 until n) {
lmax[i] = lmax[i - 1].coerceAtLeast(arr[i])
}
rMin[n] = Int.MAX_VALUE
for (i in n - 1 downTo 0) {
rMin[i] = rMin[i + 1].coerceAtMost(arr[i])
}
var chunks = 0
for (i in 0 until n) {
if (lmax[i] <= rMin[i + 1]) {
chunks++
}
}
return chunks
}
}