624

624. Maximum Distance in Arrays (Medium)

You are given m arrays, where each array is sorted in ascending order.

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 a and b to be their absolute difference |a - b|.

Return the maximum distance.

 

Example 1:

Input: arrays = [[1,2,3],[4,5],[1,2,3]]
Output: 4
Explanation: One way to reach the maximum distance 4 is to pick 1 in the first or third array and pick 5 in the second array.

Example 2:

Input: arrays = [[1],[1]]
Output: 0

 

Constraints:

• m == arrays.length
• 2 <= m <= 105
• 1 <= arrays[i].length <= 500
• -104 <= arrays[i][j] <= 104
• arrays[i] is sorted in ascending order.
• There will be at most 105 integers in all the arrays.

Companies: Yahoo

Related Topics:
Array, Greedy

Solution 1. Kadane's Algorithm

// OJ: https://leetcode.com/problems/maximum-distance-in-arrays/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
    int maxDistance(vector<vector<int>>& A) {
        int mx = -1e4, mn = 1e4, ans = INT_MIN;
        for (auto &row : A) {
            ans = max({ans, row.back() - mn, mx - row[0]});
            mx = max(mx, row.back());
            mn = min(mn, row[0]);
        }
        return ans;
    }
};