力扣------从数组中移除最大值和最小值

最新推荐文章于 2024-03-20 14:56:52 发布

qq_37760746

最新推荐文章于 2024-03-20 14:56:52 发布

阅读量261

点赞数

分类专栏： C/C++

本文链接：https://blog.csdn.net/qq_37760746/article/details/125422332

版权

数组处理最值查找算法优化边界条件连续子数组

关键词由CSDN通过智能技术生成

C/C++ 专栏收录该内容

114 篇文章 0 订阅

订阅专栏

在这里插入图片描述

int minimumDeletions(int* nums, int numsSize){
    if(numsSize==1){
        return 1;
    }
    int min=100000;
    int max=-100000;
    int min_index;
    int max_index;
    for(int a=0;a<numsSize;a++){
        if(nums[a]<min){
            min=nums[a];
            min_index=a;
        }
        if(nums[a]>max){
            max=nums[a];
            max_index=a;
        }
    }
    int left=min_index>max_index?min_index+1:max_index+1;
    int right=max_index<min_index?numsSize-max_index:numsSize-min_index;
    int record=left<right?left:right;
    if(max_index<numsSize-1-max_index&&min_index>numsSize-1-min_index){
        return record<max_index+1+numsSize-min_index?record:max_index+1+numsSize-min_index;
    }
    else if(max_index<numsSize-1-max_index&&min_index<numsSize-1-min_index){
        return record<(max_index>min_index?max_index+1:min_index+1)?record:max_index>min_index?max_index+1:min_index+1;
    }
    else if(max_index>numsSize-1-max_index&&min_index<numsSize-1-min_index){
        return record<min_index+1+numsSize-max_index?record:min_index+1+numsSize-max_index;
    }
    else if(max_index>numsSize-1-max_index&&min_index>numsSize-1-min_index){
        return record<numsSize-(max_index<min_index?max_index:min_index)?record:numsSize-(max_index<min_index?max_index:min_index);
    }
    else if(max_index==numsSize-1-max_index){
        return record<max_index+1?record:max_index+1;
    }
    else if(min_index==numsSize-1-min_index){
        return record<min_index+1?record:min_index+1;
    }
    return;
}