leetcode

0 class Solution {

1 public:

2 int maxDistance(vector<vector<int>> &arrays) const {

3 int mini = arrays[0].front();

4 int maxi = arrays[0].back();

5 int res = 0;

6

7 for (int i = 1; i < size(arrays); i++) {

8 res = max({res, arrays[i].back() - mini, maxi - arrays[i].front()});

9 mini = min(mini, arrays[i].front());

10 maxi = max(maxi, arrays[i].back());

11 }

12

13 return res;

14 }

15 };