【leetcode】最小移动次数使数组元素相等

 

int minMoves(int* nums, int numsSize){
    int count=0,i,min=nums[0];
    for(i=1; i<numsSize; i++) if(nums[i] < min) min = nums[i];
    for(i=0; i<numsSize; i++) count += nums[i] - min;
    return count;
}