-
-
Notifications
You must be signed in to change notification settings - Fork 50.4k
Expand file tree
/
Copy pathminimum_absolute_difference_pairs.py
More file actions
47 lines (37 loc) · 1.27 KB
/
minimum_absolute_difference_pairs.py
File metadata and controls
47 lines (37 loc) · 1.27 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
def minimum_absolute_difference_pairs(arr: list[int]) -> list[list[int]]:
"""
Given an array of distinct integers, return all pairs of elements
with the minimum absolute difference.
Args:
arr: list of integers
Returns:
list of pairs (as lists) with the minimum absolute difference
Examples:
>>> minimum_absolute_difference_pairs([4, 2, 1, 3])
[[1, 2], [2, 3], [3, 4]]
>>> minimum_absolute_difference_pairs([1, 3, 6, 10, 15])
[[1, 3]]
>>> minimum_absolute_difference_pairs([3, 8, -10, 23, 19, -4, -14, 27])
[[-14, -10], [19, 23], [23, 27]]
>>> minimum_absolute_difference_pairs([])
[]
>>> minimum_absolute_difference_pairs([5])
[]
"""
if len(arr) < 2:
return []
# Sort array for adjacent difference comparison
arr.sort()
# Find minimum difference
min_diff = float("inf")
for i in range(1, len(arr)):
min_diff = min(min_diff, arr[i] - arr[i - 1])
# Collect all pairs with minimum difference
result = []
for i in range(1, len(arr)):
if arr[i] - arr[i - 1] == min_diff:
result.append([arr[i - 1], arr[i]])
return result
if __name__ == "__main__":
from doctest import testmod
testmod()