如何在 Swift 数组中寻找最大相邻差值

输入: nums = [3,6,9,1]
输出: 3
解释: 排序后的数组是 [1,3,6,9]  ,  其中相邻元素 (3,6) 和 (6,9) 之间都存在最大差值 3。

输入: nums = [10]
输出: 0
解释: 数组元素个数小于 2，因此返回 0。

import Foundation

func maximumGap(_ nums: [Int]) -> Int {
    guard nums.count > 1 else { return 0 }

    let minValue = nums.min()!
    let maxValue = nums.max()!
    let n = nums.count

    // 计算桶大小和桶数量
    let bucketSize = max(1, (maxValue - minValue) / (n - 1))
    let bucketCount = (maxValue - minValue) / bucketSize + 1

    // 初始化桶
    var buckets = Array(repeating: (min: Int?.none, max: Int?.none), count: bucketCount)

    // 将元素放入桶中
    for num in nums {
        let index = (num - minValue) / bucketSize
        buckets[index].min = buckets[index].min.map { min($0, num) } ?? num
        buckets[index].max = buckets[index].max.map { max($0, num) } ?? num
    }

    // 计算最大差值
    var previousMax = minValue
    var maxGap = 0

    for bucket in buckets {
        if let currentMin = bucket.min, let currentMax = bucket.max {
            maxGap = max(maxGap, currentMin - previousMax)
            previousMax = currentMax
        }
    }

    return maxGap
}

// 测试用例
let nums1 = [3, 6, 9, 1]
print("Maximum gap for nums1: \(maximumGap(nums1))") // 输出: 3

let nums2 = [10]
print("Maximum gap for nums2: \(maximumGap(nums2))") // 输出: 0

let nums3 = [1, 10000000]
print("Maximum gap for nums3: \(maximumGap(nums3))") // 输出: 9999999