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:
3

Explanation:
Only three moves are needed (remember each move increments two elements):

[1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]

解答

1
2
3
4
5
6
7
8
9
10
11
12

public class Solution {
	public int minMoves(int[] nums) {
		int res = 0, max = 0;
		for (int i : nums) {
			max = (int) Math.max(i, max);
		}
		for (int i : nums) {
			res += max - i;
		}
		return res;
	}
}