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个数，每操作一步可以令n-1个数都加一，求需要多少步操作才能使得n个数都相等。令n-1数加一，也可以看做令一个数减一，那么先求数组中的最小值，再求其他数需要多少步才能等于它。

class Solution {
public:
    int minMoves(vector<int>& nums) {
        int min_num=INT_MAX;
        for(int i=0;i<nums.size();i++) 
            min_num=min(min_num,nums[i]);
        int result=0;
        for(int i=0;i<nums.size();i++)
            result+=nums[i]-min_num;
        return result;
    }
};