LeetCode知识点总结 - 769

LeetCode 769. Max Chunks To Make Sorted

考点	难度
Greedy	Easy

题目

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.

思路

如果数字v1大于index i1，v1所在的chunk必须包括index v1才能在sort之后让数字v1到达index v1，记录v1为min_index
如果数字v2小于index i2，v2所在的chunk必须包括index v2，这个条件已经满足，如果min_index == v2，可以结束chunk

答案

class Solution(object):
    def maxChunksToSorted(self, arr):
        chunks = 0
        min_index_for_chunk_end = arr[0]
        for i in xrange(len(arr)):
            min_index_for_chunk_end = max(min_index_for_chunk_end, arr[i])
            if i == min_index_for_chunk_end:
                chunks += 1
        return chunks