leetcode 最小操作次数使元素相等

Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.

In one move, you can increment n - 1 elements of the array by 1.

func minMoves(nums []int) int {
    sort.Ints(nums) 
    if len(nums) == 1 {
        return 0
    }
    preM, preN := 0, nums[0] 
    for i := 1; i < len(nums); i++ {
        curN := nums[i] + preM
        preM = preM + curN - preN
        preN = curN
    }
    return preM
}