LeetCode 453. 最小移动次数使数组元素相等（数学）

示例:
输入:
[1,2,3]

输出:
3
解释:
只需要3次移动（注意每次移动会增加两个元素的值）：

[1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]

class Solution {
public:
    int minMoves(vector<int>& nums) {
        long MinNum = nums[0], sum = nums[0]; 
        int i, n = nums.size();
        for(i = 1; i < n; ++i)
        {
        	if(nums[i] < MinNum)
        		MinNum = nums[i];
        	sum += nums[i];
        }
        //(final-MinNum)*(n-1)+sum == n*final
        //final = sum-(n-1)*MinNum
        //final-MinNum = sum-n*MinNum
        return sum-n*MinNum;
    }
};