查找给定数组中每个窗口大小的最小值的最大值

from collections import deque

def find_max_of_min(nums, window_size):
    if not nums or window_size <= 0 or window_size > len(nums):
        return None

    result = []
    window = deque()

    for i in range(len(nums)):
        # Remove elements outside of current window
        if window and window[0] <= i - window_size:
            window.popleft()

        # Remove elements greater than current element
        while window and nums[window[-1]] >= nums[i]:
            window.pop()

        window.append(i)

        # Start calculating minimum values when window is full
        if i >= window_size - 1:
            result.append(nums[window[0]])

    return max(result)