leetcode 453. Minimum Moves to Equal Array Elements python
来源:互联网 发布:计算机领域中数据是指 编辑:程序博客网 时间:2024/04/30 07:04
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 incrementingn - 1 elements by 1.
Example:
Input:[1,2,3]Output:3Explanation:Only three moves are needed (remember each move increments two elements):[1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]
假设数组元素最终为X,数组最小元素min需要经过X-min次增长,最大元素max需要经过X-max次增长,(X-min)-(X-max)=max-min就是max不变 其余元素包括min 增长的次数,经过这些次增长后,min元素和max元素大小相等,且它俩成为当前数组最小元素。 然后我们再让这俩最小元素增长到当前数组最大元素(初始数组次最大元素max2)的大小,增长的次数是max2-min,最终使得这三个元素相等。每一次增长都让数组中大小相同的元素增加一个,从1到2到3~~~n,故总共增加了max-min,max2(初始数组次最大元素)-min,max3-min,,,总和就是sum-min*n
class Solution(object):
def minMoves(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
s = sum(nums)
m = min(nums)
return s-len(nums)*m
- leetcode 453. Minimum Moves to Equal Array Elements python
- Leetcode Minimum Moves to Equal Array Elements
- leetcode :Minimum Moves to Equal Array Elements
- LEETCODE--Minimum Moves to Equal Array Elements
- LeetCode : Minimum Moves to Equal Array Elements
- leetcode-Minimum Moves to Equal Array Elements
- leetcode[Minimum Moves to Equal Array Elements]
- Minimum Moves to Equal Array Elements(leetcode)
- LeetCode 453. Minimum Moves to Equal Array Elements
- 【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
- LeetCode 453. Minimum Moves to Equal Array Elements
- 453.[Leetcode]Minimum Moves to Equal Array Elements
- LeetCode-453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements
- PyCharm自动安装pymysql包失败
- font-size:0; 使用技巧
- UVA 11090 Going in Cycle!! SPFA判断负环+二分
- x&(x-1)
- Java生产者消费者问题详解
- leetcode 453. Minimum Moves to Equal Array Elements python
- How tomcat works——13 Host 和 Engine
- JVM内存管理机制
- [LeetCode]373. Find K Pairs with Smallest Sums
- Linux内核工作队列之任务执行
- 利用Java反射机制实现类的加载
- Markdown 简易入门教程
- java 的八种原生数据类型
- 1.Redis简介