769. Max Chunks To Make Sorted
Posted 一日一更
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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: 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,重复操作。
- class Solution {
- public:
- int maxChunksToSorted(vector<int>& arr) {
- if(arr.size()==0) return 0;
- int max_partition=0;
- int count=0;
- for(int i=0;i<arr.size();i++){
- if(arr[i]>max_partition) max_partition=arr[i];
- if(max_partition == i) {count++;max_partition=0;}
- }
- return count;
- }
- };
以上是关于769. Max Chunks To Make Sorted的主要内容,如果未能解决你的问题,请参考以下文章
769. Max Chunks To Make Sorted
Max Chunks To Make Sorted LT769
769. Max Chunks To Make Sorted