Lua最大间距：排序扫描与桶分隔离

local function maxGapSort(nums)
    table.sort(nums)
    local best = 0
    for i = 2, #nums do
        if nums[i] - nums[i - 1] > best then
            best = nums[i] - nums[i - 1]
        end
    end
    return best
end

local function maxGapBucket(nums)
    local lo, hi = math.huge, -math.huge
    for _, v in ipairs(nums) do
        if v < lo then lo = v end
        if v > hi then hi = v end
    end
    local width = math.ceil((hi - lo) / (#nums - 1))
    local bmin, bmax = {}, {}
    for _, v in ipairs(nums) do
        local b = math.floor((v - lo) / width) + 1
        bmin[b] = math.min(bmin[b] or v, v)
        bmax[b] = math.max(bmax[b] or v, v)
    end
    local best, prev = 0, bmax[1]
    for b = 2, #nums do
        if bmin[b] then
            if bmin[b] - prev > best then
                best = bmin[b] - prev
            end
            prev = bmax[b]
        end
    end
    return best
end