Package g1101_1200.s1200_minimum_absolute_difference

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1200 - Minimum Absolute Difference\.

    Easy

    Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.

    Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows

    • a, b are from arr

    • a < b

    • b - a equals to the minimum absolute difference of any two elements in arr

    Example 1:

    Input: arr = 4,2,1,3

    Output: [1,2,2,3,3,4]

    Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.

    Example 2:

    Input: arr = 1,3,6,10,15

    Output: [1,3]

    Example 3:

    Input: arr = 3,8,-10,23,19,-4,-14,27

    Output: [-14,-10,19,23,23,27]

    Constraints:

    • <code>2 <= arr.length <= 10<sup>5</sup></code>

    • <code>-10<sup>6</sup><= arri<= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<List<Integer>> minimumAbsDifference(IntArray arr)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait