coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 10:51:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
leetcode-cn/problem (Chinese)/最小绝对差 [minimum-absolute-difference].html
View File

@@ -2,23 +2,34 @@
<p>请你找到所有具有最小绝对差的元素对，并且按升序的顺序返回。</p>
<p>每对元素对 <code>[a,b</code>] 如下：</p>
<ul>
<li><code>a ,&nbsp;b</code>&nbsp;均为数组&nbsp;<code>arr</code>&nbsp;中的元素</li>
<li><code>a &lt; b</code></li>
<li><code>b - a</code>&nbsp;等于 <code>arr</code> 中任意两个元素的最小绝对差</li>
</ul>
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>arr = [4,2,1,3]
<pre>
<strong>输入：</strong>arr = [4,2,1,3]
<strong>输出：</strong>[[1,2],[2,3],[3,4]]
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>arr = [1,3,6,10,15]
<pre>
<strong>输入：</strong>arr = [1,3,6,10,15]
<strong>输出：</strong>[[1,3]]
</pre>
<p><strong>示例 3：</strong></p>
<pre><strong>输入：</strong>arr = [3,8,-10,23,19,-4,-14,27]
<pre>
<strong>输入：</strong>arr = [3,8,-10,23,19,-4,-14,27]
<strong>输出：</strong>[[-14,-10],[19,23],[23,27]]
</pre>