1552. Magnetic Force Between Two Balls

In universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket. Rick has n empty baskets, the ith basket is at position[i], Morty has m balls and needs to distribute the balls into the baskets such that the minimum magnetic force between any two balls is maximum.

Rick stated that magnetic force between two different balls at positions x and y is |x - y|.

Given the integer array position and the integer m. Return the required force.

Example 1:

Input: position = [1,2,3,4,7], m = 3
Output: 3
Explanation: Distributing the 3 balls into baskets 1, 4 and 7 will make the magnetic force between ball pairs [3, 3, 6]. The minimum magnetic force is 3. We cannot achieve a larger minimum magnetic force than 3.

Example 2:

Input: position = [5,4,3,2,1,1000000000], m = 2
Output: 999999999
Explanation: We can use baskets 1 and 1000000000.

Constraints:

• n == position.length
• 2 <= n <= 10^5
• 1 <= position[i] <= 10^9
• All integers in position are distinct.
• 2 <= m <= position.length

# @lc code=start
using LeetCode

function max_distance(position::Vector{Int}, m::Int)
    sort!(position)
    lowest, highest = 1, position[end] - position[1]
    while lowest < highest
        mid = (highest + lowest + 1) ÷ 2
        left_pos = position[1]
        left_num = m - 1
        for pos in position
            if pos - left_pos >= mid
                left_pos = pos
                left_num -= 1
                if left_num == 0
                    break
                end
            end
        end
        if left_num == 0
            lowest = mid
        else
            highest = mid - 1
        end
    end
    lowest
end
# @lc code=end

max_distance (generic function with 1 method)

This page was generated using DemoCards.jl and Literate.jl.