mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
17 lines
579 B
HTML
17 lines
579 B
HTML
<p>Given two arrays of integers, compute the pair of values (one value in each array) with the smallest (non-negative) difference. Return the difference.</p>
|
|
|
|
|
|
|
|
<p><strong>Example: </strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input: </strong>{1, 3, 15, 11, 2}, {23, 127, 235, 19, 8}
|
|
|
|
<strong>Output: </strong> 3, the pair (11, 8)
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
<p><strong>Note: </strong></p>
|
|
|
|
|
|
|
|
<ul>
|
|
|
|
<li><code>1 <= a.length, b.length <= 100000</code></li>
|
|
|
|
<li><code>-2147483648 <= a[i], b[i] <= 2147483647</code></li>
|
|
|
|
<li>The result is in the range [0, 2147483647]</li>
|
|
|
|
</ul>
|
|
|