LeetCode: Minimum Moves to Equal Array Elements

n-1个element加1相当于一个元素减1，那最少的move就是所有元素减去最小值之和

public class Solution {
    public int minMoves(int[] nums) {
        int min = nums[0];
        for (int i = 0; i < nums.length; i++) {
            min = Math.min(min, nums[i]);
        }
        int ans = 0;
        for (int i = 0; i < nums.length; i++) {
            ans += nums[i] - min;
        }
        return ans;
    }
}