LeetCode: Minimum Moves to Equal Array Elements

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

1
2
3
4
5
6
7
8
9
10
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
13
14
15
public class Solution {
public int minMoves(int[] nums) {
int min = Integer.MAX_VALUE;
for (int i : nums) {
min = Math.min(i, min);
}

int result = 0;
for (int i : nums) {
result += i - min;
}

return result;
}
}