453. Minimum Moves to Equal Array Elements

标签：number   lis   pre   move   nim   self   rem   tin   find   

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]




class Solution(object):
    def minMoves(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        l = len(nums)
        min = nums[0]
        for i in nums:
            if min>i:
                min = i
        sum = 0
        for i in nums:
            sum = sum+i
        return sum-min*l

453. Minimum Moves to Equal Array Elements

标签：number   lis   pre   move   nim   self   rem   tin   find   

原文地址：http://www.cnblogs.com/bernieloveslife/p/7691851.html