mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
40 lines
1.2 KiB
HTML
40 lines
1.2 KiB
HTML
<p>Given an array of <strong>distinct</strong> integers <code>arr</code>, find all pairs of elements with the minimum absolute difference of any two elements.</p>
|
|
|
|
<p>Return a list of pairs in ascending order(with respect to pairs), each pair <code>[a, b]</code> follows</p>
|
|
|
|
<ul>
|
|
<li><code>a, b</code> are from <code>arr</code></li>
|
|
<li><code>a < b</code></li>
|
|
<li><code>b - a</code> equals to the minimum absolute difference of any two elements in <code>arr</code></li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [4,2,1,3]
|
|
<strong>Output:</strong> [[1,2],[2,3],[3,4]]
|
|
<strong>Explanation: </strong>The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [1,3,6,10,15]
|
|
<strong>Output:</strong> [[1,3]]
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [3,8,-10,23,19,-4,-14,27]
|
|
<strong>Output:</strong> [[-14,-10],[19,23],[23,27]]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= arr.length <= 10<sup>5</sup></code></li>
|
|
<li><code>-10<sup>6</sup> <= arr[i] <= 10<sup>6</sup></code></li>
|
|
</ul>
|