[LeetCode] 453.Minimum Moves to Equal Array Elements

[LeetCode] 453.Minimum Moves to Equal Array Elements

• 题目描述
• 解题思路
• 实验代码

---

题目描述

Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.

Example:
Input:
[1,2,3]

Output:
3

Explanation:
Only three moves are needed (remember each move increments two elements):
[1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]

解题思路

事实上这个问题更偏向于一个数学问题，先将数组中的元素从小到大排序，之后再进行找差值的操作，再将其中元素加上差值，反复操作最后得出最终的n个元素都相等的情况。找到其中的规律就能轻松解决。

实验代码

class Solution {
public:
    int minMoves(vector<int>& nums) {
        int s = 0, i = nums.size()-1;
        sort(nums.begin(), nums.end());
        while (i >= 0) {
            nums[i] += s;
            s += nums[i] - nums[0];
            nums[0] = nums[i];
            i--;
        }
    return s;
    }
};