1200. Minimum Absolute Difference

#### QUESTION:

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:

``````2 <= arr.length <= 10^5
-10^6 <= arr[i] <= 10^6
``````

#### EXPLANATION:

easy的题目, 思路非常简单

1. 首先对数组进行sort
2. 计算出最小的gap
3. 遍历数组, 如果两者之间的gap等于最小gap就加入到结果中
4. 返回结果

#### SOLUTION:

``````class Solution {
func minimumAbsDifference(_ arr: [Int]) -> [[Int]] {
var newArr:[Int] = arr
newArr.sort()
var minGap:Int = Int.max
var result:[[Int]] = []
for index in 1...newArr.count - 1 {
minGap = minGap > newArr[index] - newArr[index-1] ? newArr[index] - newArr[index-1] : minGap
}
for index in 1...newArr.count - 1 {
if newArr[index] - newArr[index-1] == minGap {
var tmpArr:[Int] = []
tmpArr.append(newArr[index-1])
tmpArr.append(newArr[index])
result.append(tmpArr)
}
}
return result
}
}
``````