coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
leetcode-cn/problem (English)/最小差(English) [smallest-difference-lcci].html
View File

@@ -1,16 +1,16 @@
<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 &lt;= a.length, b.length &lt;= 100000</code></li>
<li><code>-2147483648 &lt;= a[i], b[i] &lt;= 2147483647</code></li>
<li>The result is in the range [0, 2147483647]</li>
</ul>
<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>