题目链接
题目描述
给你个整数数组 arr,其中每个元素都 不相同。
请你找到所有具有最小绝对差的元素对,并且按升序的顺序返回。
示例 1:
输入:arr = [4,2,1,3]
输出:[[1,2],[2,3],[3,4]]
示例 2:输入:arr = [1,3,6,10,15]
输出:[[1,3]]
示例 3:输入:arr = [3,8,-10,23,19,-4,-14,27]
输出:[[-14,-10],[19,23],[23,27]]
提示:
2 <= arr.length <= 10^5
-10^6 <= arr[i] <= 10^6
解题思路
首先对数组排序,只有相邻元素才会产生最小绝对差,所以遍历即可
代码
Python
class Solution:
def minimumAbsDifference(self, arr: list[int]) -> list[list[int]]:
minDiff = 1000000
arr.sort()
ans = []
for i in range(1, len(arr)):
diff = arr[i] - arr[i - 1]
if diff < minDiff:
minDiff = diff
ans = [[arr[i - 1], arr[i]]]
elif diff == minDiff:
ans.append([arr[i - 1], arr[i]])
return ans