Google
769 Max Chunks To Make Sorted

1. Question

Given an arrayarrthat 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:
1
Input:
2
arr = [4,3,2,1,0]
3
4
Output:
5
1
6
7
Explanation:
8
9
Splitting into two or more chunks will not return the required result.
10
For example, splitting into [4, 3], [2, 1, 0] will result in [3, 4, 0, 1, 2], which isn't sorted.
Copied!
Example 2:
1
Input:
2
arr = [1,0,2,3,4]
3
4
Output:
5
4
6
7
Explanation:
8
9
We can split into two chunks, such as [1, 0], [2, 3, 4].
10
However, splitting into [1, 0], [2], [3], [4] is the highest number of chunks possible.
Copied!
Note:
  • arrwill have length in range[1, 10].
  • arr[i]will be a permutation of[0, 1, ..., arr.length - 1].

2. Implementation

思路: 根据题意,每个数和数组的index是一一对应,要想得到最多的chunk使得整个数组sorted, 我们只要从左到右扫一遍数组,得到当前最大的数,如果当前最大的数和当前的index相等,说明这个时候我们需要加一个chunk
1
class Solution {
2
public int maxChunksToSorted(int[] arr) {
3
int curMax = Integer.MIN_VALUE;
4
int chunks = 0;
5
6
for (int i = 0; i < arr.length; i++) {
7
curMax = Math.max(curMax, arr[i]);
8
if (curMax == i) {
9
++chunks;
10
}
11
}
12
return chunks;
13
}
14
}
Copied!

3. Time & Space Complexity

时间复杂度O(n), 空间复杂度O(1)