453. Minimum Moves to Equal Array Elements(LeetCode)

标签：nbsp   solution   cpp   out   elements   vector   int   nts   div   

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]

class Solution {
public:
    int minMoves(vector<int>& nums) {
        int mn = INT_MAX, res = 0;
        for (int num : nums) mn = min(mn, num);
        for (int num : nums) res += num - mn;
        return res;
    }
};

453. Minimum Moves to Equal Array Elements(LeetCode)

标签：nbsp   solution   cpp   out   elements   vector   int   nts   div   

原文地址：http://www.cnblogs.com/wujufengyun/p/6794482.html