minimum-moves-to-equal-array-elements

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an integer array <code>nums</code> of size <code>n</code>, return the minimum number of moves required to make all array elements equal.

In one move, you can increment <code>n - 1</code> elements of the array by <code>1</code>.

&nbsp;
Example 1:

<pre>
Input: nums = [1,2,3]
Output: 3
Explanation: Only three moves are needed (remember each move increments two elements):
[1,2,3] =&gt; [2,3,3] =&gt; [3,4,3] =&gt; [4,4,4]
</pre>

Example 2:

<pre>
Input: nums = [1,1,1]
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-109 &lt;= nums[i] &lt;= 109</code></li>
	<li>The answer is guaranteed to fit in a 32-bit integer.</li>
</ul>