minimum-moves-to-equal-array-elements

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

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>

minMoves

Minimum Moves to Equal Array Elements

Minimum Moves to Equal Array Elements II

minimum-moves-to-equal-array-elements-ii

最小操作次数使数组元素相等 II

Maximum Running Time of N Computers

maximum-running-time-of-n-computers

同时运行 N 台电脑的最长时间

Pour Water Between Buckets to Make Water Levels Equal

pour-water-between-buckets-to-make-water-levels-equal

通过倒水操作让所有的水桶所含水量相等

Divide Players Into Teams of Equal Skill

divide-players-into-teams-of-equal-skill

划分技能点相等的团队

Find Minimum Operations to Make All Elements Divisible by Three

find-minimum-operations-to-make-all-elements-divisible-by-three

使所有元素都可以被 3 整除的最少操作数

Array

Math

&#32473;&#20320;&#19968;&#20010;&#38271;&#24230;&#20026; <code>n</code> &#30340;&#25972;&#25968;&#25968;&#32452;&#65292;&#27599;&#27425;&#25805;&#20316;&#23558;&#20250;&#20351; <code>n - 1</code> &#20010;&#20803;&#32032;&#22686;&#21152; <code>1</code> &#12290;&#36820;&#22238;&#35753;&#25968;&#32452;&#25152;&#26377;&#20803;&#32032;&#30456;&#31561;&#30340;&#26368;&#23567;&#25805;&#20316;&#27425;&#25968;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [1,2,3]
&#36755;&#20986;&#65306;3
&#35299;&#37322;&#65306;
&#21482;&#38656;&#35201;3&#27425;&#25805;&#20316;&#65288;&#27880;&#24847;&#27599;&#27425;&#25805;&#20316;&#20250;&#22686;&#21152;&#20004;&#20010;&#20803;&#32032;&#30340;&#20540;&#65289;&#65306;
[1,2,3] =&gt; [2,3,3] =&gt; [3,4,3] =&gt; [4,4,4]
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [1,1,1]
&#36755;&#20986;&#65306;0
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<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>&#31572;&#26696;&#20445;&#35777;&#31526;&#21512; 32-bit &#25972;&#25968;</li>
</ul>

&#26368;&#23567;&#25805;&#20316;&#27425;&#25968;&#20351;&#25968;&#32452;&#20803;&#32032;&#30456;&#31561;

Sunbelt Computer Software

PL/B Language Development and Support