LeetCode-769. Max Chunks To Make Sorted

LeetCode-769. Max Chunks To Make Sorted

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: 1Explanation: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: 4Explanation: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到i的最大值和i+1到n-1的最小值。

class Solution {public: int maxChunksToSorted(vector& arr) { int n = arr.size(); if (n == 0 || n == 1) { return n; } int maxi = arr[0], mini; int ans = 1; for (int i = 0; i < n - 1; i++) { maxi = max(maxi, arr[i]); mini = arr[i + 1]; for (int j = i + 1; j < n; j++) { mini = min(mini, arr[j]); } if (maxi <= mini) { ans++; } } return ans; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。