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].

Intuition and Algorithm

Let’s try to find the smallest left-most chunk. If the first k elements are [0, 1, …, k-1], then it can be broken into a chunk, and we have a smaller instance of the same problem.

We can check whether k+1 elements chosen from [0, 1, …, n-1] are [0, 1, …, k] by checking whether the maximum of that choice is k.

class Solution {public int maxChunksToSorted(int[] arr) {int ans = 0, max = 0;for (int i = 0; i < arr.length; ++i) {max = Math.max(max, arr[i]);if (max == i)ans++;}return ans;}
}

769. Max Chunks To Make Sorted相关推荐

Leetcode 769. Max Chunks To Make Sorted
题目链接:https://leetcode.com/problems/max-chunks-to-make-sorted/ Level: Medium Discription: Given an a ...
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 ...
leetcode 769. Max Chunks To Make Sorted | 769. 最多能完成排序的块（Java）
题目 https://leetcode.com/problems/max-chunks-to-make-sorted/ 题解尽可能切成多份,使得上下的 set 包含相同的值. 用 diff 记录当前 ...
LeetCode github集合，附CMU大神整理笔记
Github LeetCode集合本人所有做过的题目都写在一个java项目中,同步到github中了,算是见证自己的进步.github目前同步的题目是2020-09-17日之后写的题.之前写过的题会 ...
Leetcode算法题-解法转载
版权声明:本文为博主原创文章,未经博主允许不得转载. https://blog.csdn.net/fuxuemingzhu/article/details/85112591 作者: 负雪明烛 i ...
Leetcode 部分题解
算法思想双指针排序快速选择堆排序桶排序荷兰国旗问题贪心思想二分查找分治搜索 BFS DFS Backtracking 动态规划斐波那契数列矩阵路径数组区间分割整数最长递增 ...
LeetCode All in One 题目讲解汇总(持续更新中...)
原文地址:https://www.cnblogs.com/grandyang/p/4606334.html 终于将LeetCode的大部分题刷完了,真是漫长的第一遍啊,估计很多题都忘的差不多了,这次开 ...
LeetCode 力扣算法题解汇总，All in One
作者: 负雪明烛 id: fuxuemingzhu 个人博客: https://fuxuemingzhu.cn 关键词:LeetCode,力扣,算法,题解,汇总,解析把自己刷过的所有题目做一个整理, ...
Python内置函数max()高级用法
不管是排序还是选取最大值或者最小值,都应该有个规则或者顺序,而平时我们所说的最大值或最小值实际上也是在某种排序规则或顺序下的最大值和最小值.Python内置函数max().min()和sorted() ...

769. Max Chunks To Make Sorted

769. Max Chunks To Make Sorted相关推荐

最新文章

热门文章