lc-2091

登录后复制

public int minimumDeletions(int[] nums) {
    int min  =0;
    int max = 0;
    int n = nums.length;
    for (int i = 0; i < n; i++) {
        if (nums[i] < nums[min] ) {
            min = i;
        }
        if (nums[i] > nums[max]) {
            max = i;
        }
    }
    int side = Math.min(min, max) + 1 + n - Math.max(min,max);
    int left = Math.max(min,max) + 1;
    int right = n - Math.min(min, max);
    return Math.min(side, Math.min(left, right));
}

• 1.
• 2.
• 3.
• 4.
• 5.
• 6.
• 7.
• 8.
• 9.
• 10.
• 11.
• 12.
• 13.
• 14.
• 15.
• 16.
• 17.

原创作者: u_14066730 转载于: https://blog.51cto.com/u_14066730/11480261