leetcode:453. Minimum Moves to Equal Array Elements
2016-11-09 21:45
435 查看
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:
大意是讲 n个数,每次要增加n-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]
大意是讲 n个数,每次要增加n-1个(那不就是减小一个数吗)问最多增加多少次(那不就是减少多少次吗)?
反过来想就简单了。即减少多少次能到全相等。
class Solution(object): def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ m=min(nums) ans=0 for i in nums: ans+=i-m return ans
相关文章推荐
- 【leetcode】453. Minimum Moves to Equal Array Elements【E】
- 小白笔记---------------------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
- 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】【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