class Rearrange {
public:
vector<int> findSegment(vector<int> A, int n) {
int pmax = A[0], pidx = -1;
for(int i = 0; i < n; i++){
if(A[i] >= pmax) pmax = A[i];
else pidx = i;
}
if(pidx == -1) return {0,0};
int qmin = A[n-1], qidx = -1;
for(int i = n-1; i >= 0; i--){
if(A[i] <= qmin) qmin = A[i];
else qidx = i;
}
return {qidx, pidx};
}
};
最小调整有序
最新推荐文章于 2021-07-20 19:03:25 发布