[LeetCode] 453. 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:

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]

题意：每次给数组中n-1个数字+1，问最少执行多少次可以使得全部数字都一样
这题和462是一类型的，我又是一开始写的462比较复杂那个，
这题逆向思维，n-1个数字+1，那么可以看作某个数字-1
全部减到最小那个数字就行了

class Solution {
    public int minMoves(int[] nums) {
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < nums.length; i++) {
            min = Math.min(min, nums[i]);
        }
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            sum += Math.abs(min - nums[i]);
        }
        return sum;
    }
}

 

转载于:https://www.cnblogs.com/Moriarty-cx/p/9769726.html