首页 > itarticle > algorithm notes: leetcode#453 minimum moves to equal array elements

algorithm notes: leetcode#453 minimum moves to equal array elements

admin 11月 12, 2020 0

Problem

Solution

Initial thoughts

Python implementation

class :
    def minMoves(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return sum(nums) - min(nums)*len(nums)

Java implementation

class  {
    public int minMoves(int[] nums) {
        int sum = 0;
        int min = Integer.MAX_VALUE;
        
        for(int num : nums){
            sum += num;
            min = num < min ? num : min;
        }
        return sum - min * nums.length;
    }
}

Time complexity

O(n).

Space complexity

O(1).

Links

453. Minimum Moves to Equal Array Elements
(中文版) 算法笔记: 力扣#453 最小移动次数使数组元素相等