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 1Given a non-empty integer array of size n,
阅读背景：
Leetcode: Minimum Moves to Equal Array Elements
来源：互联网
分享到：
