leetcode-go/leetcode/easy/453.minimum-moves-to-equal-array-elements.go

func minMoves(nums []int) int {
	n := len(nums)
	if n <= 1 {
		return 0
	}
	min, sum := nums[0], nums[0]
	for i := 1; i < n; i++ {
		sum += nums[i]
		if nums[i] < min {
			min = nums[i]
		}
	}
	return sum - n*min
}