18 lines
557 B
Python
18 lines
557 B
Python
# https://leetcode.com/problems/maximum-distance-in-arrays
|
|
from typing import List
|
|
|
|
class Solution:
|
|
def maxDistance(self, arrays: List[List[int]]) -> int:
|
|
result = 0
|
|
min_val = arrays[0][0]
|
|
max_val = arrays[0][-1]
|
|
for i in range(1, len(arrays)):
|
|
result = max(
|
|
result,
|
|
abs(min_val - arrays[i][-1]),
|
|
abs(max_val - arrays[i][0])
|
|
)
|
|
min_val = min(min_val, arrays[i][0])
|
|
max_val = max(max_val, arrays[i][-1])
|
|
return result
|
|
|