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

 将一个数组分成尽可能多的子数组，使得这些子数组分别排序后在首尾相连，与原始数组直接排序的结果相同。

分析可知，要保证上述特性，那么前一个子数组的最大值需要小于后一个子数组的最小值；

根据这个思路，可以创建一个数组，从后往前，记录原始数组的最小值，然后从前往后，当当前子数组的最大值小于下一位置所记录的最小值，则可以分成一个子数组，否则，不能划分出来。

代码如下：

class Solution {
    public int maxChunksToSorted(int[] arr) {
        int len = arr.length;
        if(len == 0)
        	return 0;
    	int record[] = new int[len];
    	record[len - 1] = arr[len - 1];
    	for(int i = len - 2; i > -1; i--){
    		record[i] = Math.min(record[i + 1], arr[i]);
    	}
    	int max = arr[0];
    	int res = 1;
    	for(int i = 1; i < len; i++){
    		if(max < record[i]){
    			res++;
    			max = arr[i];
    		}
    		else{
    			max = Math.max(max, arr[i]);
    		}
    	}
    	return res;
    }
}