mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
21 lines
594 B
HTML
21 lines
594 B
HTML
<p>给定两个整数数组<code>a</code>和<code>b</code>，计算具有最小差绝对值的一对数值（每个数组中取一个值），并返回该对数值的差</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>{1, 3, 15, 11, 2}, {23, 127, 235, 19, 8}
|
||
<strong>输出：</strong>3，即数值对(11, 8)
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= a.length, b.length <= 100000</code></li>
|
||
<li><code>-2147483648 <= a[i], b[i] <= 2147483647</code></li>
|
||
<li>正确结果在区间 <code>[0, 2147483647]</code> 内</li>
|
||
</ul>
|