void add(int M, int mValue[])
{
for (int i = 0; i < M; i++) {
value[n] = findMax[n] = findMin[n] = mValue[i];
for (int j = n-1; j >= 0; j--) {
if (findMax[j] >= findMax[j+1]) {
break;
}
findMax[j] = findMax[j+1];
}
for (int j = n-1; j >= 0; j--) {
if (findMin[j] <= findMin[j+1]) {
break;
}
findMin[j] = findMin[j+1];
}
n++;
}
}
看不懂的东西
于 2024-02-05 14:41:26 首次发布