Minimum Moves to Equal Array Elements
Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
In one move, you can increment n - 1 elements of the array by 1.
Example 1
Input
nums = [1,2,3]Output
3Only three moves are needed because each move increments two elements: [1,2,3] => [2,3,3] => [3,4,3] => [4,4,4].
Example 2
Input
nums = [1,1,1]Output
0All elements are already equal, so no moves are required.
Constraints
- n == nums.length
- 1 <= nums.length <= 10^5
- -10^9 <= nums[i] <= 10^9
- The answer is guaranteed to fit in a 32-bit integer.