1200 Minimum Absolute Difference

1 题目

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]]

2 尝试解

2.1 分析

给定一个由不同整数组成的序列，任意两个整数组成的数对之间，最小的差的绝对值即为最小绝对差。求所有差的绝对值等于最小绝对差的数对。

首先求出最小绝对差，将数组排序，最小绝对差一定出现在两个连续的整数之间，只需要依次比较排序后，所有的整数与前一个数之间的差距即可。进一步考虑，当前最小绝对差变为1时，即可停止。

然后求绝对差等于最小绝对差的所有数对，只需要依次比较排序后，所有相邻两数组成的数对即可。

2.2 代码

class Solution {
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        sort(arr.begin(),arr.end());
        int min_diff = INT_MAX;
        for(int i = 1; i < arr.size() && min_diff > 1; i++)
            min_diff = min(min_diff,arr[i]-arr[i-1]);
        vector<vector<int>> result;
        for(int i = 1; i < arr.size(); i ++){
            if(arr[i]-arr[i-1] == min_diff)
                result.push_back({arr[i-1],arr[i]});
        }
        return result;
    }
};

3 标准解

vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
    sort(arr.begin(), arr.end());
    
    vector<vector<int>> result;
    int min_diff = INT_MAX;
    
    // find min difference
    for (int i = 0; i < arr.size() - 1; ++i) {
        min_diff = min(arr[i + 1] - arr[i], min_diff);
    }
    
    // form a list of pairs with min difference, ascending  
    for (int i = 0; i < arr.size() - 1; ++i) {
        if (arr[i + 1] - arr[i] == min_diff)
            result.push_back({arr[i], arr[i + 1]});
    }
    return result;        
}