[Swift]LeetCode1200.最小绝对差|MinimumAbsoluteDifference

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› 移动开发›Swift 教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

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

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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

 1 class Solution {
 2     func minimumAbsDifference(_ arr: [Int]) -> [[Int]] {
 3         let sortArr = arr.sorted()
 4         var minDifference = Int.max;
 5         var last = 0;
 6         var res = [[Int]]()
 7         for i in 0..<sortArr.count {
 8             if i == 0 {
 9                 last = sortArr[0]
10                 continue
11             }
12             
13             let difference = sortArr[i] - last
14             if difference == minDifference {
15                 res.append([last, sortArr[i]])
16             } else if difference < minDifference {
17                 res.removeAll()
18                 minDifference = sortArr[i] - last;
19                 res.append([last, sortArr[i]])
20             } else {
21                 
22             }
23             last = sortArr[i]
24         }
25         return res
26     }
27 }

744ms

 1 class Solution {
 2     func minimumAbsDifference(_ arr: [Int]) -> [[Int]] {
 3         let sArr = arr.sorted()
 4         
 5         var minDiff = Int.max
 6         var ans: [[Int]] = []
 7         for i in 1 ..< sArr.count {
 8             let aDiff = abs(sArr[i] - sArr[i-1])
 9             if aDiff <= minDiff {
10                 if aDiff < minDiff {
11                     minDiff = aDiff
12                     ans.removeAll()
13                 }
14                 ans.append([sArr[i-1], sArr[i]])
15             }
16         }
17         
18         return ans
19     }
20 }

Runtime: 764 ms

Memory Usage: 25.1 MB

 1 class Solution {
 2     func minimumAbsDifference(_ arr: [Int]) -> [[Int]] {
 3         var arr = arr
 4         arr.sort()
 5         let n:Int = arr.count
 6         var min_diff:Int = 1_000_000_000
 7         var ans:[[Int]] = [[Int]]()
 8         for i in 0..<(n-1)
 9         {
10             min_diff = min(min_diff, arr[i + 1] - arr[i])
11         }
12         for i in 0..<(n-1)
13         {
14             if arr[i + 1] - arr[i] == min_diff
15             {
16                 ans.append([arr[i], arr[i + 1]])
17             }
18         }
19         return ans
20     }
21 }