453. Minimum Moves to Equal Array Elements

标签：required   ber   exp   mini   member   span   sum   where   output   

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]

public class Solution {
    public int minMoves(int[] nums) {
        // 其实就是数学问题， 全部n-1个值加1就是一个值减1 公式 sum（array）－ n ＊ min（array）
        int min = Integer.MAX_VALUE;
        int sum = 0;
        for(int i = 0 ; i < nums.length ; i ++){
            min = Math.min(min, nums[i]);
            sum += nums[i];
        }
        return sum - nums.length * min;
    }
}

453. Minimum Moves to Equal Array Elements

标签：required   ber   exp   mini   member   span   sum   where   output   

原文地址：http://www.cnblogs.com/joannacode/p/6100190.html