1
2
3
4
5
6
7
8
9
10
11
12
13
14
| class Solution {
public int minMoves(int[] nums) {
int min = nums[0];
for (int i = 1; i < nums.length; i++) {
min = Math.min(min, nums[i]);
}
int moves = 0;
for (int num : nums) {
moves += num - min;
}
return moves;
}
}
|
References
453. Minimum Moves to Equal Array Elements