문제
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
제한사항`
- 2 <= arr.length <= 10^5
- -10^6 <= arr[i] <= 10^6
입출력 예
1
2
3
4
5
| 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.
|
1
2
3
4
| Example 2:
Input: arr = [1,3,6,10,15]
Output: [[1,3]]
|
1
2
3
4
| Example 3:
Input: arr = [3,8,-10,23,19,-4,-14,27]
Output: [[-14,-10],[19,23],[23,27]]
|
풀이
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
| func minimumAbsDifference(arr []int) [][]int {
result := make([][]int, 0)
sort.Ints(arr)
minDistinct := int(^uint(0) >> 1)
for i := 0 ; i < len(arr) - 1 ; i++ {
val := arr[i+1] - arr[i]
if (val < minDistinct) {
minDistinct = val
result = nil
}
if (val == minDistinct) {
result = append(result, []int{arr[i], arr[i+1]})
}
}
return result
}
|
