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:1Explanation: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:4Explanation: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]`

.

```
struct Solution;
impl Solution {
fn max_chunks_to_sorted(arr: Vec<i32>) -> i32 {
let mut max = 0;
let n = arr.len();
let mut res = 0;
for i in 0..n {
max = max.max(arr[i]);
if max == i as i32 {
res += 1;
}
}
res
}
}
#[test]
fn test() {
let arr = vec![4, 3, 2, 1, 0];
let res = 1;
assert_eq!(Solution::max_chunks_to_sorted(arr), res);
let arr = vec![1, 0, 2, 3, 4];
let res = 4;
assert_eq!(Solution::max_chunks_to_sorted(arr), res);
}
```