#include <stdio.h>
#include <stdlib.h>

int maxDifference(int* scores, int size) {
    if (size < 2) {
        return 0;
    }
    int maxDiff = 0;
    int maxScore = scores[0];
    for (int i = 1; i < size; i++) {
        if (scores[i] > maxScore) {
            maxScore = scores[i];
        } else {
            int diff = maxScore - scores[i];
            if (diff > maxDiff) {
                maxDiff = diff;
            }
        }
    }
    return maxDiff;
}

int main() {
    int scores[] = {5, 2, 7, 3, 9, 1, 8};
    int size = sizeof(scores) / sizeof(scores[0]);
    int maxDiff = maxDifference(scores, size);
    printf("Maximum difference between adjacent scores: %d\n", maxDiff);
    return 0;
}

输出结果为:

Maximum difference between adjacent scores: 6
有时我们会关心相邻名次间成绩的差异比如冠军与亚军差多少第四名与第五名差多少等等。编写函数计算模拟的成绩数组均为非负整数但是是无序的中相邻的名次间成绩的最大差异指按从高到低排序后前一名较后一名相差的最大值。显然排序后再统计是一种方法我们对时间效率有一定的要求:你能否在On的时间和空间复杂度下完成该任务?你可以认为数据数量少于2个时差异认为是0。用C语言编上述要求程序

原文地址: https://www.cveoy.top/t/topic/jcaF 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录