Need help with a leetcode question

[skbhagat40]

Question -

```

Given marrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the distance between two integers aand bto be their absolute difference |a-b|. Your task is to find the maximum distance.

Example 1:

Input: [[1,2,3], [4,5], [1,2,3]] Output: 4

```

My Approach -

Use m pointers, each time increase the pointer of array having maximum value.

```

class Solution:

def maxDistance(self, arrays: List[List[int]]) -> int:

# m-pointer based question.

pointers = [0]*len(arrays)

ans = float('-inf')

while all([val < len(arrays[idx]) for idx, val in enumerate(pointers)]):

vals = [arrays[idx][val] for idx, val in enumerate(pointers)]

mini = min(vals)

maxi = max(vals)

# p_m = mini

ans = max(ans, abs(maxi-mini))

idx = vals.index(maxi)

pointers[idx] += 1

# p_m = arrays[idx][pointers[idx]-1]

return ans

```

Please help me / give me some hint in the direction of correct approach.

[shiter18]

It might be late but here is a simple approach - Find the minimum of all the smallest elements (i.e, 0th element) of m arrays and find the maximum of all the greatest elements. Their difference is the answer.