leetcode 453. Minimum Moves to Equal Array Elements

public class Solution { // 将每次n-1个数加1直到数列全都相等，与每次将数列一个元素减一直到数列值都相等，需要的操作次数相等 public int minMoves(int[] nums) { int sum = 0; int min = Integer.MAX_VALUE; for (int val : nums ) { if (val<min) min = val; sum += val; } return sum - nums.length * min; } }