zoukankan      html  css  js  c++  java
  • 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,重复操作。

    1. class Solution {  
    2. public:  
    3.     int maxChunksToSorted(vector<int>& arr) {  
    4.         if(arr.size()==0) return 0;  
    5.         int max_partition=0;  
    6.         int count=0;  
    7.           
    8.         for(int i=0;i<arr.size();i++){  
    9.               
    10.             if(arr[i]>max_partition) max_partition=arr[i];  
    11.             if(max_partition == i) {count++;max_partition=0;}  
    12.               
    13.         }  
    14.         return count;  
    15.           
    16.     }  
    17. };  
  • 相关阅读:
    java基础---多线程---volatile详解
    java基础---多线程---线程的几种状态及其转换,wait,notify,sleep,yield,join
    java基础---设计一个死锁
    count(1) and count(*),count(字段)区别及效率比较
    mysql之字段约束-第五篇
    mysql之数据表基本操作-第四篇
    mysql之数据类型-第三篇
    mysql之存储引擎-第二篇
    mysql之数据库操作-第一篇
    Redis详解
  • 原文地址:https://www.cnblogs.com/liangyc/p/8819868.html
Copyright © 2011-2022 走看看