Minimum Absolute Difference LeetCode solution in Python

1
# Runtime: 574 ms (Top 47.47%) | Memory: 28.9 MB (Top 58.47%)
2
class Solution:
3
    def minimumAbsDifference(self, arr: List[int]) -> List[List[int]]:
4
        arr.sort()
5
        diff = float(inf)
6
        for i in range(0, len(arr) - 1):
7
            if arr[i + 1] - arr[i] < diff:
8
                diff = arr[i + 1] - arr[i]
9
        lst = []
10
        for i in range(0, len(arr) - 1):
11
            if arr[i + 1] - arr[i] == diff:
12
                lst.append([arr[i], arr[i + 1]])
13
        return lst