768. Max Chunks To Make Sorted II

768. Max Chunks To Make Sorted II

This question is the same as “Max Chunks to Make Sorted” except the integers of the given array are not necessarily distinct, the input array could be up to length 2000, and the elements could be up to 10**8.

Given an array arr of integers (not necessarily distinct), 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 = [5,4,3,2,1]Output: 1Explanation:Splitting into two or more chunks will not return the required result.For example, splitting into [5, 4], [3, 2, 1] will result in [4, 5, 1, 2, 3], which isn't sorted.

Example 2:

Input: arr = [2,1,3,4,4]Output: 4Explanation:We can split into two chunks, such as [2, 1], [3, 4, 4].However, splitting into [2, 1], [3], [4], [4] is the highest number of

Note:

arr will have length in range [1, 2000]. arr[i] will be an integer in range [0, 10**8].

class Solution public int maxChunksToSorted(int[] arr) { Map count = new HashMap(); int ans = 0, nonzero = 0; int[] expect = arr.clone(); Arrays.sort(expect); for (int i = 0; i < arr.length; ++i) { int x = arr[i], y = expect[i]; count.put(x, count.getOrDefault(x, 0) + 1); if (count.get(x) == 0) nonzero--; if (count.get(x) == 1) nonzero++; count.put(y, count.getOrDefault(y, 0) - 1); if (count.get(y) == -1) nonzero++; if (count.get(y) == 0) nonzero--; if (nonzero == 0) ans++; } return

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