LeetCode-769. Max Chunks To Make Sorted

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zy2317878/article/details/79978756

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?

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

1.arr will have length in range [1, 10].
2.arr[i] will be a permutation of [0, 1, ..., arr.length - 1].

Solution 1(C++)

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

算法分析

就这一个答案,记住吧···好好体会吧。还是没能深入问题看本质。

程序分析

略。

阅读更多
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页