开发笔记:数组面试题16.16.部分排序

1 class Solution {
2 public:
3 vector<int> subSort(vector<int>& array)
4 {
5 if (array.size() == 0)
6 {
7 return {-1, -1};
8 }
9
10 int last = -1;
11 int first = -1;
12
13 int max = INT_MIN;
14 int min = INT_MAX;
15
16 int len = array.size();
17
18 for (int i = 0; i )
19 {
20 if (array[i] < max)
21 {
22 last = i;
23 }
24 else
25 {
26 max = std::max(max, array[i]);
27 }
28
29 if (array[len - 1 -i] > min)
30 {
31 first = len - 1 - i;
32 }
33 else
34 {
35 min = std::min(min, array[len - 1 - i]);
36 }
37 }
38
39 return {first, last};
40 }
41 };