题目要求： https://leetcode-cn.com/problems/minimum-absolute-difference/submissions/
class Solution: def minimumAbsDifference(self, arr: List[int]) -> List[List[int]]: arr = sorted(arr) l, res =[], [] for i in range(len(arr) - 1): l.append([arr[i + 1] - arr[i]]) a = min(l) for i in range(len(arr) - 1): if arr[i + 1] - arr[i] == a[0]: res.append([arr[i], arr[i + 1]]) return res