2091. Removing Minimum and Maximum From Array - LeetCode Solution

class Solution:
    def minimumDeletions(self, nums: List[int]) -> int:
        max_index = 0
        min_index = 0
        max_element = -float("inf")
        min_element = float("inf")

        
        for i in range(len(nums)):
            if nums[i] > max_element:
                max_index = i
                max_element = nums[i]
            if nums[i] < min_element:
                min_index = i
                min_element = nums[i]
  
        ans1 = max(min_index, max_index) + 1
        ans2 = len(nums) - min(min_index, max_index)
        ans3 = min(min_index, max_index)+1 + (len(nums) - max(min_index, max_index))

        return min(ans1, ans2, ans3)