java.lang.Object
g1101_1200.s1200_minimum_absolute_difference.Solution

public class Solution extends Object
1200 - Minimum Absolute Difference.<p>Easy</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr = [4,2,1,3]</p> <p><strong>Output:</strong> [[1,2],[2,3],[3,4]]</p> <p><strong>Explanation:</strong> The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> arr = [1,3,6,10,15]</p> <p><strong>Output:</strong> <a href="1,3">1,3</a></p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> arr = [3,8,-10,23,19,-4,-14,27]</p> <p><strong>Output:</strong> [[-14,-10],[19,23],[23,27]]</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>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • minimumAbsDifference

      public List<List<Integer>> minimumAbsDifference(int[] arr)