769. Max Chunks To Make Sorted

最新推荐文章于 2020-06-24 09:45:01 发布

bwcxljsm

最新推荐文章于 2020-06-24 09:45:01 发布

阅读量351

点赞数

分类专栏： leetcode 算法 Leetcode 文章标签： leedcode

本文链接：https://blog.csdn.net/qq_36718317/article/details/79240585

版权

Leetcode 同时被 3 个专栏收录

89 篇文章 2 订阅

订阅专栏

leetcode

85 篇文章 0 订阅

订阅专栏

算法

83 篇文章 0 订阅

订阅专栏

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]

题意：将范围为1-n-1的乱序数组分成几部分，将每一部分排序，再拼接起来得到的数组有序。注意，排好序后不能改变每部分的顺序，这一点需要注意。

思路：因为排好序之后，第i位的数字是i，所以从第0位开始遍历，如果0-i位最大的数是i，那么这一部分就可以分成一块，后面的也可以这样推理。

代码：

class Solution {
public:
    int maxChunksToSorted(vector<int>& arr) {
        int sum=0,maxn=0;
        for(int i=0;i<arr.size();i++)
        {
            maxn=max(maxn,arr[i]);
            if(maxn==i)
                sum++;
        }
        return sum;
    }
};