453. Minimum Moves to Equal Array Elements

Given a non-empty integer array of size n , find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.

Example:

Input:
[1,2,3]

Output:
3

Explanation:
Only three moves are needed (remember each move increments two elements):

[1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]

# @lc code=start
using LeetCode

function min_moves_453(nums::Vector{Int})
    sum(nums) - minimum(nums) * length(nums)
end
# @lc code=end

min_moves_453 (generic function with 1 method)

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