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

Rust Solution

struct Solution;

use std::i32;

impl Solution {
    fn minimum_abs_difference(mut arr: Vec<i32>) -> Vec<Vec<i32>> {
        arr.sort_unstable();
        let min = arr
            .windows(2)
            .fold(i32::MAX, |x, v| i32::min(x, v[1] - v[0]));
        let mut res: Vec<Vec<i32>> = vec![];
        for v in arr.windows(2) {
            if v[1] - v[0] == min {
                res.push(v.to_vec())
            }
        }
        res
    }
}

#[test]
fn test() {
    let arr = vec![4, 2, 1, 3];
    let res: Vec<Vec<i32>> = vec_vec_i32![[1, 2], [2, 3], [3, 4]];
    assert_eq!(Solution::minimum_abs_difference(arr), res);
    let arr = vec![1, 3, 6, 10, 15];
    let res: Vec<Vec<i32>> = vec_vec_i32![[1, 3]];
    assert_eq!(Solution::minimum_abs_difference(arr), res);
    let arr = vec![3, 8, -10, 23, 19, -4, -14, 27];
    let res: Vec<Vec<i32>> = vec_vec_i32![[-14, -10], [19, 23], [23, 27]];
    assert_eq!(Solution::minimum_abs_difference(arr), res);
}

Having problems with this solution? Click here to submit an issue on github.