The first approach involves sorting the array and then iterating through it to find the pairs with the minimum absolute difference. By sorting, the smallest differences can only occur between consecutive elements. Hence, we sort the array and compute differences between adjacent elements to find the minimum difference.
Steps:
Time Complexity: O(n log n), due to sorting the array. Space Complexity: O(1), not considering the output space.
1import java.util.ArrayList;
2import java.util.Arrays;
3import java.util.List;
4
5class Solution {
6 public List<List<Integer>> minimumAbsDifference(int[] arr) {
7 Arrays.sort(arr);
8 int minDiff = Integer.MAX_VALUE;
9 List<List<Integer>> result = new ArrayList<>();
10 for (int i = 1; i < arr.length; i++) {
11 int diff = arr[i] - arr[i - 1];
12 if (diff < minDiff) {
13 minDiff = diff;
14 result.clear();
15 result.add(Arrays.asList(arr[i - 1], arr[i]));
16 } else if (diff == minDiff) {
17 result.add(Arrays.asList(arr[i - 1], arr[i]));
18 }
19 }
20 return result;
21 }
22}
23The Java solution sorts the array and finds the minimum absolute difference between consecutive elements, updating the result list according to whether a new minimum is found or if the minimum difference is maintained.
The second approach compares all pairs of elements to determine their absolute differences. This method ensures that all possible pairs are considered, and the pairs with the minimum difference are identified. Although not as efficient as the first approach, it explicitly checks every possible pair.
Steps:
Time Complexity: O(n^2), considering all pair combinations. Space Complexity: O(1), excluding result space.
1#include <vector>
2#include <algorithm>
3
4std::vector<std::vector<int>> minimumAbsDifference(std::vector<int>& arr) {
5 int minDiff = INT_MAX;
6 std::vector<std::vector<int>> result;
7 for (size_t i = 0; i < arr.size(); ++i) {
8 for (size_t j = i + 1; j < arr.size(); ++j) {
9 int diff = std::abs(arr[i] - arr[j]);
10 if (diff < minDiff) {
11 minDiff = diff;
12 result.clear();
13 result.push_back({arr[i], arr[j]});
14 } else if (diff == minDiff) {
15 result.push_back({arr[i], arr[j]});
16 }
17 }
18 }
19 return result;
20}
21This C++ solution systematically checks every element pair, calculating their disparity and updating the recorded minimal difference before accumulating the appropriate pairs in the result array that is ultimately returned.