本文共 729 字，大约阅读时间需要 2 分钟。

题目：（中等）

标签：堆、哈希表、数组

解法一（堆）：

class Solution:    def maxDistance(self, arrays: List[List[int]]) -> int:        min_heap, max_heap = [], []        for i, array in enumerate(arrays):            heapq.heappush(min_heap, (min(array), i))            heapq.heappush(max_heap, (-max(array), i))        min1, i1 = heapq.heappop(min_heap)        max1, i2 = heapq.heappop(max_heap)        min2, i3 = heapq.heappop(min_heap)        max2, i4 = heapq.heappop(max_heap)        if i1 != i2:            return (-max1) - min1        else:            return max((-max2) - min1, (-max1) - min2)

转载地址：https://dataartist.blog.csdn.net/article/details/109836733 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！