LeetCode 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].

题目链接：https://leetcode.com/problems/max-chunks-to-make-sorted/description/

题目分析：维护当前区间最大最小值和当前区间的左右端点，重合时即为一个独立chunk

class Solution {
    public int maxChunksToSorted(int[] arr) {
        int Min = arr[0], Max = arr[0], l = 0, r = 0, ans = 0;
        for (int i = 0; i < arr.length; i++) {
            Min = Math.min(Min, arr[i]);
            Max = Math.max(Max, arr[i]);
            if (Min == l && Max == r) {
                ans ++;
                l = r = i + 1;
                Min = Max = (i + 1 < arr.length) ? arr[i + 1] : 0;
            } else {
                r ++;
            }
        }
        return ans;
    }
}

容易发现Min其实没什么用，因为l只在找到一个chunk时会改变，因此只维护Max即可

class Solution {
    public int maxChunksToSorted(int[] arr) {
        int Max = arr[0], ans = 0;
        for (int i = 0; i < arr.length; i++) {
            Max = Math.max(Max, arr[i]);
            if (Max == i) {
                ans ++;
            }
        }
        return ans;
    }
}