453. Minimum Moves to Equal Array Elements

题目来源【Leetcode】

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]

这道题就是找规律，最后发现结果就是nums的总和减去最小数与nums个数的积：

class Solution {
public:
    int minMoves(vector<int>& nums) {
        int sum = 0;
        int mi = INT_MAX;
        for(int i = 0; i < nums.size(); i++) {
            if(nums[i] < mi) mi = nums[i];
            sum += nums[i];
        }
        return sum-nums.size() * mi;
    }
};