> For the complete documentation index, see [llms.txt](https://cai-sen-se.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cai-sen-se.gitbook.io/leetcode/401-600/453.-zui-xiao-yi-dong-ci-shu-shi-shu-zu-yuan-su-xiang-deng.md).

# 453. 最小移动次数使数组元素相等

<https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements/>

## 解法一：逆向思维

每次n-1个元素+1，最终使所有元素相等。**等价**于每次一个元素-1，最终所有元素相等，易知最少的操作次数是所有元素最终等于最小元素。

```python
class Solution:
    def minMoves(self, nums: List[int]) -> int:
        minNum = min(nums)    #找最小元素
        res = 0
        for num in nums:
            res += num - minNum
        return res
```