mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
44 lines
1.1 KiB
HTML
44 lines
1.1 KiB
HTML
<p>给你个整数数组 <code>arr</code>，其中每个元素都 <strong>不相同</strong>。</p>
|
||
|
||
<p>请你找到所有具有最小绝对差的元素对，并且按升序的顺序返回。</p>
|
||
|
||
<p>每对元素对 <code>[a,b</code>] 如下：</p>
|
||
|
||
<ul>
|
||
<li><code>a , b</code> 均为数组 <code>arr</code> 中的元素</li>
|
||
<li><code>a < b</code></li>
|
||
<li><code>b - a</code> 等于 <code>arr</code> 中任意两个元素的最小绝对差</li>
|
||
</ul>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<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]
|
||
<strong>输出：</strong>[[1,3]]
|
||
</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>arr = [3,8,-10,23,19,-4,-14,27]
|
||
<strong>输出：</strong>[[-14,-10],[19,23],[23,27]]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>2 <= arr.length <= 10^5</code></li>
|
||
<li><code>-10^6 <= arr[i] <= 10^6</code></li>
|
||
</ul>
|