[leetcode] 1200. Minimum Absolute Difference

Description

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

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.

Example 2:

Input: arr = [1,3,6,10,15]
Output: [[1,3]]

Example 3:

Input: arr = [3,8,-10,23,19,-4,-14,27]
Output: [[-14,-10],[19,23],[23,27]]

Constraints:

1. 2 <= arr.length <= 10^5.
2. -10^6 <= arr[i] <= 10^6.

分析

题目的意思是：求一个数组中两数绝对值最小的对数，这道题我首先进行了从小到大排序，然后遍历一个一个的找最小间隔，如果找到了，时间复杂度用在排序上了O(nlogn)

代码

class Solution:
    def minimumAbsDifference(self, arr: List[int]) -> List[List[int]]:
        arr.sort()
        n=len(arr)
        min_val=arr[1]-arr[0]
        res=[]
        for i in range(n-1):
            val=arr[i]
            val_next=arr[i+1]
            t=val_next-val
         
            if(t<min_val):
                min_val=t
                res=[[val,val_next]]
            elif(t==min_val):
                if(i==0):
                    res=[[val,val_next]]
                else:
                    res.append([val,val_next])
        return res