zoukankan      html  css  js  c++  java
  • LeetCode

    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: 1
    Explanation:
    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: 4
    Explanation:
    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 chunks possible.

    class Solution {
        public int maxChunksToSorted(int[] arr) {
            if (arr == null)
                return 0;
            int[] arr2 = new int[arr.length];
            for (int i=0; i<arr.length; i++) {
                arr2[i] = arr[i];
            }
            Arrays.sort(arr2);
            int sum1 = 0, sum2 = 0, ret = 0;
            for (int i=0; i<arr.length; i++) {
                sum1 += arr[i];
                sum2 += arr2[i];
                if (sum1 == sum2)
                    ret ++;
            }
            return ret;
        }
    }
  • 相关阅读:
    使用java实现面向对象 第一章
    深入.NET平台和C#编程笔记 第九章 文件操作
    MySQL_第七章
    MySQL_第八章
    MySQL_第五章
    MySQL_第四章
    MySQL_第三章
    MySQL_第二章
    MySQL_第一章
    S2_OOP第二章
  • 原文地址:https://www.cnblogs.com/wxisme/p/9504195.html
Copyright © 2011-2022 走看看