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-1个数同时+1， 问多少步操作后，使得数组里的每一个数都相当

把问题转换下  就是每一步操作都给1个数-1 

C++（52ms）：

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