StarWalker

Where my heart will take me

0%

Leetcode453-minimumMovestoEqualArrayElements

Posted on Edited on In Views: Valine:
Solution Report of LeetCode Acceptted

Description

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]

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
    public int minMoves(int[] nums) {
        if (nums == null || nums.length == 0) return 0;        
//         sum + m(n-1) = x * n
//         x = minVal + m
//         => m = sum - n * minVal
        int sum = 0;
        int minVal = Integer.MAX_VALUE;
        for (int num: nums){
            sum += num;
            minVal = Math.min(minVal, num);
        }
        return sum - nums.length * minVal;        
    }
}