769. Max Chunks To Make Sorted

最新推荐文章于 2022-08-06 19:39:33 发布

Sterben_Da

最新推荐文章于 2022-08-06 19:39:33 发布

阅读量153

点赞数

分类专栏： leetcode-python 文章标签： leetcode python 算法

本文链接：https://blog.csdn.net/Sterben_Da/article/details/125301100

版权

leetcode-python 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

769. Max Chunks To Make Sorted

Medium

1935186Add to ListShare

You are given an integer array arr of length n that represents a permutation of the integers in the range [0, n - 1].

We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After concatenating them, the result should equal the sorted array.

Return the largest number of chunks we can make to sort the array.

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.

Constraints:

n == arr.length
1 <= n <= 10
0 <= arr[i] < n
All the elements of arr are unique.

参考别人的题解：

class Solution:
    def maxChunksToSorted(self, arr: List[int]) -> int:
        """
        assert Solution().maxChunksToSorted([1, 4, 0, 2, 3, 5]) == 2
        assert Solution().maxChunksToSorted([0, 2, 1]) == 2
        assert Solution().maxChunksToSorted([1, 2, 0, 3]) == 2
        assert Solution().maxChunksToSorted([0, 1, 2]) == 3
        assert Solution().maxChunksToSorted([0, 1]) == 2
        assert Solution().maxChunksToSorted([4, 3, 2, 1, 0]) == 1
        assert Solution().maxChunksToSorted([1, 0, 2, 3, 4]) == 4
        assert Solution().maxChunksToSorted([0]) == 1

        不会！
        参考别人的解题思路：从左往右遍历，同时记录当前的最大值，每当当前最大值等于数组位置时，我们可以多一次分割。
        因为出现这种情况的时候，右边没有比左边小的数，不需要重新排序。
        时间复杂度：O(n) 空间复杂度：O(1)
        """
        cnt, maxNum = 0, 0
        for i in range(len(arr)):
            maxNum = max(maxNum, arr[i])
            if maxNum == i:
                cnt += 1
        return cnt