coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 19:46:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
leetcode-cn/problem (Chinese)/最少移动次数使数组元素相等 II [minimum-moves-to-equal-array-elements-ii].html Normal file
View File

@@ -0,0 +1,16 @@
<p>给定一个非空整数数组，找到使所有数组元素相等所需的最小移动数，其中每次移动可将选定的一个元素加1或减1。 您可以假设数组的长度最多为10000。</p>
<p><strong>例如:</strong></p>
<pre>
<strong>输入:</strong>
[1,2,3]
<strong>输出:</strong>
2
<strong>说明：
</strong>只有两个动作是必要的（记得每一步仅可使其中一个元素加1或减1）：
[1,2,3] =&gt; [2,2,3] =&gt; [2,2,2]
</pre>