1ame的博客

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. 给定一个长度为n的非空整数数组，定义move动作，一次mo