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

解题思路

题目要求把一段序列分成好几个子序列，然后这几个子序列内部排序之后，整个序列就会是有序的。分而治之的思想，快速排序用的就是这种方法，把序列分成左右两个序列，左边序列的值都比右边序列的值小，然后递归分别对左右两个子序列排序。这个题要求最多可以把一个给定的序列分成多少个子序列，这几个子序列内部排序后整个序列就是有序的。。

因为这个题目的特殊性，整个序列长度为n，元素取值为 0 到 n-1，并且没有重复。这样的话这个题就很好做了。从左往右找每个元素的最终位置，每找到一个，就说明可以分成一个子序列。
比如元素4的最终位置是5，即下标为5（数组下标从 0 开始）。

AC代码

class Solution {

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


}