leetcode624. Maximum Distance in Arrays

624. Maximum Distance in Arrays

Given m arrays, 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 a and b to 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: 4Explanation: 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.

Note:
Each given array will have at least 1 number. There will be at least two non-empty arrays.
The total number of the integers in all the m arrays will be in the range of [2, 10000].
The integers in the m arrays will be in the range of [-10000, 10000].

解法

list中的每一个list是有序的，所以list.get(0)是最小的，list.get(list.size() - 1)是最大的。
用当前数组的最大值减去min，用最小值减去max。结合当前list更新最大值和最小值。

public class Solution {    public int maxDistance(List<List<Integer>> arrays) {        if (arrays == null || arrays.size() == 0) {            return 0;        }        int result = Integer.MIN_VALUE;        int max = arrays.get(0).get(arrays.get(0).size() - 1);        int min = arrays.get(0).get(0);        for (int i = 1; i < arrays.size(); i++) {            result = Math.max(result, Math.abs(arrays.get(i).get(arrays.get(i).size() - 1) - min));            result = Math.max(result, Math.abs(arrays.get(i).get(0) - max));            max = Math.max(max, arrays.get(i).get(arrays.get(i).size() - 1));            min = Math.min(min, arrays.get(i).get(0));        }        return result;    }}