[Swift]LeetCode1200. 最小绝对差 | Minimum Absolute Difference

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（let_us_code）
➤博主域名：https://www.zengqiang.org
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/11565805.html
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

Given an array of distinct integers arr, find all pairs of elements in ascending order with the minimum absolute difference of any two elements.

Example 1:

Input: arr = [4,2,1,3]
Output: [[1,2],[2,3],[3,4]]

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

---

给你个整数数组 arr，其中每个元素都 不相同。

请你找到所有具有最小绝对差的元素对，并且按升序的顺序返回。

示例 1：

输入：arr = [4,2,1,3]
输出：[[1,2],[2,3],[3,4]]

示例 2：

输入：arr = [1,3,6,10,15]
输出：[[1,3]]

示例 3：

输入：arr = [3,8,-10,23,19,-4,-14,27]
输出：[[-14,-10],[19,23],[23,27]]

提示：

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

---

740ms

class Solution {
    func minimumAbsDifference(_ arr: [Int]) -> [[Int]] {
        let sortArr = arr.sorted()
        var minDifference = Int.max;
        var last = 0;
        var res = [[Int]]()
        for i in 0..<sortArr.count {
            if i == 0 {
                last = sortArr[0]
                continue
            }
            
            let difference = sortArr[i] - last
            if difference == minDifference {
                res.append([last, sortArr[i]])
            } else if difference < minDifference {
                res.removeAll()
                minDifference = sortArr[i] - last;
                res.append([last, sortArr[i]])
            } else {
                
            }
            last = sortArr[i]
        }
        return res
    }
}

---

744ms

class Solution {
    func minimumAbsDifference(_ arr: [Int]) -> [[Int]] {
        let sArr = arr.sorted()
        
        var minDiff = Int.max
        var ans: [[Int]] = []
        for i in 1 ..< sArr.count {
            let aDiff = abs(sArr[i] - sArr[i-1])
            if aDiff <= minDiff {
                if aDiff < minDiff {
                    minDiff = aDiff
                    ans.removeAll()
                }
                ans.append([sArr[i-1], sArr[i]])
            }
        }
        
        return ans
    }
}

---

Runtime: 764 ms

Memory Usage: 25.1 MB

class Solution {
    func minimumAbsDifference(_ arr: [Int]) -> [[Int]] {
        var arr = arr
        arr.sort()
        let n:Int = arr.count
        var min_diff:Int = 1_000_000_000
        var ans:[[Int]] = [[Int]]()
        for i in 0..<(n-1)
        {
            min_diff = min(min_diff, arr[i + 1] - arr[i])
        }
        for i in 0..<(n-1)
        {
            if arr[i + 1] - arr[i] == min_diff
            {
                ans.append([arr[i], arr[i + 1]])
            }
        }
        return ans
    }
}