标签：row example pre int exp 数组 tin empty minimum
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]
s
[LeetCode] Minimum Moves to Equal Array Elements 最少移动次数使数组元素相等
标签：row example pre int exp 数组 tin empty minimum
原文地址：http://www.cnblogs.com/grandyang/p/6053827.html
