453. Minimum Moves to Equal Array Elements

题目摘要
给定一个非空n长数组，找出使数组所有元素相等的最小步数，每一步操作为将数组中n-1个元素加一。

解法
设tmp = nums[0]，遍历数组，如果nums[i] > tmp，则步数result += nums[i] - tmp，如果nums[i] < tmp，则步数result += (tmp - nums[i]) * i; tmp = nums[i];

public class Solution {
    public int minMoves(int[] nums) {
        int result = 0;
        int tmp = nums[0];
        for (int i = 0; i < nums.length; i++) {
            if (tmp < nums[i]) {
                result += nums[i] - tmp;
            } else if (tmp > nums[i]) {
                result += (tmp - nums[i]) * i;
                tmp = nums[i];
            }
        }
        return result;
    }
}

注意

可问问题

原题
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]