Minimum Moves to Equal Array Elements

Medium

Topics
ArrayMathGreedy

Given an array nums, in one move you may increment n - 1 elements by 1. Return the minimum number of moves to make all elements equal. Incrementing n-1 elements is equivalent to decrementing one, so the answer is the sum of each element minus the minimum.

Example 1

Input:  nums = [1,2,3]
Output: 3

Example 2

Input:  nums = [1,1,1]
Output: 0

Constraints

  • 1 <= nums.length <= 10^5
  • -10^9 <= nums[i] <= 10^9
Run ⌘' · Submit ⌘⏎