mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
33 lines
1.0 KiB
HTML
33 lines
1.0 KiB
HTML
<p>Given an integer array <code>nums</code> of size <code>n</code>, return <em>the minimum number of moves required to make all array elements equal</em>.</p>
|
|
|
|
<p>In one move, you can increment or decrement an element of the array by <code>1</code>.</p>
|
|
|
|
<p>Test cases are designed so that the answer will fit in a <strong>32-bit</strong> integer.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,3]
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong>
|
|
Only two moves are needed (remember each move increments or decrements one element):
|
|
[<u>1</u>,2,3] => [2,2,<u>3</u>] => [2,2,2]
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,10,2,9]
|
|
<strong>Output:</strong> 16
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == nums.length</code></li>
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>
|
|
</ul>
|