首页 > itarticle > [leetcode] problem 453 – minimum moves to equal array elements

[leetcode] problem 453 – minimum moves to equal array elements

admin 11月 13, 2020 0

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]

Code


// 2. min + m = x
// m = S – n * min
public int (int[] nums) {
    int sum = 0;
    int min = Integer.MAX_VALUE;

    for (int num : nums) {
        sum += num;
        min = Math.min(min, num);
    }

    return sum - nums.length * min;
}