1200. Minimum Absolute Difference

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:

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

``````class Solution {
public:
vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
vector<vector<int>> res;
int n = arr.size(), mn = INT_MAX;
sort(arr.begin(), arr.end());
for (int i = 1; i < n; ++i) {
int diff = arr[i] - arr[i - 1];
if (diff <= mn) {
if (diff < mn) res.clear();
mn = diff;
res.push_back({arr[i - 1], arr[i]});
}
}
return res;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1200

https://leetcode.com/problems/minimum-absolute-difference/

https://leetcode.com/problems/minimum-absolute-difference/discuss/388289/Java-sorting-beats-100-explained

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation