<medium>LeetCode Problem -- 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.

• 分析：对于题目中所给的一个数组，要求对于这个数组进行从小到大排序，但不是直接排序，而是将这个数组分为几个部分，对着几个部分分别排序，使得结果为原数组排序的结果，要求找到最大的分段数目。
• 思路一：观察这道题的特点发现，这道题最终要求的排序结果是0～n-1数字的升序排序，利用这个条件，可以发现我们要把对应数字移到对应下标处。因此可以每次判断两个数中较大的那个值，利用这个值和下标进行对比，找到这个值对应下标时就可以分一次段，最终得到最大的分割数目。

class Solution {
public:
    int maxChunksToSorted(vector<int>& arr) {
        int res = 0;
        int max_num = 0;
        for (int i = 0; i < arr.size(); i++) {
            max_num = max(max_num, arr[i]);
            if (max_num == i) res++;
        }
        return res;
    }
};