453. Minimum Moves to Equal Array Elements

Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.

Example:

Input:[1,2,3]Output:3Explanation:Only three moves are needed (remember each move increments two elements):[1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]

n-1 个元素加1，相当于剩下那个的元素减1。要让所有的元素都相等，可以让所有的元素都减到min 的那个数。所以先找min，再累加所有元素跟min的差。代码如下：

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