关键:数学
class Solution {
public:
int minMoves(vector<int>& nums) {
int sum=0;
int cot=nums.size();
int min=1000000001;
for (int i=0;i<cot;i++){
if (min>nums[i])
min=nums[i];
sum+=nums[i];
}
int cnt=sum-cot*min;
return cnt;
}
};