LeetCode 453. Minimum Moves to Equal Array Elements
2016-11-06 10:04
627 查看
Problem Statement
(Source) 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]
Solution
Think about this problem in the reversed direction. How about decrementing exactly one element per move?class Solution(object): def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ return sum(nums) - min(nums) * len(nums)
Complexity Analysis:
Time Complexity: O(n).
Space Complexity: O(1).
相关文章推荐
- 453. Minimum Moves to Equal Array Elements [LeetCode]
- LeetCode 453. Minimum Moves to Equal Array Elements
- Leetcode-453. Minimum Moves to Equal Array Elements
- 【Leetcode】453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements
- 【LeetCode】 453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements
- LeetCode_453. Minimum Moves to Equal Array Elements
- 【leetcode】【Easy】【453. Minimum Moves to Equal Array Elements】【math】
- leetcode 453. Minimum Moves to Equal Array Elements
- Leetcode 453. Minimum Moves to Equal Array Elements 使数组相等 解题报告
- LeetCode 453. Minimum Moves to Equal Array Elements
- leetcode:453. Minimum Moves to Equal Array Elements
- leetcode 453. Minimum Moves to Equal Array Elements
- LeetCode-453. Minimum Moves to Equal Array Elements
- 小白笔记---------------------leetcode( 453. Minimum Moves to Equal Array Elements )
- [leetcode]453. Minimum Moves to Equal Array Elements
- [leetcode] 453. Minimum Moves to Equal Array Elements 解题报告
- LeetCode 453. Minimum Moves to Equal Array Elements
- LeetCode-453. Minimum Moves to Equal Array Elements