#leetcode簽到
Day 5
624. Maximum Distance in Arrays

給多個升序排序好的陣列
找不同陣列間最大的距離 距離定義為 |a-b|

一開始搞了一個n^2解 TLE
後面就偷看discussion

class Solution:
    def maxDistance(self, arrays: List[List[int]]) -> int:
        f_min, f_max = arrays[0][0], arrays[0][-1]
        diff = 0
        for i in range(1, len(arrays)):
            diff = max(max(f_max - arrays[i][0], arrays[i][-1] - f_min), diff)

            f_min = min(f_min, arrays[i][0])
            f_max = max(f_max, arrays[i][-1])

        return diff