第269场周赛钛铂数据T3.从数组中移除最大值和最小值

贪心,每次都采用最操作次数最小的删除策略
分情况讨论

class Solution {
    public int minimumDeletions(int[] nums) {
        if (nums.length <= 1){
            return nums.length;
        }
        int max = Integer.MIN_VALUE,min = Integer.MAX_VALUE;
        int maxIndex = -1,minIndex = -1;
        for (int i=0;i max){
                max = nums[i];
                maxIndex = i;
            }
        }
        int ope = 0;
        //先删掉其中离两端较近的一个,然后找到删除操作后的下标位置
        int maxDis = Math.min(maxIndex+1,nums.length-maxIndex);
        int minDis = Math.min(minIndex+1,nums.length-minIndex);
        int index = -1;
        ope += Math.min(maxDis,minDis);
        //先删除最大值
        if (minDis > maxDis){
            if (maxDis == maxIndex+1){
                index = maxIndex+1;
            }else {
                index = nums.length-maxDis;
            }
            if (index > minIndex){
                ope += Math.min(index-minIndex,minDis);
            }else {
                ope += Math.min(minIndex+1-index,minDis);
            }
        }else {
            if (minDis == minIndex+1){
                index = minIndex+1;
            }else {
                index = nums.length-minDis;
            }
            if (index > maxIndex){
                ope += Math.min(index-maxIndex,maxDis);
            }else {
                ope += Math.min(maxIndex+1-index,maxDis);
            }
        }
        return ope;
    }
}