Leetcode——769. Max Chunks To Make Sorted

题目原址

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

题目描述

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?

Example1 ：

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.

Example2：

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

解题思路

给定一个排序为[0,1,2,…,arr,length-1]的数组arr，切分这个数组为一定数量的块，对每个块单独进行排序。然后再将他们连接在一起，连接的结果需要等于对原始数组的排序结果。要求返回可以切分的最多块数。
如果数组本身是连续的话，则可以划分为arr.length-1个块。
即[0,1,2,3]，可以最多划分为[0],[1],[2],[3]

这个题是与下标和下标对应的元素值有关的一个题，即如果下标为i，那么arr[i] = i，则可以单独的划分为一个块。既然是与下标有关，这里的思路就是将元素值加在一起sum，同时将对应的下标加在一起sumIndex，如果sum == sumIndex，则说明每个数都在对应的下标位置，所以可以将其分为不同的块，否则就不可以分为不同的块。

AC代码

class Solution {
    public int maxChunksToSorted(int[] arr) {
        int ret = 0;
        int sum = 0, indexSum = 0;
        for(int i = 0; i < arr.length; i ++) {
            sum += arr[i];
            indexSum += i;
            if(sum == indexSum)
                ret++;
        }
        return ret;        
    }
}