algorithm notes: leetcode#624 maximum distance in arrays

class :
    def maxDistance(self, arrays):
        """
        :type arrays: List[List[int]]
        :rtype: int
        """
        ans, curMin, curMax = 0, arrays[0][0], arrays[0][-1]
        for array in arrays[1:]:
            ans = max(abs(array[-1]-curMin), abs(curMax-array[0]), ans)
            curMin = min(curMin, array[0])
            curMax = max(curMax, array[-1])
        return ans