mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
34 lines
1.3 KiB
HTML
34 lines
1.3 KiB
HTML
<p>You are given <code>m</code> <code>arrays</code>, where each array is sorted in <strong>ascending order</strong>.</p>
|
|
|
|
<p>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 <code>a</code> and <code>b</code> to be their absolute difference <code>|a - b|</code>.</p>
|
|
|
|
<p>Return <em>the maximum distance</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arrays = [[1,2,3],[4,5],[1,2,3]]
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> 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.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arrays = [[1],[1]]
|
|
<strong>Output:</strong> 0
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>m == arrays.length</code></li>
|
|
<li><code>2 <= m <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= arrays[i].length <= 500</code></li>
|
|
<li><code>-10<sup>4</sup> <= arrays[i][j] <= 10<sup>4</sup></code></li>
|
|
<li><code>arrays[i]</code> is sorted in <strong>ascending order</strong>.</li>
|
|
<li>There will be at most <code>10<sup>5</sup></code> integers in all the arrays.</li>
|
|
</ul>
|